|building a lexer generator email@example.com (2006-11-29)|
|Re: building a lexer generator firstname.lastname@example.org (Karsten Nyblad) (2006-12-01)|
|Re: building a lexer generator email@example.com (2006-12-01)|
|Re: building a lexer generator DrDiettrich1@aol.com (Hans-Peter Diettrich) (2006-12-03)|
|Re: building a lexer generator firstname.lastname@example.org (2007-01-05)|
|Date:||1 Dec 2006 09:18:56 -0500|
|Organization:||Department of Computer Science, University of Copenhagen|
|Posted-Date:||01 Dec 2006 09:18:56 EST|
> I'M Trying To Build A Lexer Generator But I'Ve Only Been Hand Coded
> Lexer Before So I'M A Bit Stuck On The Design Side.
> I've already done searches on the various steps needed to build such
> tools but i still miss some points. For example, when i have five
> keywords and one identifier definition how do the lexer process them ?
> Does it have a DFA for each keywords and the identifier or does it
> process all with the same FSM ? I would bet on the second one but
> this mean that i must merge all the DFA (or i surely missed
As John said, the usual thing to do is to build a combined DFA -- not
by constructin individual DFAs and then combining these, but by
building individual NFAs, combining them and then convert the combined
NFA into a DFA.
(which are the first two chapters of my compiler notes/book) shows
Return to the
Search the comp.compilers archives again.