Informal Description of the Algorithm
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.
KeywordsParse Tree Multiple Entry Parsing Algorithm Local Ambiguity Packed Node
Unable to display preview. Download preview PDF.