<?xml version="1.0" standalone="yes"?>
<Paper uid="W91-0113">
  <Title>COMPILING TRACE &amp; UNIFICATION GRAMMAR FOR PARSING AND GENERATION</Title>
  <Section position="6" start_page="107" end_page="107" type="concl">
    <SectionTitle>
4 CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have distinguished three levels of reversibility: runtime reversibility, interpretation reversibility and compilation reversibility. We then have presented Trace &amp; Unification Grammar, a grammar formalism that tries to bridge the gap between uo and GB theory in an undogmatic way and have presented a parser generator and a generator generator that lead to effient runtime code of the grammar both for parsing and for generation. No special effort has been invested to optimize the compilers themselves, so the compilation takes about 1.5 secs. per rule or lexicon entry.</Paragraph>
    <Paragraph position="1"> Due to space limitations many details of the compilation phase could not be discussed.</Paragraph>
    <Paragraph position="2"> The presented grammar formalism has been used to describe a relevant subset of German language and a smaller subset of Chinese. The grammars describe a mapping between German and Chinese and QLF expressions.</Paragraph>
  </Section>
class="xml-element"></Paper>