<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1052">
  <Title>Simplifying Deterministic Parsing</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1. INTRODUCTION
</SectionTitle>
    <Paragraph position="0"> Marcus has effectively described the advantages of a deterministic parsing model as is embodied in his PARSIFAL system.</Paragraph>
    <Paragraph position="1"> Unfortunately a hindrance to the usability of PARSIFAL is the complexity of its grammar. The popularity of Woods' ATN parsing model \[Woods 70\] demonstrates that the ease with which a grammar can be written and understood is one of the greatest factors contributing to its usability. This paper describes DPARSER (Deterministic PARSER) which is an implementation of an alternate deterministic parsing model intended to reduce the complexity of deterministic grammars.</Paragraph>
    <Paragraph position="2"> DPARSER has been implemented and a small grammar written. In developing the grammar the focus has been on dealing with the syntactic ambiguities between the attachment of phrases and thus it can currently handle only simple noun and verb phrases.</Paragraph>
  </Section>
class="xml-element"></Paper>