Skip to main content

Two-level graph grammars

  • List Of Contributions
  • Conference paper
  • First Online:
Graph-Grammars and Their Application to Computer Science and Biology (Graph Grammars 1978)

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

Abstract

Two-level graph grammars (2GG) combine the concepts of (one-level) graph grammars — as defined by PRATT — and of two-level (string) grammars — as introduced by v. WIJNGAARDEN for the formal definition of ALGOL 68. 2GG's settle both the inadequacies of one-level graph grammars and of two-level string grammars, the former resulting from the lack of parameters, the latter from the general lack of structure of string manipulation systems. As a field of application of 2GG's, the formal description of programming languages is focussed.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van WIJNGAARDEN, A. (Ed.), MAILLOUX, B. J., PECK, J.E.L., KOSTER, C.H.A.: Report on the algorithmic language ALGOL 68, Num. Math. 14, 79–218 (1969)

    Google Scholar 

  2. van WIJNGAARDEN, A. (Ed.) et al.: Revised report on the algorithmic language ALGOL 68, Acta Informatica 5 (1–3), 1–236 (1975)

    Google Scholar 

  3. DEHOTTAY, J.P., KOSTER, C.H.A., STAHL, H.M.: Syntaktische Beschreibung von CDL2, Arbeitspapier, TU Berlin (1975)

    Google Scholar 

  4. CLEAVELAND, J.C., UZGALIS, R.C.: Grammars for programming languages: What every programmer should know about grammar, Lecture notes UCLA (1975)

    Google Scholar 

  5. HESSE, W.: Vollständige formale Beschreibung von Programmiersprachen mit zweischichtigen Grammatiken, Dissertation, Inst. für Informatik, Technische Universität München, Bericht Nr. 7623 (1976)

    Google Scholar 

  6. HESSE, W.: A correspondence between W-grammars and formal systems of logic and its application to complete formal language descriptions, TUM-INFO-7727, Technische Universität München (1977)

    Google Scholar 

  7. HESSE, W.: Formal semantics of programming languages described by predicative W-grammars, TUM-INFO-7728, Technische Universität München (1977)

    Google Scholar 

  8. HESSE, W.: Two-level graph grammars, TUM-INFO-7833, Technische Universität München (1978)

    Google Scholar 

  9. LAUT, A.: Zur Implementierung zweischichtiger Graphen-Grammatiken, Diplomarbeit, Inst. für Informatik, Technische Universität München (1977)

    Google Scholar 

  10. PRATT, T.W.: A hierarchical graph model of the semantics of programs, Proc. AFIPS Spring Joint Comp. Conf. 34, 813–825 (1969)

    Google Scholar 

  11. PRATT, T.W.: Pair grammars, graph languages and string-to-graph translations, J. of Comp. Sysm. Sci. 5, 560–595 (1971)

    Google Scholar 

  12. PRATT, T.W.: A formal definition of ALGOL 60 using hierarchical graphs and pair grammars, Report TSN-33, Univ. of Texas Comp. Center, Austin (1973)

    Google Scholar 

  13. SINTZOFF, M.: Existence of a van Wijngaarden syntax for every recursively enumerable set, Ann. Soc. Scientifique de Bruxelles 81, 115–118 (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Volker Claus Hartmut Ehrig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hesse, W. (1979). Two-level graph grammars. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025725

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09525-5

  • Online ISBN: 978-3-540-35091-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics