|Finite State Machines in compilers firstname.lastname@example.org (Henrik_Bergstrom) (1997-11-11)|
|Re: Finite State Machines in compilers email@example.com (Robert Trevellyan) (1997-11-13)|
|Re: Finite State Machines in compilers firstname.lastname@example.org (M. en C. Eduardo René Rodríguez Ávila) (1997-11-16)|
|Re: Finite State Machines in compilers email@example.com (Chris Clark USG) (1997-11-20)|
|From:||"Robert Trevellyan" <firstname.lastname@example.org>|
|Date:||13 Nov 1997 23:38:19 -0500|
> As part of my work on my masters thesis I need information on how Finite
> State Machines (FSMs) are used in complers. I don't meen that they are
> used for constructing the lexical analyser, but rather things like how
> they are implemented, how large the state-set is etc.
Take a look at "Compilers: Principles, Techniques and Tools", Alfred
V. Aho, Ravi Sethi, Jeffrey D. Ullman, Addison-Wesley, 1986 (or later
edition?). It's been pretty much the Bible of compiler writing,
although by now there may be a successor.
Return to the
Search the comp.compilers archives again.