<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-1101">
  <Title>Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms</Title>
  <Section position="7" start_page="622" end_page="622" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> This paper surveyed the issues arising in the construction of finite-state approximations of left-corner parsers. The different kinds of parsers were presented as grammar transforms, which let us abstract away from the algorithmic details of parsing algorithms themselves. It derived the various forms of the left-corner parsing algorithms in terms of grammar transformations from the original left-corner grammar transform.</Paragraph>
  </Section>
class="xml-element"></Paper>