Skip to main content
SpringerLink
Log in

The term generating power of context-free hypergraph grammars

  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1990)

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

Abstract

Context-free hypergraph grammars and attribute grammars generate the same class of term languages. Extending the context-free hypergraph grammar with a context-free grammar and a semantic domain, a syntax-directed translation device is obtained that is equivalent to the attribute grammar.

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.

References

  1. A.V. Aho, J.D. Ullman; "The Theory of Parsing, Translation, and Compiling", Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1972.

    Google Scholar 

  2. M. Bauderon, B. Courcelle; Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987), 83–127.

    Article  Google Scholar 

  3. B. Courcelle; Equivalences and transformations of regular systems, applications to recursive program schemes and grammars, Theoretical Computer Science 42 (1986), 1–122.

    Article  Google Scholar 

  4. B.Courcelle; On using context-free graph grammars for analyzing recursive definitions, in "Programming of future generation computers, II" (K.Fuchi, L.Kott, eds.), Elsevier Pub.Co., 1988, 83–122.

    Google Scholar 

  5. B. Courcelle; The monadic second-order logic of graphs, I: recognizable sets of finite graphs, Information and Computation 85 (1990), 12–75. See also [EhrNagRosRoz], 133–146.

    Article  Google Scholar 

  6. B. Courcelle, P. Franchi-Zannettacci; Attribute grammars and recursive program schemes I and II, Theoretical Computer Science 17 (1982), 163–191, 235–257.

    Article  Google Scholar 

  7. P. Deransart, M. Jourdan, B. Lorho, "Attribute grammars; Definitions, Systems and Bibliography", Lecture Notes in Computer Science 323, Springer-Verlag, Berlin, 1988.

    Google Scholar 

  8. J. Duske, R. Parchmann, M. Sedello, J. Specht; 10-macrolanguages and attributed translations, Information and Control 35 (1977), 87–105.

    Article  Google Scholar 

  9. H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.); "Graph-Grammars and their Application to Computer Science", Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987.

    Google Scholar 

  10. J. Engelfriet, G. Filè; The formal power of one-visit attribute grammars, Acta Informatica 16 (1981), 275–302.

    Article  Google Scholar 

  11. J.Engelfriet, L.M.Heyker; The string generating power of context-free hypergraph grammars, Report 89-05, Leiden University, 1989, to appear in Journal of Computer and System Sciences.

    Google Scholar 

  12. J.Engelfriet, L.M.Heyker; The term-generating power of context-free hypergraph grammars and attribute grammars, Report 89-17, Leiden University, 1989.

    Google Scholar 

  13. J. Engelfriet, G. Leih, G. Rozenberg; Apex graph grammars and attribute grammars, Acta Informatica 25 (1988), 537–571.

    Google Scholar 

  14. J. Engelfriet, H. Vogler; Macro tree transducers, Journal of Computer and System Sciences 31 (1985), 71–146.

    Article  Google Scholar 

  15. G. Filè; Interpretation and reduction of attribute grammars, Acta Informatica 19 (1983), 115–150.

    Article  Google Scholar 

  16. A.Habel; Hyperedge replacement: grammars and languages, Ph.D.Thesis, Bremen, 1989.

    Google Scholar 

  17. A. Habel, H.-J. Kreowski; May we introduce to you: hyperedge replacement, in 15–26.

    Google Scholar 

  18. A. Habel, H.-J. Kreowski, D. Plump; Jungle evaluation, in: "Recent Trends in Data Type Specification" (D. Sanella, A. Tarlecki, eds.), Lecture Notes in Computer Science 332, Springer-Verlag, Berlin, 1987, 92–112.

    Google Scholar 

  19. B. Hoffman; Modelling compiler generation by graph grammars, in: "Graph-Grammars and their Application to Computer Science" (H. Ehrig, M. Nagl, G. Rozenberg, eds.), Lecture Notes in Computer Science 153, Springer-Verlag, Berlin, 1983, 159–171.

    Google Scholar 

  20. D.E. Knuth; Semantics of context-free languages, Mathematical Systems Theory 2 (1968), 127–145. Correction: Mathematical Systems Theory 5 (1971), 95–96.

    Article  Google Scholar 

  21. C. Lautemann; Decomposition trees: structured graph representation and efficient algorithms, in: CAAP '88 Proceedings (M. Dauchet, M. Nivat, eds.), Lecture Notes in Computer Science 299, Springer-Verlag, Berlin, 1988, 28–39.

    Google Scholar 

  22. O.L. Madsen, On defining semantics by means of extended attribute grammars, in: "Semantics-directed compiler generation" (N.D. Jones, ed.), Lecture Notes in Computer Science 94, Springer-Verlag, Berlin, 1980, 259–299.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Leiden University, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Joost Engelfriet & Linda Heyker

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linda Heyker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Engelfriet, J., Heyker, L. (1991). The term generating power of context-free hypergraph grammars. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017398

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation