Parsing, Part II

  • Robert N. Moll
  • Michael A. Arbib
  • A. J. Kfoury
Part of the Texts and Monographs in Computer Science book series (MCS)


In this section we consider strong LL grammars. This grammatical class is important because members of the class, and especially members of the class strong LL(1), are easy to parse and easy to write parsers for. In addition, many important programming language fragments can be given a strong LL(1) description, so parsing based on this grammatical characteristic has important applications in computer science.


Input String Sentential Form Terminal Symbol Start Symbol Context Equation 
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. 1988

Authors and Affiliations

  • Robert N. Moll
    • 1
  • Michael A. Arbib
    • 2
  • A. J. Kfoury
    • 3
  1. 1.University of Massachusetts at AmherstAmherstUSA
  2. 2.University of Southern CaliforniaLos AngelesUSA
  3. 3.Boston UniversityBostonUSA

Personalised recommendations