Hypergraph grammar
In computer science, a hypergraph grammar (also a hyperedge replacement system) is a class of graph grammar with hyperedges rather than simple edges. Hypergraphs prove to be a particularly fruitful class of graph to treat for applications of replacement systems; in particular they model typical data structures very naturally.
Implementations and applications
- DiaGen is a diagram editor that uses hypergraphs as its internal representation of diagrams and supports parsing of diagrams using hypergraph grammars.[1]
Notes
- ↑ Minas (1997)
References
- J. Engelfriet and L. Heyker (1992), Context-free hypergraph grammars have the same term-generating power as attribute grammars, Acta Informatica 29:161-210.
- M. Minas (1997), Diagram editing with hypergraph parser support, in Proc. Visual Languages '97, IEEE Press.
- Rozenberg, Grzegorz (1997), Handbook of Graph Grammars and Computing by Graph Transformations, World Scientific Publishing, volumes 1–3, ISBN 9810228848.
This article is issued from Wikipedia - version of the 9/26/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.