Advertisement

Informal Description of the Algorithm

  • Masaru Tomita
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 8)

Abstract

This chapter gives an informal description of our algorithm. First, we review the standard LR parsing algorithm with an example. Then, section 2.3 extends the standard LR parsing algorithm with the idea of a graph-structured stack, so that it can handle natural language grammars. Finally, section 2.4 describes how to represent all possible parse trees efficiently, so that as the ambiguity of a sentence grows exponentially, it takes at most polynomial space to represent them.

Keywords

Parse Tree Multiple Entry Parsing Algorithm Local Ambiguity Packed Node 
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 New York 1986

Authors and Affiliations

  • Masaru Tomita
    • 1
  1. 1.Carnegie-Mellon UniversityUSA

Personalised recommendations