The Linden Regex project aims to take a new look at modern regexes.
Check out the project homepage.
Ocaml Linear Engine for JavaScript Regexes, implementing the algorithms described in Linear Matching of JavaScript Regular Expressions at PLDI24
A biased barometer for gauging the relative speed of some regex engines on a curated set of tasks.
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
This fork extends the RE2 regex engine with support for captureless lookbehinds. This implements the algorithm described in the Linear Matching of JavaScript Regular Expressions PLDI 2024 paper (section 4.1).
Loading…
Loading…
