Summary
Specializing an existing graph grammar model we look in detail at node context-free graph grammars. With a slight generalization the parse trees for context-free Chomsky grammars can be used to describe derivations of these graph grammars.
As shown already in former works the precedence graph grammars are defined as a subclass of context-free graph grammars by certain algebraic restrictions on the form of the rules. Then we can prove that every precedence grammar is unambiguous and additionally the reduction process in such a grammar read as replacement system is finite.
The most important aim in defining the predence relations was a simple parsing method. This is realized because it is shown that the syntactic analysis for precedence graph grammars can be done in a time which linearly depends on the size of the input graph.
The whole method has been implemented and a documentation is available.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bauer, F.L., Samelson, K.: Sequentielle Formelübersetzung. Elektronische Rechenanlagen 1, 289–304 (1959)
Denert, E.: PLAN2D — Konzept und Syntax einer zweidimensionalen Programmiersprache. Dissertation, Technische Universität Berlin, FB 20, 1975
Denert, E., Franck, R., Streng, W.: PLAN2D — Towards a two-dimensional programming language. Lecture Notes in Computer Science, Vol. 26, pp. 203–213. Berlin-Heidelberg-New York: Springer 1974
Ehrig, H., Kreowski, H.J.: Categorical approach to graphic systems and graph grammars. Lecture Notes in Economics and Mathematical Systems, Vol. 131, pp. 323–351. Berlin-Heidelberg-New York: Springer 1976
Ehrig, H., Pfender, M., Schneider, H.J.: Graph grammars: An algebraic approach. Proc. 14th Ann. IEEE Symp. on Switching and Automata Theory, pp. 167–180, Iowa City, 1973
Ehrig, H., Rosen, B.K.: The mathematics of record handling. Lecture Notes in Computer Science, Vol. 52, pp. 206–220. Berlin-Heidelberg-New York: Springer 1977
Ehrig, H., Rosen, B.K.: Rapid evaluation of recursively defined functions. Draft version, unpublished
Franck, R.: PLAN2D — Syntaxanalyse von Präzedenz-Graph-Grammatiken. Dissertation, Technische Universität Berlin, FB 20, 1975
Franck, R.: PLAN2D — Syntactic analysis of precedence graph grammars. Proc. 3rd ACM Symp. on Principles of Programming Languages, pp. 134–139, Atlanta, 1976
Franck, R.: Procedence graph grammars: Theoretical results and documentation of an implementation. Forschungsbericht FB 20, Nr. 10, Technische Universität Berlin, 1977
Farrow, R., Kennedy, K., Zucconi, L.: Graph grammars and global data flow analysis. Proc. 17th Ann. IEEE Conf. on Foundations of Computer Science, Houston, 1976
Nagel, M.: Formale Sprachen von Markierten Graphen. Dissertation, Universität Erlangen-Nürnberg, 1974
Nagel, M.: Graph rewriting systems and their application in biology. Lecture Notes in Biomathematics, Vol. 11, pp. 135–156. Berlin-Heidelberg-New York: Springer 1976
Pratt, T.W.: Pair grammars, graph languages and string-to-graph translations. J. Comp. System Sci. 7, 560–595 (1971)
Rosen, B.K.: Deriving graphs from graphs by applying a production. Acta Informat. 4, 160–187 (1973)
Rutishauser, H.: Automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen. Mitteilungen aus dem Institut für Angewandte Mathematik der ETH Zürich, August 1970
Schneider, H.J.: Conceptual data base description using graph grammars. Proc. Workshop Graphenteoretische Konzepte in der Informatik, Göttingen, 1976
Schneider, H.J., Ehrig, H.: Grammars on partial graphs. Acta Informat. 6, 297–316 (1976)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Franck, R. A class of linearly parsable graph grammars. Acta Informatica 10, 175–201 (1978). https://doi.org/10.1007/BF00289155
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289155