Re: Finite State Machines in compilers

"Robert Trevellyan" <robt@sensi.co.uk>
13 Nov 1997 23:38:19 -0500

          From comp.compilers
Related articles
Finite State Machines in compilers h-bergst@dsv.su.se (Henrik_Bergstrom) (1997-11-11)
Re: Finite State Machines in compilers robt@sensi.co.uk (Robert Trevellyan) (1997-11-13)
Re: Finite State Machines in compilers eravila@spin.com.mx (M. en C. Eduardo René Rodríguez Ávila) (1997-11-16)
Re: Finite State Machines in compilers clark@quarry.zk3.dec.com (Chris Clark USG) (1997-11-20)
| List of all articles for this month |
From: "Robert Trevellyan" <robt@sensi.co.uk>
Newsgroups: comp.compilers
Date: 13 Nov 1997 23:38:19 -0500
Organization: Sensible Software
References: 97-11-058
Keywords: FSM

> 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.


robT
--
Robert Trevellyan
Sensible Software
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.