Comment by Firerouge
6 years ago
Perhaps a parser exists that can determine if an input regex is runaway backtrack prone, and can automatically switch to a deterministic algorithm?
6 years ago
Perhaps a parser exists that can determine if an input regex is runaway backtrack prone, and can automatically switch to a deterministic algorithm?
Just check if it uses backreferences, otherwise it can be implemented via NFA/DFA.