This project provides a software implementation of a regular expression engine for matching text patterns in JavaScript. It has efficient linear time and space complexity for advanced features like lookarounds and capture groups. The engine is written in OCaml and aims to improve privacy-preserving and digital trust by offering a reliable and efficient regex matching solution.

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".