<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-2026">
  <Title>GPSG Parsing, Bidirectional Charts, anti Connection Graphs</Title>
  <Section position="3" start_page="0" end_page="0" type="concl">
    <SectionTitle>
7. Conclusion
</SectionTitle>
    <Paragraph position="0"> The method we propose makes it possible to parse efficiently GPSG grammars but unlike other apo proaches \[1,3,7,8\] it allows the grammar to be ex..</Paragraph>
    <Paragraph position="1"> pressed in the exact formalism described by Gazdar arid his colleagues in \[4\] and does not require an intractable preprocessing ptiase like would do e..g. thc compilation of the grmnmar into an equivalent set of context-free productions.</Paragraph>
    <Paragraph position="2"> Although we did not study in detail the suit-.</Paragraph>
    <Paragraph position="3"> ability of the method when the control agreement principle is taken into account, we do not see any major incompatibility with the use of a connection graph to index the various modules of a GPSG gram~ Knar * t CPU time is only an indication of the efficiency of the method since it measures also our implementation. No particular effort was spend on tuning the implementation.</Paragraph>
  </Section>
class="xml-element"></Paper>