3 ms·
> And yes, derivatives build full DFAs. Those are a no-go in a general purpose regex engine. Lazily compute derivatives? From memory Rust regex computes and ca
by hayley-patton 4y ago
> And yes, derivatives build full DFAs. Those are a no-go in a general purpose regex engine.
Lazily compute derivatives? From memory Rust regex computes and caches a DFA lazily from the NFA, for comparison.
- burntsushi 4y agoFeel free to show me an implementation that does it with an alphabet of bytes, not codepoints, while maintaining support for Unicode classes. It doesn't strike me as something amenable to lazy compilation. But maybe I'm wrong.