<?xml version="1.0" standalone="yes"?>
<Paper uid="C02-1066">
  <Title>Guaranteeing Parsing Termination of Uni cation Grammars</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
2 Preliminaries
</SectionTitle>
    <Paragraph position="0"> The following de nitions are based on Francez and Wintner (In preperation) and Carpenter (1992).</Paragraph>
    <Paragraph position="1"> Grammars are de ned over a nite set FEATS of features, a nite set ATOMS of atoms, and a nite set CATS of categories. A multi-rooted feature structure (MRS) is a pair a11a13a12a14a16a15a17a0a9a18 where a0a20a19 a11 a14a21a15a23a22a24a15a23a25a26a18 is a nite, directed, labelled graph consisting of a set a14 a27 NODES of nodes, a partial function,</Paragraph>
  </Section>
class="xml-element"></Paper>