A tiny, dependency-free regex engine for Go: guaranteed linear-time matching (no ReDoS), a fluent builder, and Explain() to describe any pattern in plain English.
-
Updated
Jul 14, 2026 - Go
A tiny, dependency-free regex engine for Go: guaranteed linear-time matching (no ReDoS), a fluent builder, and Explain() to describe any pattern in plain English.
A linear-time regular-expression engine (Pike VM) built from scratch. Immune to ReDoS: on (a+)+$ Python's re grows exponentially while rejit stays flat. Every CI run cross-checks 10,000 generated pattern/text pairs against re — zero disagreements.
Linear-time, ReDoS-safe C++20 header-only regex engine with bounded lookarounds + an re-compatible Python binding
Minimal regex engine for fastC — Thompson NFA, no backreferences, linear-time matching. Part of the fastc-core six-month set.
A (partially) linear-time regex engine in Zig
Add a description, image, and links to the thompson-nfa topic page so that developers can more easily learn about it.
To associate your repository with the thompson-nfa topic, visit your repo's landing page and select "manage topics."