Parsing Theory: Volume II LR(k) and LL(k) Parsing (Monographs in Theoretical Computer Science. An EATCS Series) (Englisch) Gebundene Ausgabe von Seppo Sippu (Autor), Eljas Soisalon-Soininen (Autor) This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-free parsing. Volume II (Chapters 6 to 10) contains a thorough treat ment of the theory of the two most important deterministic parsing methods: LR(k) and LL(k) parsing. Volume II is a continuation of Volume I; together these two volumes form an integrated work, with chapters, theorems, lemmas, etc. numbered consecutively. Volume II begins with Chapter 6 in which the classical con structions pertaining to LR(k) parsing are presented. These include the canonical LR(k) parser, and its reduced variants such as the LALR(k) parser and the SLR(k) parser. The grammarclasses for which these parsers are deterministic are called LR(k) grammars, LALR(k) grammars and SLR(k) grammars; properties of these grammars are also investigated in Chapter 6. A great deal of attention is paid to the rigorous development of the theory: detailed mathematical proofs are provided for most of the results presented. 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. …

von Seppo Sippu, Eljas Soisalon-Soininen Verlag: Springer

1990 - Hardcover 427 S. 17,8 x 2,5 x 25,4 cm

Zustand: gebraucht - sehr gut, This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-free parsing. Volume II (Chapters 6 to 10) contains a thorough treat ment of the theory of the two most important deterministic parsing methods: LR(k) and LL(k) parsing. Volume II is a continuation of Volume I; together these two volumes form an integrated work, with chapters, theorems, lemmas, etc. numbered consecutively. Volume II begins with Chapter 6 in which the classical con structions pertaining to LR(k) parsing are presented. These include the canonical LR(k) parser, and its reduced variants such as the LALR(k) parser and the SLR(k) parser. The grammarclasses for which these parsers are deterministic are called LR(k) grammars, LALR(k) grammars and SLR(k) grammars; properties of these grammars are also investigated in Chapter 6. A great deal of attention is paid to the rigorous development of the theory: detailed mathematical proofs are provided for most of the results presented. 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.

This work is Volume II of a two-volume monograph on the theory of deterministic parsing of context-free grammars. Volume I, "Languages and Parsing" (Chapters 1 to 5), was an introduction to the basic concepts of formal language theory and context-free parsing. Volume II (Chapters 6 to 10) contains a thorough treat ment of the theory of the two most important deterministic parsing methods: LR(k) and LL(k) parsing. Volume II is a continuation of Volume I; together these two volumes form an integrated work, with chapters, theorems, lemmas, etc. numbered consecutively. Volume II begins with Chapter 6 in which the classical con structions pertaining to LR(k) parsing are presented. These include the canonical LR(k) parser, and its reduced variants such as the LALR(k) parser and the SLR(k) parser. The grammarclasses for which these parsers are deterministic are called LR(k) grammars, LALR(k) grammars and SLR(k) grammars; properties of these grammars are also investigated in Chapter 6. A great deal of attention is paid to the rigorous development of the theory: detailed mathematical proofs are provided for most of the results presented. 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.

Produktart:

📚 Bücher

Autor(en):

Seppo Sippu (Autor), Eljas Soisalon-Soininen (Autor)

Anbieter:

BUCHSERVICE / ANTIQUARIAT Lars-Lutzer *** LITERATUR RECHERCHE *** ANTIQUARISCHE SUCHE

Bestell-Nr.:

BN25496

Katalog:

Psychologie / Pädagogik / Allgemeine Psychologie

Sammlung(en):