Properties of ordered graph grammars
A method for the ordering of graphs by means of an extension to the concept of graph grammars is given. These orderings, which are formed by ordered, spanning subtrees of graphs, may be reconstructed on need, for example to enable a LR-like syntactic analysis of graph-languages. In this paper, the properties of derivations and the ambiguity of such ordered graph grammars are discussed.
KeywordsGraph Production Graph Grammar Sentential Form Precedence Graph Graph Language
Unable to display preview. Download preview PDF.
- Fra-77.R. Franck: Precedence Graph Grammars. Theoretical Results and Documentation of an Implementation. Techn. Rep. 77-10 FB 20, TU Berlin 1977Google Scholar
- Nag-79.M. Nagl: Graph-Grammatiken. Theorie, Implementierung, Anwendungen. Verlag Vieweg, Braunschweig 1979Google Scholar
- V+G-78.P.D. Vigna, C. Ghezzi: Context-Free Graph Grammars. Information and Control 37, (1978), pp207–233.Google Scholar