<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-1057">
  <Title>A Generalized Greibach Normal Form for Definite Clause Grammars</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for context-free grammars.</Paragraph>
    <Paragraph position="1"> The normalized definite clause grammar is declaratively equivalent to the original definite clause grammar, that is, it assigns the same analyses to the same strings.</Paragraph>
    <Paragraph position="2"> Offline-parsability of the original grammar is reflected in an elementary textual property of the transformed grammar. When this property holds, a direct (top-down) Prolog implementation of the normalized grammar solves the parsing problem: all solutions are enumerated on backtracking and execution terminates.</Paragraph>
    <Paragraph position="3"> When specialized to the simpler case of context-free grammars, the GGNF provides a variant to file GNF, where the transformed context-free grammar not only generates the same strings as the original grammar, but also preserves their degrees of ambiguity (this last prop-erty does not hold for the GNF).</Paragraph>
    <Paragraph position="4"> The GGNF seems to be the first normal form result for DCGs. It provides an explicit factorization of the potential sources of uudeeidability for the parsing problem, and offers valuable insights on the computational structure of unification grammars in general.</Paragraph>
  </Section>
class="xml-element"></Paper>