Elements of Formal Systems

  • William M. Waite
  • Gerhard Goos
Part of the Texts and Monographs in Computer Science book series (MCS)


Formal grammars, in particular context-free grammars, are the tools most frequently used to describe the structure of programs. They permit a lucid representation of that structure in the form of parse trees, and one can (for the most part mechanically) specify automata that will accept all correctly-structured programs (and only these). The automata are easy to modify so that they output any convenient encoding of the parse tree.


Formal System Regular Expression Regular Language Finite Automaton Parse Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1984

Authors and Affiliations

  • William M. Waite
    • 1
  • Gerhard Goos
    • 2
  1. 1.Department of Electrical EngineeringUniversity of ColoradoBoulderUSA
  2. 2.Institut für Informatik IIUniversität KarlsruheWest Germany

Personalised recommendations