<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2217">
  <Title>A tabular interpretation of a class of 2-Stack Automata</Title>
  <Section position="7" start_page="1338" end_page="1338" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> This paper unifies different results about TAGs and LIGs in an uniform setting and illustrates the advantages of a clear distinction between the use of an operational device and the evaluation of this device. The operational device (here SD-2SA) helps us to focus on the description of parsing strategies (for LIGs and TAGs), while, independently, we design an efficient evaluation mechanism for this device (here tabular interpretation with complexity O(n6)).</Paragraph>
    <Paragraph position="1"> Besides illustrating a methodology, we believe our approach also opens new axes of research.</Paragraph>
    <Paragraph position="2"> For instance, even if the tabular interpretation we have presented has (we believe) the best possible complexity, it is still possible (using techniques outside the scope of this paper, (Barth61emy and Villemonte de la Clergerie, 1996)) to improve its efficiency by refining what information should be kept in each kind of items (hence increasing computation sharing and reducing the number of items).</Paragraph>
    <Paragraph position="3"> To handle TAGs or LIGs with attributes, we also plan to extend SD-2SA to deal with first-order terms (rather than just symbols) using unification to apply transitions and subsumption to check items.</Paragraph>
  </Section>
class="xml-element"></Paper>