Context-free text grammars | Acta Informatica Skip to main content
Springer Nature Link
Log in

Context-free text grammars

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

A text is a tripleτ=(λ,ρ 1,ρ 2) such that λ is a labeling function, andρ 1 andρ 2 are linear orders on the domain of λ; hence τ may be seen as a word (λ,ρ 1) together with an additional linear orderρ 2 on the domain of λ. The orderρ 2 is used to give to the word (λ,ρ 1) itsindividual hierarchical representation (syntactic structure) which may be a tree but it may be also more general than a tree. In this paper we introducecontext-free grammars for texts and investigate their basic properties. Since each text has its own individual structure, the role of such a grammar should be that of a definition of a pattern common to all individual texts. This leads to the notion of ashapely context-free text grammar also investigated in this paper.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [ER1] Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, Part I: clans, basic subclasses, and morphisms. Theoret. Comput. Sci.70, 277–303 (1990)

    Google Scholar 

  • [ER2] Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, Part II: representation through labeled tree families. Theoret. Comput. Sci.70, 305–342 (1990)

    Google Scholar 

  • [ER3] Ehrenfeucht, A., Rozenberg, G.: Angular 2-structures. Theoret. Comput. Sci.92, 227–248 (1992)

    Google Scholar 

  • [ER4] Ehrenfeucht, A., Rozenberg, G.:T-structures,T-functions, and texts. Theoret. Comput. Sci.116, 227–290 (1993)

    Google Scholar 

  • [EPR] Ehrenfeucht, A., Pas, P. ten, Rozenberg, G.: Combinatorial properties of texts. RAIRO, Theoret. Inf. Appl.27, 433–464 (1993)

    Google Scholar 

  • [EKR] Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.): Graph grammars and their application to computer science (Lect. Notes Comput. Sci., vol. 532) Berlin, Heidelberg, New York: Springer 1990

    Google Scholar 

  • [GRS] Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey theory. New York: Wiley 1980

    Google Scholar 

  • [S] Salomaa, A.: Formal languages. London, New York: Academic Press 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Colorado at Boulder, 80309, Boulder, CO, USA

    A. Ehrenfeucht & G. Rozenberg

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    P. ten Pas & G. Rozenberg

Authors
  1. A. Ehrenfeucht
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. ten Pas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ehrenfeucht, A., ten Pas, P. & Rozenberg, G. Context-free text grammars. Acta Informatica 31, 161–206 (1994). https://doi.org/10.1007/BF01192159

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01192159

Keywords

Search

Navigation