Path: utzoo!yunexus!telly!attcan!utgpu!watmath!uunet!mcvax!kth!draken!bmc1!kuling!ewerlid
From: ewerlid@kuling.UUCP (Ove Ewerlid)
Newsgroups: gnu.gcc
Subject: lexical analyzes with DFA:s (for GAS)
Keywords: DFA GAS FLEX MACHINECODE
Message-ID: <1027@kuling.UUCP>
Date: 8 Jun 89 04:54:13 GMT
Article-I.D.: kuling.1027
Reply-To: ewerlid@mizar.docs.uu.se (Ove Ewerlid)
Organization: Dept. of Computer Systems, Uppsala University, Sweden
Lines: 9


 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?