Parsing of graphs in linear time
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.
Keywordsgraph grammar precedence parsing parse tree
Unable to display preview. Download preview PDF.
- [AhUl72]A.V.Aho/J.D.Ullman: The Theory of Parsing, Translation and Compiling, Prentice-Hall, 1972.Google Scholar
- [Ho82]C.M.Hoffmann: Group-theoretic Algorithms and Graph Isomrphism, Lecture Notes 136, Springer 1982.Google Scholar
- [Ka82]M.Kaul: Precedence Parsing of Graphs, Report 4/82, Seminar fur Informatik, EWH Koblenz, 1982.Google Scholar