Abstract
In the paper, a definition for relational and graph grammars is given. Data structures and expressions are defined as a special kind of relational structure and tree, respectively. Examples illustrate the unifying power of the definitions. Four data manipulating commands are defined : assignment, conditional command, node creation, and edge creation. A method for proof of data structure algorithms is given; the method is based on Floyd's method.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Jay Early: Towards an understanding of data structures, Comm. ACM, vol. 14, 1971, 617–626.
A.C. Fleck: Towards a theory of data structures, J. Computer and System Sci, 5, 1971, 475–488.
A.L. Furtado: Characterizing sets of data structures by graph grammars, Proc. of conference on computer graphic, pattern recognition and data structure, May 14–16, 1975, Univers. of California, Los Angeles, IEEE Catalog Number 75 CH 0981-1C, 103–107.
Václav Rajlich: Relational definition of computer languages, in J. Bečvář edited, Mathematical Foundations of Computer Science 1975, September 1–5, 1975, Mariánské Lázně, Czechoslovakia, Lecture Notes in Computer Science vol. 32, Springer Verlag, Berlin, 1975, 362–376.
Hans Jürgen Schneider: Syntax-directed description of incremental compilers, in D. Siefkes edited, GI-4, Jahrestagung, Berlin, 9–12. October 1974, Lecture notes in computer science, vol. 26, Springer Verlag, Berlin, 1975, 192–201.
Terrence W. Pratt: Pair grammars, graph languages and string-tograph translations, J. Computer and System Sci, vol.5, December 1971, 560–595.
A. Rosenfeld and D.C. Milgram: Web automata and web grammars, Machine Intelligence vol. 7, 1972, University of Edinburgh Press, 307–324.
Václav Rajlich: Relational structures and dynamics of certain discrete systems, in Proc. Symposium on Mathematical Foundations of Computer Science, High Tatras, Sept. 3–8, 1973, available from Computing Research Centre, Bratislava, Czechoslovakia, 285–292.
Václav Rajlich: Dynamics of discrete systems and pattern reproduction, J. Computer and System Sci., 11/1975, 186–202.
H. Ehrig, M. Pferder, H.J. Schneider: Graph grammars: an algebraic approach, Switching and automata theory conference 1973.
Z. Manna: Mathematical Theory of Computation, Mc Graw Hill, 1974.
W.J. Meyers: Linear representation of tree structure, Third annual ACM symposium on theory of computing, Shaker Heights, Ohio, May 3–5, 1971, 50–62.
D. Knuth: The art of computer programming Vol. 1, Addison-Wesley Publ., Reading, Mass. 1969.
S.A. Cook, D.C. Oppen: An assertion language for data structures, Conf. rec. of the 2. ACM symposium on principles of programming languages, Palo Alto, Calif., Jan.20–22, 1975, 160–166.
A.C. Rosenberg: Data graphs and adressing schemes, J. Computer and System Sci., June 1971, 193–238.
K. ÄŚulĂk: Algorithmization of algebras and relational structures, Comentationes Mathematical Universitatis Carolinae, 13,3 (1972), 457–477.
Václav Rajlich: Theory of computing machines, to be published by SNTL, Prague, in Czech.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajlich, V. (1977). Theory of data structures by relational and graph grammars. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_31
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive