<?xml version="1.0" standalone="yes"?>
<Paper uid="P87-1016">
  <Title>ON THE SUCCINCTNESS PROPERTIES OF UNORDERED CONTEXT-FREE GRAMMARS</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1 Abstract
</SectionTitle>
    <Paragraph position="0"> We prove in this paper that unordered, or ID/LP grammars, are e.xponentially more succinct than context-free grammars, by exhibiting a sequence (L,~) of finite languages such that the size of any CFG for L,~ must grow exponentially in n, but which can be described by polynomial-size ID/LP grammars. The results have implications for the description of free word order languages.</Paragraph>
  </Section>
class="xml-element"></Paper>