Jump to content

Hypergraph grammar

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Yobot (talk | contribs) at 06:07, 26 September 2016 (→Implementations and applications: WP:CHECKWIKI error fixes using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  1. ^ 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.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Hypergraph_grammar&oldid=741232669"