Apex graph grammars and attribute grammars |
| |
Authors: | Joost Engelfriet George Leih Grzegorz Rozenberg |
| |
Affiliation: | (1) Department of Computer Science, Leiden University, P.O. Box 9512, NL-2300 RA Leiden, The Netherlands |
| |
Abstract: | Summary Apex graph grammars are a particular type of directed node-label controlled (DNLC) graph grammars: the embedding edges are established between terminal nodes only. Apex graph grammars, slightly generalized, can generate the sets of dependency graphs of attribute grammars. The other way around, every apex graph language can be obtained from such a dependency graph language by a graph replacement (which is an operation analogous to a string homomorphism). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|