|Finite State Machines in compilers email@example.com (Henrik_Bergstrom) (1997-11-11)|
|Re: Finite State Machines in compilers firstname.lastname@example.org (Robert Trevellyan) (1997-11-13)|
|Re: Finite State Machines in compilers email@example.com (M. en C. Eduardo René Rodríguez Ávila) (1997-11-16)|
|Re: Finite State Machines in compilers firstname.lastname@example.org (Chris Clark USG) (1997-11-20)|
|Date:||11 Nov 1997 14:32:39 -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.
If someone has some information on the subject or could point me to some
other source I'd be grateful.
Some of you might be interested in a program I have written as part of the
thesis work. PetC as it is known is a program for simulating and
visualisation of FSMs. Its intended for teaching and therefor have little
interest for someone who want a tool for building compilers. It can be
found at: http://www.dsv.su.se/~h-bergst/petc/petc.html
Return to the
Search the comp.compilers archives again.