Parsing Theory
Subtitle: Volume II LR(k) and LL(k) Parsing
By: by Seppo Sippu, Eljas Soisalon-Soininen
Contributors: Soisalon-Soininen, Eljas
Series: EATCS, Monographs on Theoretical Computer Science -- 20; EATCS, Monographs on Theoretical Computer Science -- 20
Publisher: Springer Berlin Heidelberg
Published: 1990
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] :
Number of pages: 427
ISBN-13: 9783642080791; 9783662084243
Subjects: Computer science; Translators (Computer programs)
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.