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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
[AhoSetUll] Aho, A.V., Sethi, R., Ullman, J.D.: Compilers; Principles, techniques, and tools. Reading, MA: Addison-Wesley 1986
[AhoUll] Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Englewood Cliffs, NJ: Prentice-Hall 1972
[BauCou] Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Math. Syst. Theory20, 83–127 (1987)
[Bar Bartha, M.: An algebraic definition of attributed transformations. In: Gécseg, F. (ed.) Fundamentals of computation theory. (Lect. Notes Comput. Sci., vol. 117, pp. 51–60) Berlin, Heidelberg, New York: Springer 1981
[Boc] Bochmann, G.V.: Semantic evaluation from left to right. Commun. ACM19, 55–62 (1976)
[ChiMar Chirica, L.M., Martin, D.F.: An order-algebraic definition of Knuthian semantics. Math. Syst. Theory.13, 1–27 (1979)
[CorRos] Corradini, A., Rossi, F.: On the power of context-free jungle rewriting for term rewriting systems and logic programming, University of Pisa, Italy, June 1990
[CorRosPar Corradini, A., Rossi, F., Parisi-Presicce, F.: Logic programming as hypergraph rewriting. In: Proceedings CAAP '91. (Lect. Notes Comput. Sci., vol. 493, pp. 275–295) Berlin, Heidelberg, New York: Springer 1991
[Cou 1] Courcelle, B.: Equivalences and transformations of regular systems, applications to recursive program schemes and grammars. Theor. Comput. Sci.42, 1–122 (1986)
[Cou2] Courcelle, B.: An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theor. Comput. Sci.55, 141–181 (1987)
[Cou3] Courcelle, B.: On using context-free graph grammars for analyzing recursive definitions. In: Fuchi, K., Kott, L. (eds.) Programming of future generation computers II, pp. 83–122. Amsterdam: Elsevier 1988
[Cou4] Courcelle, B.: The monadic second-order logic of graphs, I: recognizable sets of finite graphs. Inf. Comput.85, 12–75 (1990)
[Couder] Courcelle, B., Deransart, P.: Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming. Inf. Comput.78, 1–55 (1988)
[CouFra] Courcelle, B., Franchi-Zannettacci, P.: Attribute grammars and recursive program schemes I and II. Theor. Comput. Sci.17, 163-191, 235–257 (1982)
[DerJouLor] Deransart, P., Jourdan, M., Lorho, B.: Attribute grammars; definitions, systems and bibliography. (Lect. Notes Comput. Sci., vol. 323) Berlin, Heidelberg, New York: Springer 1988
[DerMal] Deransart, P., Maluszynski, J.: Relating logic programs and attribute grammars. J. Logic Program.2, 119–155 (1985)
[DusParSedSpe] Duske, J., Parchmann, R., Sedello, M., Specht, J.: IO-macrolanguages and attributed translations. Inf. Control35, 87–105 (1977)
[EhrNagRosRoz] Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Graph-grammars and their application to computer science. (Lect. Notes Comput. Sci., vol. 291) Berlin, Heidelberg, New York: Springer 1987
[Eng1] Engelfriet, J.: Some open questions and recent results on tree transducers and tree languages. In: Book, R.V. (ed.). Formal language theory: perspectives and open problems, pp. 241–286. New York: Academic Press 1980
[Eng2] Engelfriet, J.: Tree transducers and syntax-directed semantics. TW Memorandum 363, Twente University of Technology, 1981, presented at the 7th CAAP, March 1982, Lille
[Eng3] Engelfriet, J.: The complexity of languages generated by attribute grammars. SIAM J. Comput.15, 70–86 (1986)
[EngFil] Engelfriet, J., Filé, G.: The formal power of one visit attribute grammars. Acta Inf.16, 275–302 (1981)
[EngHey1] Engelfriet, J., Heyker, L. M.: The string generating power of context-free hypergraph grammars. J. Comput. Syst. Sci.43, 328–360 (1991)
[EngHey2] Engelfriet, J., Heyker, L.M.: The term generating power of context-free hypergraph grammars. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graphgrammars and their application to computer science. (Lect. Notes Comput. Sci., vol. 532) Berlin, Heidelberg, New York: Springer 1991, pp. 328–343
[EngLeiRoz] Engelfriet, J., Leih, G., Rozenberg, G.: Apex graph grammars and attribute grammars. Acta Inf.25, 537–571 (1988)
[EngRoz] Engelfriet, J., Rozenberg, G.: A comparison of boundary graph grammars and context-free hypergraph grammars. Inf. Comput.84, 163–206 (1990)
[EngVog1] Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci.31, 71–146 (1985)
[EngVog2] Engelfriet, J., Vogler, H.: The translation power of top-down tree-to-graph transducers. in preparation
[Fed] Feder, J.: Plex languages. Inf. Sci.3, 225–241 (1971)
[Fil] Filè, G.: Interpretation and reduction of attribute grammars. Acta Inf.19, 115–150 (1983)
[Fül] Fülöp, Z.: On attributed tree transducers. Acta Cybern.5, 261–279 (1981)
[Gan] Ganzinger, H.: On storage optimization for automatically generated compilers. In: Weibrauch, K. (ed.) Theoretical computer science, 4th GI Conference. (Lect. Notes Comput. Sci., vol. 67, pp. 132–141) Berlin, Heidelberg, New York: Springer 1979
[Göt] Göttler, H.: Graph-grammars and diagram editing. In [EhrNagRozRoz], pp. 216–231
[Hab] Habel, A.: Hyperedge replacement: grammars and languages. Ph.D. Thesis, Bremen, 1989
[HabKre1] Habel A., Kreowski, H.-J.: Some structral aspects of hypergraph languages generated by hyperedge replacement. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS'87. Proceedings. (Lect. Notes Comput. Sci., vol. 247, pp. 207–219) Berlin, Heidelberg, New York: Springer 1987
[HabKre2] Habel, A., Kreowski, H.-J.: May we introduce to you: hyperedge replacement. In [EhrNagRosRoz], pp. 15–26
[HabKrePlu] Habel, A., Kreowski, H.-J., Plump, D.: Jungle evaluation. In: Sanella, D., Tarlecki, A. (eds.) Recent trends in data type specification. (Lect. Notes Comput. Sci., vol. 332, pp. 92–112) Berlin, Heidelberg, New York: Springer 1987
[Hof] Hoffmann, B.: Modelling compiler generation by graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds.) Graph-grammars and their application to computer science. (Lect. Notes Comput. Sci., vol. 153, pp. 159–171) Berlin, Heidelberg, New York: Springer 1983
[HofPlu] Hoffmann, B., Plump, D.: Jungle evaluation for efficient term rewriting. In: Grabowski, J., Lescanne, P., Wechler, W. (eds.) Algebraic and logic programming. (Lect. Notes Comput. Sci., vol. 343, pp. 191–203) Berlin, Heidelberg, New York: Springer 1988
[HofSch] Hoffmann, B., Schmiedecke, I.-R.: Multi-pass parsing for two-level grammars. In: Dembinski, P. (ed.) Mathematical Foundations of Computer Science 1980. (Lect. Notes Comput. Sci., vol. 88, pp. 275–290) Berlin, Heidelberg, New York: Springer 1980
[Knu] Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory2, 127–145 (1968). Correction: Math. Syst. Theory5, 95–96 (1971)
[Kre] Kreowski, H.-J.: Rule trees represent derivations in edge replacement systems. In: Rozenberg, G., Salomaa, A. (eds.) The Book ofL, pp. 217–232, Berlin, Heidelberg, New York: Springer 1986
[Lau] Lautemann, C.: Decomposition trees: structured graph representation and efficient algorithms. In: Dauchet, M., Nivat, M. (eds.) CAAP '88 Proceedings. (Lect. Notes Comput. Sci., vol. 299, pp. 28–39) Berlin, Heidelberg, New York: Springer 1988
[LenWan] Lengauer, T., Wanke, E.: Effcient analysis of graph properties on context-free graph languages (extended abstract). In: Lepistö, T., Salomaa, A. (eds.) Automata languages and programming. ICALP '88 Proceedings. (Lect. Notes Comput. Sci., vol. 317, pp. 379–393) Berlin, Heidelberg, New York: Springer 1988
[Lor] Lorho, B. (ed.): Methods and tools for compiler construction. New York: Cambridge University Press 1984
[Mad] Madsen, O.L. on defining semantics by means of extended attribute grammars. In: Jones, N.D. (ed.) Semantics-directed compiler generation. (Lect. Notes Comput. Sci., vol. 94, pp. 259–299) Berlin, Heidelberg, New York: Springer 1980
[MezWri] Mezei, J., Wright, J.B.: Algebraic automata and context-free sets. Inf. Control11, 3–29 (1967)
[MonRos] Montanari, U., Rossi, F.: An efficient algorithm for the solution of hierarchical networks of constraints. In: [EhrNagRosRoz], pp. 440–457
[Pra] Pratt, T.W.: Pair grammars, graph languages and string-to-graph translations. J. Comput. Syst. Sci.5, 560–595 (1971)
[Rao] Raoult, J.-C.: Algebraic sets of tree-vectors and rational tree-transductions. Publication Nr. 502, IRISA, Rennes, France, 1989
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Engelfriet, J., Heyker, L. Context-free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica 29, 161–210 (1992). https://doi.org/10.1007/BF01178504
Issue Date:
DOI: https://doi.org/10.1007/BF01178504