[gnu.gcc] lexical analyzes with DFA:s

ewerlid@kuling.UUCP (Ove Ewerlid) (06/08/89)

 Flex is fast. Using the full-table options produces very fast DFA:s.
The algoritm for DFA:s can, as pointed out in the Flex doc, be implemented
in a much faster way. One way is to replace the transition-tables with
assemblercode. I can see DFA:s that is at least 5 times faster than the ones
flex generates. Can anyone give me a pointer at litterature where
DFA-generating using direct code is discussed.

 Also, has anyone tried to dynamically build DFA-tables for symbollookup, etc?