On structured graph grammars. I

From MaRDI portal
(Redirected from Publication:753498)





One starts by identifying the steps generally followed when applying a rule r to a graph M in a graph grammar; then one formalizes these steps, obtaining a model called structured graph grammar. Various examples, illustrating this approach, are discussed (binary trees, pretty patterns, syntax diagrams) and many previous approaches to graph grammars are interpreted in this unifying framework (the DNLC approach, the Nagl's approach, the web approach, the edge replacement, the so-called Berlin approach, as well as the hypergraph systems).




Cited in
(35)








This page was built for publication: On structured graph grammars. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753498)