| E.J. Golin, Amethod for the specification and parsing of visual languages, PhD Thesis, Brown University, May 1991. |
....all graph grammar parsing algorithms presented so far are either unable to recognize interesting languages of graphs or tend to be hopelessly inefficient when applied to graphs with a large number of nodes and edges. Another problem is that nearly all known graph grammar parsing algorithms [2,3,4,5,6,7] deal only with context free 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 ....
E.J. Golin, Amethod for the specification and parsing of visual languages, PhD Thesis, Brown University, May 1991.
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