4 ms·
You can also just implement an NFA but apply determinization to much of it, with tight memory allocation bounds, to get most of the benefit.
by jonstewart 5y ago
You can also just implement an NFA but apply determinization to much of it, with tight memory allocation bounds, to get most of the benefit.
- rurban 5y agoyeah, with practical backtracking regexes they limit their recursion depth to about 10. with DFA expansion this was pretty hard to implement, with simple NFA's it was trivial. Pratt and esp. PEG solve the determinism problem, even better than yacc.