Skip to main content
SpringerLink
Log in

Deterministic parsing for augmented context-free grammars

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1995 (MFCS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 969))

  • 950 Accesses

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).

Work partially supported by MURST 60% (Italy), ESPRIT-BRA ASMICS 2 n. 6317 (E.U.) and CNR-CSISEI (Italy).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Allevi, A. Cherubini, S. Crespi Reghizzi, “Breadth-first Phrase-Structure Grammars and Queue Automata”, in LNCS 324, 1988, pp. 162–170

    Google Scholar 

  2. F. Brandenburg, “On the Intersections of Stacks and Queues”, in Theoretical Computer Science 226, 1981, pp. 61–68

    Google Scholar 

  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–156

    Google Scholar 

  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, 1994

    Google Scholar 

  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–203

    Google Scholar 

  6. A. Cherubini, P. San Pietro, “Polynomial Time Parsing Algorithm for k-Depth Languages”, to appear in Journal of Computer and Systems Science, 1995

    Google Scholar 

  7. B. Franchi Zannettacci, B. Vauquelin, “Automates à File” (in French) (Queue Automata), in Theoretical Computer Science 11, 1980, pp. 221–225

    Google Scholar 

  8. Y. Guan, G. Hotz, A. Reichert, “Tree Grammars with multilinear Interpretation”, Technical Report, University of Saarbrücken, 1992

    Google Scholar 

  9. G. Hotz, G. Pitsch, “On Parsing Coupled Context-free Languages”, submitted for publication, 1994

    Google Scholar 

  10. A. K. Joshi, L. S. Levi, M. Takahashi, “Tree adjunct Grammars”, in Journal on Computer Systems Science 10, 1975, pp. 136–173

    Google Scholar 

  11. P. M. II Lewis, R. E. Stearns, “Syntax-directed Transduction”, in Journal of ACM 15, 1968, pp. 464–488

    Google Scholar 

  12. G. Pitsch, “LL(k) Coupled Context-free Grammars”, in Journal on Information and Processing Cybernetics, EIK 29, 6, 1993, pp. 389–413

    Google Scholar 

  13. G. Satta, “Tree-adjoining Grammar Parsing and Matrix Multiplication”, in Computational Linguistics, 20, 2, 1994, pp. 173–191

    Google Scholar 

  14. K. Vijay Shanker, D. J. Weir, “The Equivalence of four Extensions of Context-free Grammars”, in Mathematical Systems Theory 27, 1994, pp. 511–546

    Google Scholar 

  15. W. A. Woods, “Transition Network Grammars for natural Language Analysis”, in Communications of ACM, 13, 10, 1970, pp. 591–606

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo Da Vinci n. 32, I-20133, Milano, Italy

    Luca Breveglieri & Stefano Crespi Reghizzi

  2. Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo Da Vinci n. 32, I-20133, Milano, Italy

    Alessandra Cherubini

Authors
  1. Luca Breveglieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessandra Cherubini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefano Crespi Reghizzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Wiedermann Petr Hájek

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Breveglieri, L., Cherubini, A., Reghizzi, S.C. (1995). Deterministic parsing for augmented context-free grammars. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-60246-1_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60246-0

  • Online ISBN: 978-3-540-44768-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation