8 Jun
2010
8 Jun
'10
1:31 p.m.
John Bytheway wrote:
The library will take this lexer specification and turn it into an NFA, then transform that into a DFA, then encode that as a transition table in an array, *all at compile time*. On reflection, it probably would have been better (and faster) to use the giant-switch-statement approach, rather than an array-based transition table.
Boost.Switch (from Steven Watanabe if I remember well) probably has limitations of its own.