Re:My Most Important Project Was a Bytecode Interpreter
by kjax on Thursday September 22, 2016 @01:52AM
(#12554710)
Lexer generators typically allow describing rules with regular expressions, but through Thompson's construction, subset construction, and DFA minimization, you can end up with a blazing fast/optimized DFA that processes your input at maximum speed.
[ Parent
| on HN ]
There are no comments on this comment yet.