Advertisement

Deterministic parsing for augmented context-free grammars

  • Luca Breveglieri
  • Alessandra Cherubini
  • Stefano Crespi Reghizzi
Contributed Papers Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)

Abstract

In contrast to the usual depth-first derivations of context-free (CF) grammars, breadth-first derivations (also in combination with depth-first ones) yield a class of augmented context-free grammars (ACF) (also termed multi-breadth-depth grammars) endowed with greater generative capacity, yet manageable. The inadequacy of CF grammars to treat distant dependencies is overcome by the new model. ACF grammars can be classified with respect to their disposition, a concept related to the data structure needed to parse their strings. For such augmented CF grammars we consider the LL(k) condition, that ensures top-down deterministic parsing. We restate the condition as an adjacency problem and we prove that it is decidable for any disposition. The deterministic linear-time parser differs from a recursive descent parser by using instead of a LIFO stack a more general data structure, involving FIFO queues and LIFO stacks in accordance with the disposition. ACF grammars can be also viewed as a formalized version of ATN (Augmented Transition Networks).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. Allevi, A. Cherubini, S. Crespi Reghizzi, “Breadth-first Phrase-Structure Grammars and Queue Automata”, in LNCS 324, 1988, pp. 162–170Google Scholar
  2. 2.
    F. Brandenburg, “On the Intersections of Stacks and Queues”, in Theoretical Computer Science 226, 1981, pp. 61–68Google Scholar
  3. 3.
    L. Breveglieri, C. Citrini, S. Crespi Reghizzi, “Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars”, in LNCS 529, 1991, pp. 146–156Google Scholar
  4. 4.
    L. Breveglieri, A. Cherubini, S. Crespi Reghizzi, “A Chomsky-Schützenberger Property for generalised (augmented) Context-free Languages”, Internal Report n. 93-062, Dipartimento di Elettrnonica e Informazione, Politecnico di Milano, 1994Google Scholar
  5. 5.
    A. Cherubini, C. Citrini, S. Crespi Reghizzi, D. Mandrioli, “QRT FIFO Automata, Breadth-first Grammars and their Relations”, in Theoretical Computer Science 85, 1991, pp. 171–203Google Scholar
  6. 6.
    A. Cherubini, P. San Pietro, “Polynomial Time Parsing Algorithm for k-Depth Languages”, to appear in Journal of Computer and Systems Science, 1995Google Scholar
  7. 7.
    B. Franchi Zannettacci, B. Vauquelin, “Automates à File” (in French) (Queue Automata), in Theoretical Computer Science 11, 1980, pp. 221–225Google Scholar
  8. 8.
    Y. Guan, G. Hotz, A. Reichert, “Tree Grammars with multilinear Interpretation”, Technical Report, University of Saarbrücken, 1992Google Scholar
  9. 9.
    G. Hotz, G. Pitsch, “On Parsing Coupled Context-free Languages”, submitted for publication, 1994Google Scholar
  10. 10.
    A. K. Joshi, L. S. Levi, M. Takahashi, “Tree adjunct Grammars”, in Journal on Computer Systems Science 10, 1975, pp. 136–173Google Scholar
  11. 11.
    P. M. II Lewis, R. E. Stearns, “Syntax-directed Transduction”, in Journal of ACM 15, 1968, pp. 464–488Google Scholar
  12. 12.
    G. Pitsch, “LL(k) Coupled Context-free Grammars”, in Journal on Information and Processing Cybernetics, EIK 29, 6, 1993, pp. 389–413Google Scholar
  13. 13.
    G. Satta, “Tree-adjoining Grammar Parsing and Matrix Multiplication”, in Computational Linguistics, 20, 2, 1994, pp. 173–191Google Scholar
  14. 14.
    K. Vijay Shanker, D. J. Weir, “The Equivalence of four Extensions of Context-free Grammars”, in Mathematical Systems Theory 27, 1994, pp. 511–546Google Scholar
  15. 15.
    W. A. Woods, “Transition Network Grammars for natural Language Analysis”, in Communications of ACM, 13, 10, 1970, pp. 591–606Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Luca Breveglieri
    • 1
  • Alessandra Cherubini
    • 2
  • Stefano Crespi Reghizzi
    • 1
  1. 1.Dipartimento di Elettronica e InformazionePolitecnico di MilanoMilanoItaly
  2. 2.Dipartimento di MatematicaPolitecnico di MilanoMilanoItaly

Personalised recommendations