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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V.Aho/J.D.Ullman: The Theory of Parsing, Translation and Compiling, Prentice-Hall, 1972.
C.M.Hoffmann: Group-theoretic Algorithms and Graph Isomrphism, Lecture Notes 136, Springer 1982.
M.Kaul: Precedence Parsing of Graphs, Report 4/82, Seminar fur Informatik, EWH Koblenz, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaul, M. (1983). Parsing of graphs in linear time. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000108
Download citation
DOI: https://doi.org/10.1007/BFb0000108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive