Attributed graph grammars for graphics

  • Herbert Göttler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)


This paper presents a formalization of the notion graphic. A graphic is considered to consist of an ordinary graph describing the overall structure and a set of attributes describing the shape, placement, etc. of the nodes and edges of the underlying graph. The formal handling of graphics is done by attributing the rules of graph grammars and by passing the attributes up and down the derivation tree of the graphic.


Production Rule Graph Production Derivation Tree Derivation Step Graph Grammar 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BR 82]
    W. Brendel: “Attributed Graph Grammars and VLSI-Design”, private communication (1982)Google Scholar
  2. [BU 82]
    H. Bunke: “Graph Grammars as a Generative Tool in Image Understanding”. in this volume.Google Scholar
  3. [GÖ 78]
    H. Göttler: “Semantical Description by Two-Level Graph-Grammars for Quasihierarchical Graphs”, Proc. ‘Workshop WG 78 on Graphtheoretical Concepts in Comp. Science', Applied Comp. Sc. 13, München, Hanser-Verlag (1979)Google Scholar
  4. [GV 82]
    H.Göttler/A.Völk: “A Language for Linearizing Graphics”, Proc. ‘Workshop WG 82 on Graphtheoretical Concepts in Comp. Sc.', München, Hanser-Verlag (1982)Google Scholar
  5. [JOR 75]
    M.Jazayeri/W.F.Odgen/W.C.Rounds: “The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars”, Comm. ACM, 12 (1975).Google Scholar
  6. [KN 68]
    D.E.Knuth: “Semantics of Context-Free Languages”, Math. Syst. Theory2 (68)Google Scholar
  7. [LM 71]
    C. H. Lindsay/S.G. van derMeulen: “Informal Introduction to ALGOL68”, Amsterdam, North Holland (1971)Google Scholar
  8. [MA 81]
    B.H.Mayoh: “Attribute Grammars and Mathematical Semantics“, SIAM J. Computer, 3 (1981)Google Scholar
  9. [NA 79]
    M.Nagl: “Graph-Grammatiken”, Braunschweig, Vieweg, 1979Google Scholar
  10. [NS 73]
    J.Nassi/B.Shneiderman: “Flowchart Techniques for Structured Programming”, ACM-SIGPLAN Notices, 8 / 1981Google Scholar
  11. [PA 81]
    F.G.Pagan: “Formal Specification of Programming Languages”, Englewood Cliffs, N.J., Prentice-Hall (1981)Google Scholar
  12. [PR 71]
    T.W.Pratt: “Pair Grammars, Graph Languages and String-to-Graph Translation”, JCSS 5 (1971)Google Scholar
  13. [SC 70]
    H.J.Schneider: “Chomsky Systeme für partielle Ordnungen, Arb.Ber. d. Inst. f. Math. Masch. u. DV, Bd. 3, 1970Google Scholar
  14. [WI 81]
    M.H. Williams: “Methods for Specifying Static Semantics”, Comp.Lang., 1981Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Herbert Göttler
    • 1
  1. 1.Lehrstuhl für Programmiersprachen der Universität Erlangen-NürnbergErlangen

Personalised recommendations