This is the second volume of a two-volume set representing an up-to-date reference work on the theory of deterministic parsing of context-free grammars. Volume I is an introduction to the basic concepts of formal language theory and context-free parsing. Volume II contains a thorough treatment of the theory of the two most important deterministic parsing methods. The two volumes together form an integrated work with chapters, theorems, lemmas, etc. numbered consecutively. The emphasis is on LR(k) and LL(k) methods, and special attention is paid to the efficient implementation of LR(k) and LL(k) parsers. Construction algorithms for parsers are derived from general graph-theoretic methods. Complexity questions about parsable grammars are analysed. The work can be used as a textbook in graduate and senior undergraduate courses on parsing theory and compiler design.
6. LR(k) Parsing.- 7. Construction and Implementation of LR(1) Parsers.- 8. LL(k) Parsing.- 9. Syntax Error Handling.- 10. Testing Grammars for Parsability.- Bibliography to Volume II.- Index to Volume II.
Series: Monographs in Theoretical Computer Science
Number Of Pages: 427
Published: 14th November 1990
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.5 x 15.5
Weight (kg): 2.32