Abstract

The parsing problem for graphs is to transform a given input graph into a parse tree, which represents the layered hierarchical decomposition of the input graph into subgraphs according to the productions of a given graph grammar. This paper discusses conditions of parsing in linear time using the well-known Wirth/Weber precedence approach. A special graph grammar class satisfying these conditions as well as an appropriate linear time precedence parser is presented.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call