<?xml version="1.0" standalone="yes"?>
<Paper uid="P96-1032">
  <Title>Efficient Tabular LR Parsing</Title>
  <Section position="12" start_page="244" end_page="245" type="ackno">
    <SectionTitle>
Acknowledgements
</SectionTitle>
    <Paragraph position="0"> The first author is supported by the Dutch Organization for Scientific Research (NWO), under grant 30500-802. Part of the present research was done while the second author was visiting the Center for Language and Speech Processing, Johns Hopkins University, Baltimore, MD.</Paragraph>
    <Paragraph position="1"> We received kind help from John Carroll, Job Honig, Kees Koster, Theo Vosse and Hans de Vreught in finding the grammars mentioned in this paper. Generous help with locating relevant literature was provided by Anton Nijholt, Rockford Ross, and Arnd Ruflmann.</Paragraph>
    <Paragraph position="2"> 3As remarked before by Nederhof (1993), the algorithms by Schabes (1991) and Leermakers (1989) are not really related to LR parsing, although some notation used in these papers suggests otherwise.</Paragraph>
  </Section>
class="xml-element"></Paper>