J.Rekers, andA.Schurr,DefinitingandParsingVisualLanguages with Layered Graph Grammars, Technical Report 96--09, Leiden University, 1996.  Home/Search   Document Not in Database   Summary   Related Articles

....productions. This makes them difficult to specify a large portion of VPLs. A context sensitive graph grammar, on the other hand, allows left and right side graphs of a production to have arbitrary number of nodes and edges, like a layered graph grammar proposed by J. Rekers and A. Schurr [8], which can be used to specify the syntax of a wide range of diagrammatic VPLs. Although being expressive, the layered graph grammar is rather inefficient in its implementation. Its parsing algorithm is complicated and the complexity generally reaches exponential time. It is reported that parsing ....

....uses a powerful formalism to support the linking of newly created graphs into a parsed graph (traditionally called embedding) RGG is complete and explicit in describing the syntax of a wide range of diagrams using labelled graphs. Compared to the layered graph grammar where the context graph [8] must explicitly appear in the production, the embedding mechanism in the reserved graph grammar allows the grammar representation to avoid most of the context specifications while being more expressive. This greatly reduces the expression complexity, and in turn increases the efficiency of the ....

[Article contains additional citation context not shown here]

J.Rekers, andA.Schurr,DefinitingandParsingVisualLanguages with Layered Graph Grammars, Technical Report 96--09, Leiden University, 1996.

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