<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2141">
  <Title>COMPUTING FIRST AND FOLLOW FUNCTIONS FOR, FEA'rURE-THEoRE'rR? GRAMMARS</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
COMPUTING FIRST AND FOLLOW FUNCTIONS FOR,
FEA'rURE-THEoRE'rR? GRAMMARS
</SectionTitle>
    <Paragraph position="0"/>
    <Paragraph position="2"> This paper des(:ribes an algorithm ff)r (;he comlmtation of FII{ST and F()I~LOW sets for use with f(;atur(!-thcor('~(;ic grammars, in which the value of the sets t:onsist;s of pairs of featurel;heorctic cat;o, gorit;s. The Mgori(;hm tn'(;sezve, s as mu(:h informed;ion from th(; gratnnmrs a,s 1)ossibh',, using negative restriction to (h;fin(~ (',quivah;nc(,, classes. Addition of a simple (Ia(;a S(;I;IIt:tIII'e leads to ;m order of ilta, glli|;lld(,; iln\[)rov('Jll(;ii(; ilt exet:tl(;ion l;ilne ov(~r a naivo, iHlph;mo, ntation.</Paragraph>
  </Section>
class="xml-element"></Paper>