<?xml version="1.0" standalone="yes"?>
<Paper uid="P88-1031">
  <Title>Graph-structured Stack and Natural Language Parsing</Title>
  <Section position="8" start_page="256" end_page="256" type="concl">
    <SectionTitle>
8. Summary
</SectionTitle>
    <Paragraph position="0"> The graph-structured stack was introduced in the Generalized LR parsing algorithm \[7, 8\] to handle nondeterminism in LR parsing. This paper extended the general idea to several other parsing methods: ATN, principle-based parsing and categodal grammar.</Paragraph>
    <Paragraph position="1"> We suggest considering the graph-structure stack for any problems which employ a stack nondeterministically. It would be interesting to see whether such problems are found outside the area of natural language parsing.</Paragraph>
  </Section>
class="xml-element"></Paper>