3 ms·
> features which normally translate to nfa (e.g. backrefs) You're very wrong, backreferences in general can't be translated to finite automata (NFA is short fo
by nsajko 4y ago
> features which normally translate to nfa (e.g. backrefs)
You're very wrong, backreferences in general can't be translated to finite automata (NFA is short for nondeterministic finite automaton). See these comments:
https://news.ycombinator.com/item?id=18431610 https://news.ycombinator.com/item?id=18431610
https://news.ycombinator.com/item?id=27877743 https://news.ycombinator.com/item?id=27877743
- masklinn 4y agoMaybe try to read my comment again because I don't think you understood what I wrote.
- nsajko 4y agoYou say: > resistant to catastrophic backtracking despite features which normally translate to nfa I interpret this as you equating NFA with backtracking engines, which would be incorrect. Is my interpretation wrong?