Attributed Context-Free Hypergraph Grammars

The concept of context-free hypergraph grammars (cfhg grammars) has been studied extensively over the past decade. In this paper we introduce attributed context-free hypergraph grammars (acfhg grammars) as an extension of cfhg grammars. An acfhg grammar consists of an underlying context-free hypergraph grammar G 0 and an attribution which associates attributes with the nonterminal symbols of G 0 analogous to the classical attribute grammars (ag's) by Knuth. We show that acfhg grammars and ag's are closely related in such a way that an ag can be used to compute the attribute values of an acfhg grammar. Due to this relationship the known techniques for attribute evaluation for ag's can be exploited for acfhg grammars. Several known concepts such as compatible functions and attributed tree grammars can be embedded into the concept of acfhg grammars, provided an appropriate semantics is associated with the acfhg grammar. Finally, we show how an acfhg grammar can be used to associate semantics with programs of some programming language P in such a way that non-context-free constraints of P are already checked in the syntactical phase, i.e., by the underlying cfhg grammar.

[1]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1993, Theor. Comput. Sci..

[2]  Annegret Habel,et al.  A Comparison of Compatible, Finite, and Inductive Graph Properties , 1993, Theor. Comput. Sci..

[3]  Annegret Habel,et al.  Jungle evaluation , 1988, Fundam. Informaticae.

[4]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[5]  Hartmut Ehrig,et al.  Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

[6]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

[7]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[8]  Simon M. Kaplan,et al.  Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars , 1989, TAPSOFT, Vol.1.

[9]  Pierre Deransart,et al.  Attribute grammars and their applications : international conference WAGA, Paris, France, September 19-21, 1990 : proceedings , 1990 .

[10]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[11]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[12]  Joost Engelfriet,et al.  Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[13]  Andy Schürr,et al.  Programmed Graph Replacement Systems , 1997, Handbook of Graph Grammars.

[14]  Joost Engelfriet,et al.  A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars , 1990, Inf. Comput..

[15]  Anatoliy O. Buda,et al.  Generalized1.5 Sequential Machine Maps , 1979, Inf. Process. Lett..

[16]  Bruno Courcelle,et al.  An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[17]  Bruno Courcelle,et al.  A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars , 1995, Math. Syst. Theory.

[18]  B Lorho Methods and tools for compiler construction , 1984 .

[19]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[20]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

[21]  Joost Engelfriet,et al.  The Translation Power of Top-Down Tree-to-Graph Transducers , 1994, J. Comput. Syst. Sci..

[22]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[23]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[24]  Joost Engelfriet,et al.  SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES , 1980 .

[25]  Thomas Lengauer,et al.  Efficient decision procedures for graph properties on context-free graph languages , 1993, JACM.

[26]  Kablan Barbar Attributed Tree Grammars , 1993, Theor. Comput. Sci..

[27]  Alfred V. Aho,et al.  Translations on a context free grammar , 1969, STOC.

[28]  Joost Engelfriet,et al.  The String Generating Power of Context-Free Hypergraph Grammars , 1991, J. Comput. Syst. Sci..

[29]  Carlo Ghezzi,et al.  Context-Free Graph Grammars , 1978, Inf. Control..

[30]  Simon M. Kaplan,et al.  Supporting the Software Development Process with Attributed NLC Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[31]  Bruno Courcelle,et al.  Monadic Second-Order Definable Graph Transductions: A Survey , 1994, Theor. Comput. Sci..

[32]  Jean-Claude Raoult Rational tree relations , 1997 .

[33]  Herbert Göttler,et al.  Attributed graph grammars for graphics , 1982, Graph-Grammars and Their Application to Computer Science.

[34]  Annegret Habel,et al.  On context-free gragh languages generated by edge replacement , 1982, Graph-Grammars and Their Application to Computer Science.

[35]  Zoltán Fülöp On attributed tree transducers , 1981, Acta Cybern..