The term generating power of context-free hypergraph grammars

  • Joost Engelfriet
  • Linda Heyker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 532)


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.


graph grammar hypergraph term attribute grammar syntax-directed translation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AhoUll]
    A.V. Aho, J.D. Ullman; "The Theory of Parsing, Translation, and Compiling", Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1972.Google Scholar
  2. [BauCou]
    M. Bauderon, B. Courcelle; Graph expressions and graph rewritings, Mathematical Systems Theory 20 (1987), 83–127.CrossRefGoogle Scholar
  3. [Coul]
    B. Courcelle; Equivalences and transformations of regular systems, applications to recursive program schemes and grammars, Theoretical Computer Science 42 (1986), 1–122.CrossRefGoogle Scholar
  4. [Cou2]
    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. [Cou3]
    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.CrossRefGoogle Scholar
  6. [CouFra]
    B. Courcelle, P. Franchi-Zannettacci; Attribute grammars and recursive program schemes I and II, Theoretical Computer Science 17 (1982), 163–191, 235–257.CrossRefGoogle Scholar
  7. [DerJouLor]
    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. [DusParSedSpe]
    J. Duske, R. Parchmann, M. Sedello, J. Specht; 10-macrolanguages and attributed translations, Information and Control 35 (1977), 87–105.CrossRefGoogle Scholar
  9. [EhrNagRosRoz]
    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. [EngFil]
    J. Engelfriet, G. Filè; The formal power of one-visit attribute grammars, Acta Informatica 16 (1981), 275–302.CrossRefGoogle Scholar
  11. [EngHey1]
    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. [EngHey2]
    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. [EngLeiRoz]
    J. Engelfriet, G. Leih, G. Rozenberg; Apex graph grammars and attribute grammars, Acta Informatica 25 (1988), 537–571.Google Scholar
  14. [EngVog]
    J. Engelfriet, H. Vogler; Macro tree transducers, Journal of Computer and System Sciences 31 (1985), 71–146.CrossRefGoogle Scholar
  15. [Fil]
    G. Filè; Interpretation and reduction of attribute grammars, Acta Informatica 19 (1983), 115–150.CrossRefGoogle Scholar
  16. [Hab]
    A.Habel; Hyperedge replacement: grammars and languages, Ph.D.Thesis, Bremen, 1989.Google Scholar
  17. [HabKre]
    A. Habel, H.-J. Kreowski; May we introduce to you: hyperedge replacement, in 15–26.Google Scholar
  18. [HabKrePlu]
    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. [Hof]
    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. [Knu]
    D.E. Knuth; Semantics of context-free languages, Mathematical Systems Theory 2 (1968), 127–145. Correction: Mathematical Systems Theory 5 (1971), 95–96.CrossRefGoogle Scholar
  21. [Lau]
    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. [Mad]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Joost Engelfriet
    • 1
  • Linda Heyker
    • 1
  1. 1.Dept. of Computer ScienceLeiden UniversityLeidenThe Netherlands

Personalised recommendations