Advertisement

Generalized Deterministic Parsers

  • Dick Grune
  • Ceriel J. H. Jacobs
Part of the Monographs in Computer Science book series (MCS)

Generalized deterministic parsers are general breadth-first context-free parsers that gain efficiency by exploiting the methods and tables used by deterministic parsers, even if these tables have conflicts (inadequate states) in them. Viewed alternatively, generalized deterministic parsers are deterministic parsers extended with a breadth- first search mechanism so they will be able to operate with tables with some multiple, conflicting entries. The latter view is usually more to the point.

Keywords

Parse Tree Prediction Phase Parsing Algorithm Prediction Tree Inadequate State 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Dick Grune
    • 1
  • Ceriel J. H. Jacobs
    • 1
  1. 1.Vrije Universiteit1081 HVNetherlands

Personalised recommendations