Grammars with dynamic control sets

  • Gerhard Barth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)


The use of control strings to direct derivations in context-free grammars is generalized in this paper. Recording grammars (rgs) are introduced. Rgs don't have a pregiven set of control strings, but generate these during the course of derivations. The generative capacity for several models of rgs is studied. The control mechanism inherent to rgs establishes relationships between substrings in words. The nature of these relationships is investigated too. Applicability of rgs within both compiler theory and programming language description methods is demonstrated. New characterizations of a-transducer mappings and Turing-transductions are displayed. It is shown further how rgs can be used to formalize non-contextfree features in programming languages.


Regular Language Control Word Characteristic Language Control String Control Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    A.V.Aho, J.D.Ullman: The Theory of Parsing, Translation and Compiling. Vol.1, Prentice-Hall 1972Google Scholar
  2. [2]
    G.Barth: Protokollgrammatiken-Ein Konzept zur zeitvarianten Kontrolle bei kontextfreien Ersetzungen. Doctorial Thesis, Universität Kaiserslautern 1977Google Scholar
  3. [3]
    G. Barth: Efficient Non-Contextfree Parsing. Proc. of 7th Annual GI-Conference, Informatik-Fachberichte No.10, Springer Berlin-Heidelberg-New York, pp.1–15Google Scholar
  4. [4]
    K. Culik, C.W. Morey: Formal Schemes for Language Translations. Int.J.Comp.Math. Section A, 3(1971), pp.17–48Google Scholar
  5. [5]
    S.Ginsburg: Algebraic and Automata-Theoretic Properties of Formal languages. North-Holland Publishing Company 1975Google Scholar
  6. [6]
    S. Ginsburg, E.H. Spanier: Control Sets on Grammars. Math.Sys.Th. 2(1968), pp.159–177CrossRefGoogle Scholar
  7. [7]
    J.E.Hopcroft, J.D.Ullman: Formal Languages and their Relation to Automata. Addison-Wesley 1969Google Scholar
  8. [8]
    T. Kasai: A Hierarchy between Contextfree and Contextsensitive Languages. JCSS 4(1970), pp.492–508Google Scholar
  9. [9]
    H.Maurer: Theoretische Grundlagen der Programmiersprachen. BI-Hochschultaschenbuch 404/404a, 1969Google Scholar
  10. [10]
    A.Salomaa: Formal Languages. Academic Press 1973Google Scholar
  11. [11]
    N. Wirth: The Programming Language PASCAL. Acta Inf. 1(1971), pp. 35–63CrossRefGoogle Scholar
  12. [12]
    G.Barth: Mastering Contextsensitivity in Programming Languages. To be presented at the MFCS'78 Conference in Zakopane, Poland, September 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Gerhard Barth
    • 1
  1. 1.Fachbereich InformatikUniversität KaiserslauternGermany

Personalised recommendations