Re: Finite State Machines in compilers

"M. en C. Eduardo René Rodríguez Ávila" <eravila@spin.com.mx>
16 Nov 1997 22:53:12 -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: "M. en C. Eduardo René Rodríguez Ávila" <eravila@spin.com.mx>
Newsgroups: comp.compilers
Date: 16 Nov 1997 22:53:12 -0500
Organization: Compilers Central
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.


      Check "The Theory and Practice of Compiler Writing", Jean-Paul Tremblay
and Paul G. Sorenson, McGraw-Hill ISBN 0-07-066616-4, Chapter 4.




                                                                                              Saludos...
                                                                                              Best regards...




M. en C. Eduardo René Rodríguez Avila _ _
      Instituto Politécnico Nacional \/\\/_/_
      Unidad Interdisciplinaria de Ingenieria y Ciencias / \ /\_\
      Sociales y Administrativas \ \\/_/
      Sección de Estudios de Posgrado e Investigación \/_\/_/
              e.r.rodriguez@ieee.org e.r.rodriguez@computer.org
                                            http://spin.com.mx/~eravila
--


Post a followup to this message

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