Projects

A production‑grade regex engine implementing Thompson’s construction to translate regular expressions into ε‑NFA, followed by subset construction (powerset) to obtain a minimal DFA for O(n) matching. Supports concatenation, alternation, Kleene star, character classes, and anchoring. Includes rigorous property‑based testing against a Brzozowski derivative reference implementation.