| Pre-proceedings of the Fifth Intl. Workshop on Graph Grammars and Their Application to Computer Science, Williamsburg, VA, Nov. 1994. Full versions of selected papers appear in this volume. |
....Consequently, most graph grammar parsing algorithms proposed so far are either unable to recognize interesting languages of graphs or tend to be inefficient when applied to graphs with a large number of nodes and edges. Another problem is that nearly all known graph grammar parsing algorithms [7][8][17] deal only with context free productions. A context free grammar requires that only a single non terminal is allowed on the left hand side of a production [19] A context sensitive graph grammar, on the other hand, allows left hand and right hand graphs of a production to have arbitrary number ....
M. Kaul, Parsing of graphs in linear time, Proc. 2nd Int. Workshop on Graph Grammars and Their Application to Computer Science, LNCS 153, 1982, 206-218.
No context found.
Pre-proceedings of the Fifth Intl. Workshop on Graph Grammars and Their Application to Computer Science, Williamsburg, VA, Nov. 1994. Full versions of selected papers appear in this volume.
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