Great discussion on the tradeoffs between backtracking and various automata-based regex implementations https://lobste.rs/s/fq8uil/aho_corasick#c_4xkm7z … @burntsushi5 @oilshellhttps://twitter.com/lobsters/status/1060137466705788930 …
Thanks! To clarify, it's not talking about backtracking (other than a couple mentions). It's about clarifying the implementation differences between a simulation of an NFA via Thompson's construction and a DFA. Both are firmly in the realm of finite automata, not backtracking.