Moreover , this approach often results in smaller lexers , as re2c applies a number of optimizations such as DFA minimization and the construction of tunnel automaton .
The resulting program is faster than its table - driven counterpart and much easier to debug and understand .
This approach often results in smaller lexers , as re2c applies a number of optimizations such as DFA minimization and the construction of tunnel automaton .
The resulting program is faster than its table - driven counterpart and much easier to debug and understand .