RE#: high performance derivative-based regex matching with intersection, complem
9 months ago
- #regex
- #automata-theory
- #performance
- RE# is a tool for regular expression matching based on symbolic derivatives.
- It avoids backtracking and supports complement, intersection, and lookarounds.
- The matching algorithm has input-linear complexity, both theoretically and experimentally.
- RE# is over 71% faster than the next fastest regex engine in Rust on baseline tests.
- It outperforms state-of-the-art engines on extended benchmarks, often by orders of magnitude.