Skip to main content
  • Textbook
  • © 1990

Parsing Theory

Volume II LR(k) and LL(k) Parsing

Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS, volume 20)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (5 chapters)

  1. Front Matter

    Pages I-IX
  2. LR(k) Parsing

    • Seppo Sippu, Eljas Soisalon-Soininen
    Pages 1-118
  3. Construction and Implementation of LR(1) Parsers

    • Seppo Sippu, Eljas Soisalon-Soininen
    Pages 119-196
  4. LL(k) Parsing

    • Seppo Sippu, Eljas Soisalon-Soininen
    Pages 197-287
  5. Syntax Error Handling

    • Seppo Sippu, Eljas Soisalon-Soininen
    Pages 289-327
  6. Testing Grammars for Parsability

    • Seppo Sippu, Eljas Soisalon-Soininen
    Pages 329-409
  7. Back Matter

    Pages 411-427

About this book

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.

Authors and Affiliations

  • Department of Computer Science, University of Jyväskylä, Jyväskylä, Finland

    Seppo Sippu

  • Department of Computer Science, University of Helsinki, Helsinki, Finland

    Eljas Soisalon-Soininen

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access