RE#: how we built the world's fastest regex engine in F#
Summary
The article presents RE#, a fast F#-based regex engine that adds intersection and complement to regex, while preserving linear-time guarantees. It explains core ideas—Brzozowski derivatives, minterm compression, and lazy DFA construction without NFAs—and discusses practical implications for real-world pattern matching, including lookarounds and leftmost-longest semantics.