Data structures and graph grammars

  • P. L. Della Vigna
  • C. Ghezzi
Concepts And Techniques Of Data Base Management
Part of the Lecture Notes in Computer Science book series (LNCS, volume 44)


This paper is concerned with a formal model for data structure definition: data graph grammars (DGG's).

The model is claimed to give a rigorous documentation of data structures and to suit very properly program design via stepwise refinement.

Moreover it is possible to verify data structure correctness, with regard to their formal definition.

Last, attribute context-free data graph grammars (A-CF-DGG's) are intro duced. A-CF-DGG's not only give a complete and clean description of da ta structures and algorithms running along data structures, but also can support an automatic synthesis of such algorithms.

Key Words and Phrases

Data structure abstraction stepwise refinement software reliability correctness program synthesis context-free grammars attribute grammars parsing 


  1. /1/.
    Liskov, B. "An introduction to CLU", Computation Structures Group Memo 136, MIT Project MAC, 1976.Google Scholar
  2. /2/.
    Dahl, O.J., Dijkstra, E.W., Hoare C.A.R. "Structured programming" Academic Press New York, 1972.Google Scholar
  3. /3/.
    Parnas, D.L. "On the criterion used in decomposing systems into modules", CACM 15, 12, 1053–58, 1972.Google Scholar
  4. /4/.
    Earley, J. "Toward an understanding of data structures", CACM 14, 617–626, 1971.Google Scholar
  5. /5/.
    Shneiderman, B., Scheuermann, P. "Structured data structures", CACM 17, 10, 583–587, 1974.Google Scholar
  6. /6/.
    Rosengerg, A.L. "Addressable data graphs", JACM 19, 2, 309–340, 1972.CrossRefGoogle Scholar
  7. /7/.
    Pfaltz, J.L., Rosenfeld, A., —"Web grammars" Proc. 1st Intl. Joint Conference on Artificial Intelligence, Washington, 609–19, 1969.Google Scholar
  8. /8/.
    Montanari, U.C. "Separable graphs, planar graphs and web grammars", Information and Control, 16, 243–67, 1970.CrossRefGoogle Scholar
  9. /9/.
    Pavlidis, T. "Linear and context-free graph grammars", JACM 19, 11–22, 1972.CrossRefGoogle Scholar
  10. /10/.
    Milgram D.I. "Web automata", University of Maryland, Computer Science Center Technical rep. 271, 1973.Google Scholar
  11. /11/.
    Della Vigna, P., Ghezzi, C. "Context-free graph grammars", Internal rep. 76-1, Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, IEEPM, 1976.Google Scholar
  12. /12/.
    Pratt, T.W. "Pair grammars, graph languages and string to graph translations", JCSS 5, 560–595, 1971.Google Scholar
  13. /13/.
    Knuth, D. "Semantics of context-free languages", Math. Systems Theory, 2, 127–145, 1968; Correction: Math. Systems Theory 5, 95–96, 1971.CrossRefGoogle Scholar
  14. /14/.
    Bochmann, G.V. "Semantic evaluated from left to right", CACM 2, 19, 55–63, 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • P. L. Della Vigna
    • 1
  • C. Ghezzi
    • 1
  1. 1.Istituto di Elettrotecnica ed Elettronica Politecnico di Milano - Piazza L. da Vinci 32MilanoItaly

Personalised recommendations