Skip to main content
SpringerLink
Log in

Grammars with dynamic control sets

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

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

Included in the following conference series:

  • 139 Accesses

Abstract

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.

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.

6. References

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

    Google Scholar 

  2. G.Barth: Protokollgrammatiken-Ein Konzept zur zeitvarianten Kontrolle bei kontextfreien Ersetzungen. Doctorial Thesis, Universität Kaiserslautern 1977

    Google Scholar 

  3. G. Barth: Efficient Non-Contextfree Parsing. Proc. of 7th Annual GI-Conference, Informatik-Fachberichte No.10, Springer Berlin-Heidelberg-New York, pp.1–15

    Google Scholar 

  4. K. Culik, C.W. Morey: Formal Schemes for Language Translations. Int.J.Comp.Math. Section A, 3(1971), pp.17–48

    Google Scholar 

  5. S.Ginsburg: Algebraic and Automata-Theoretic Properties of Formal languages. North-Holland Publishing Company 1975

    Google Scholar 

  6. S. Ginsburg, E.H. Spanier: Control Sets on Grammars. Math.Sys.Th. 2(1968), pp.159–177

    Article  Google Scholar 

  7. J.E.Hopcroft, J.D.Ullman: Formal Languages and their Relation to Automata. Addison-Wesley 1969

    Google Scholar 

  8. T. Kasai: A Hierarchy between Contextfree and Contextsensitive Languages. JCSS 4(1970), pp.492–508

    Google Scholar 

  9. H.Maurer: Theoretische Grundlagen der Programmiersprachen. BI-Hochschultaschenbuch 404/404a, 1969

    Google Scholar 

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

    Google Scholar 

  11. N. Wirth: The Programming Language PASCAL. Acta Inf. 1(1971), pp. 35–63

    Article  Google Scholar 

  12. G.Barth: Mastering Contextsensitivity in Programming Languages. To be presented at the MFCS'78 Conference in Zakopane, Poland, September 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, Germany

    Gerhard Barth

Authors
  1. Gerhard Barth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barth, G. (1978). Grammars with dynamic control sets. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation