<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-2106">
  <Title>Parsing Schemata for Grammars with Variable Number and Order of Constituents</Title>
  <Section position="7" start_page="737" end_page="738" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have defined state transition grammars (STG) as an intermediate formalism between grammars and parsing algorithnls. They complement the parsing schemata formalism of Sikkel (1993). A parsing schema abstracts from unimportant algorithmic details and thus, like STG's, represents a well-defined level of abstraction between grammars and parsers.</Paragraph>
    <Paragraph position="1"> STG's add another abstraction to parsing schemata, namely on the grammar side. Therefore, we argued, a t)arsing schenla defined over a STG represents a very high level description of a tabular parsing algorithm that can be applied to various gralnlnar tbrmalisms. In this paper we concentrated on grammar formalisms with a flexible constituent structure, i.e., where the  mmfl)er and order of subconstituents st)e(:ified by a grammar i)roduction may not \[)e fixed. In particular, we have discussed extended context-free grammars (ECFG), II)/LP grammars, and grammars in which admissible trees are delined by means of local tree ('onstraints cxI)resscd in a simple logical language.</Paragraph>
  </Section>
class="xml-element"></Paper>