J. Rekers and A. Schurr. Dening and Parsing Visual Languages with layered Graph Grammars. Journal of Visual Languages and Computing, 8(1):27-55, 1997.  Home/Search   Document Not in Database   Summary   Related Articles

....on context free grammar rules, i.e. they allow replacement of a single nonterminal in the left hand side. Using these approaches it is not always possible to de ne the VL in mind. Therefore, context sensitive graph grammars have been proposed, e.g. in the form of Layered Graph Grammars (LGG) [11]. LGG rules are allowed to delete and create several elements and relations, represented as vertices and edges. Unfortunately, LGGs are still not convenient enough to de ne a VL in general because of at least missing Negative Application Conditions (NACs) and further conditions for rules. ....

....Grammars (RGGs) another restricted and modi ed form of LGGs [13] RGGs o er some kind of embedding mechanism, too, but do not support the de nition of predicates (however, not used in GenGEd) and NACs. Their rules have to be locally con uent, so that the polynomial naive LGG parsing algorithm in [11] works. Backtracking for handling recognized critical rule pairs is not supported. In Section 2 we brie y review the GenGEd environment for the visual speci cation of VLs. The parsing facilities and their usage in GenGEd are proposed in Section 3, and illustrated by a small example (a subset of ....

J. Rekers and A. Schurr. Dening and Parsing Visual Languages with layered Graph Grammars. Journal of Visual Languages and Computing, 8(1):27-55, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC