Theory of data structures by relational and graph grammars

  • Václav Rajlich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 52)


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.


Entry Point Relational Structure Graph Grammar Accessible Part Rooted Edge 
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.


  1. 1.
    Jay Early: Towards an understanding of data structures, Comm. ACM, vol. 14, 1971, 617–626.Google Scholar
  2. 2.
    A.C. Fleck: Towards a theory of data structures, J. Computer and System Sci, 5, 1971, 475–488.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    Terrence W. Pratt: Pair grammars, graph languages and string-tograph translations, J. Computer and System Sci, vol.5, December 1971, 560–595.Google Scholar
  7. 7.
    A. Rosenfeld and D.C. Milgram: Web automata and web grammars, Machine Intelligence vol. 7, 1972, University of Edinburgh Press, 307–324.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Václav Rajlich: Dynamics of discrete systems and pattern reproduction, J. Computer and System Sci., 11/1975, 186–202.Google Scholar
  10. 10.
    H. Ehrig, M. Pferder, H.J. Schneider: Graph grammars: an algebraic approach, Switching and automata theory conference 1973.Google Scholar
  11. 11.
    Z. Manna: Mathematical Theory of Computation, Mc Graw Hill, 1974.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    D. Knuth: The art of computer programming Vol. 1, Addison-Wesley Publ., Reading, Mass. 1969.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    A.C. Rosenberg: Data graphs and adressing schemes, J. Computer and System Sci., June 1971, 193–238.Google Scholar
  16. 16.
    K. Čulík: Algorithmization of algebras and relational structures, Comentationes Mathematical Universitatis Carolinae, 13,3 (1972), 457–477.Google Scholar
  17. 17.
    Václav Rajlich: Theory of computing machines, to be published by SNTL, Prague, in Czech.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Václav Rajlich
    • 1
  1. 1.Research Institute for Mathematical MachinesPrague 1Czechoslovakia

Personalised recommendations