RegElk

Linear regex engine for JavaScript in OCaml

This is a linear regular expression engine for a subset of JavaScript regexes, implemented in OCaml. It supports features like nullable quantifiers, capture reset, and lookarounds with linear time and space complexity. The engine is based on an extension of the PikeVM algorithm, described in the paper "Linear Matching of JavaScript Regular Expressions".