<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-1062">
  <Title>NOTES ON LR PARSER DESIGN</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> This paper discusses the design of an LR parser for a specific high-coverage English grammar. The design principles, though, are applicable to a large class of unification-based grammars where the constraints are realized as Prolog terms and applied monotonically through instantiation, where there is no right movement, and where left movement is handled by gap threading.</Paragraph>
    <Paragraph position="1"> The I,R. parser was constructed for experiments on probabilistic parsing and speedup learning, see \[10\]. LI{ parsers are suitable for probabilistic parsing since they contain a representation of the current parsing state, namely the stack and the input string, and since the actions of the parsing tables are easily attributed probabilities conditional on this parsing state. LR parsers are suitable for the speedup learning application since tile learne~ grantmar Ls much larger than the original grammar, and the prefixes of tile learned rules overlap to a very high degree, circumstances that are far&amp;quot; from ideal for the system's original parser. Even though these ends influenced the design of the parser, this article does not focus on these applications but rather on the design and testing of the parser itself.</Paragraph>
  </Section>
class="xml-element"></Paper>