Context-free hypergraph grammars have the same term-generating power as attribute grammars
type: Item
instance of: scholarly article
title: Context-free hypergraph grammars have the same term-generating power as attribute grammars
zbMATH Open document ID: 0769.68072
DOI: 10.1007/BF01178504
author: Joost Engelfriet
author: Linda Heyker
published in: Acta Informatica
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 94725
zbMATH Keywords: attribute grammars
zbMATH Keywords: term languages
zbMATH Keywords: context-free hypergraph grammar
zbMATH Keywords: semantic domain
zbMATH Keywords: syntax-directed translation device
MaRDI profile type: Publication
cites work: Q5452362
cites work: Graph expressions and graph rewritings
cites work: Semantic evaluation from left to right
cites work: Q2736348
cites work: Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
cites work: Attribute grammars and recursive program schemes. I. II
cites work: Attribute grammars. Definitions, systems and bibliography
cites work: Relating logic programs and attribute grammars
cites work: IO-macrolanguages and attributed translations
cites work: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
cites work: The Complexity of Languages Generated by Attribute Grammars
cites work: The formal power of one-visit attribute grammars
cites work: The string generating power of context-free hypergraph grammars
cites work: Q4037317
cites work: Apex graph grammars and attribute grammars
cites work: A comparison of boundary graph grammars and context-free hypergraph grammars
cites work: Macro tree transducers
cites work: The translation power of top-down tree-to-graph transducers
cites work: Plex languages
cites work: Interpretation and reduction of attribute grammars
cites work: Q3925893
cites work: Q3048294
cites work: Q3774975
cites work: Q3785988
cites work: Semantics of context-free languages
cites work: Q3789084
cites work: Q3340111
cites work: Algebraic automata and context-free sets
cites work: Pair grammars, graph languages and string-to-graph translations
full work available at URL: https://doi.org/10.1007/bf01178504
OpenAlex ID: W2041988689
Recommended article: Q4236234
Recommended article: Q4037317
Recommended article: The string generating power of context-free hypergraph grammars
Recommended article: Q4376265
Recommended article: Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
Recommended article: Context-free hypergraph grammars with node rewriting
Recommended article: Q4037313
Recommended article: A comparison of boundary graph grammars and context-free hypergraph grammars
Recommended article: The generative power of context-free node rewriting in hypergraphs
Recommended article: Powerful and NP-complete: hypergraph Lambek grammars
description: scientific article; zbMATH DE number 94725