Skip to main content
SpringerLink
Log in

Fast recognition of context-sensitive structures

Schanelle Analyse kontextsensitiver Strukturen

  • Published:
Computing Aims and scope Submit manuscript

Abstract

This paper is concerned with an extension of context-free LL(k) grammars, called RLL(k) grammars. RLL(k) grammars are powerful enough to generate non-context-free languages. In particular context-sensitive constructs of programming languages can be formalized conveniently. RLL(k) grammars have the pleasant property that fast syntactical check procedures exist. An algorithm for syntactical analysis with linear average cost is developed in this paper. A worst case quadratic upper bound is derived.

Zusammenfassung

In dieser Arbeit werden Erweiterungen der kontextfreien LL(k) Grammatiken, sogenannte RLL(k) Grammatiken, vorgestellt. Die Erzeugungskraft von RLL(k) Grammatiken ist ausreichend, auch nichtkontextfreie Sprachen darzustellen. So lassen sich z. B. kontextsensitive Konstruktionen in Höheren Programmiersprachen in bequemer Weise formal beschreiben. Ferner können für RLL(k) Grammatiken Schnelle Syntaxanalyserverfahren angegeben werden. Es wird ein Algorithmus entwickelt, der im Durschnitt linear wachsende Kosten verursacht. Darüber hinaus wird eine quadratisch anwachsende obere Schranke für den Analyseaufwand nachgewiesen.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A. V., Hopcroft, J. D., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley Publ. Company 1974.

    Google Scholar 

  2. Aho, A. V., Ullman, J. D.: The Theory of Parsing, Translation and Compiling, Vol. 1. Englewood Cliffs, N. J.: Prentice-Hall 1972.

    Google Scholar 

  3. Barth, G.: Protokollgrammatiken — Ein Konzept zur zeitvarianten Kontrolle bei kontentfreien Ersetzungen. Dissertation, Universität Kaiserslautern, 1977.

  4. Ginsburg, S., Spanier, E. H.: Control Sets on Grammars. Math. Systems Theory2, 159 (1968).

    Google Scholar 

  5. Hopcroft, J. E., Ullman, J. D.: Formal Languages and their Relation to Automata. Reading, Mass.: Addison-Wesley Publ. Company 1969.

    Google Scholar 

  6. Kasai, T.: A Hierarchy between Contextfree and Contextsensitive Languages. JCSS4, 492 (1970).

    Google Scholar 

  7. Knuth, D. E.: The Art of Computer Programming, Vol. 3, 2nd ed. Reading, Mass: Addison-Wesley Publ. Company 1975.

    Google Scholar 

  8. Maurer, H.: Datenstrukturen und Programmierverfahren. Stuttgart: Teubner 1974.

    Google Scholar 

  9. Mayer, O.: Syntaxanalyse. (BI-Hochschultaschenbücher, Reihe Informatik, Band 27.) Mannheim: 1978.

  10. Salomaa, A.: Formal Languages. London: Academic Press 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, D-6750, Kaiserslautern, Federal Republic of Germany

    G. Barth

Authors
  1. G. Barth
    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

Barth, G. Fast recognition of context-sensitive structures. Computing 22, 243–256 (1979). https://doi.org/10.1007/BF02243565

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation