Term graph
 | It has been suggested that this article be merged into graph rewriting. (Discuss) Proposed since June 2013. |
A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms.[1] Term graphs are a more powerful form of representation than expression trees because they can represent not only common subexpressions (i.e. they can take the structure of a directed acyclic graph) but also cyclic/recursive subexpressions (cyclic digraphs).
The phrase "term graph rewriting" is often used when discussing graph rewriting methods for transforming expressions in formal languages.[2]
See also
References
- ^ Plump D. (Hartmut Ehrig, G. Engels, Grzegorz Rozenberg, eds) (1999). Handbook of Graph Grammars and Computing by Graph Transformation: applications, languages and tools. Vol. 2. World Scientific. pp. 9–13. ISBN 9789810228842.
{{cite book}}: CS1 maint: multiple names: authors list (link) - ^ Barendregt, H. P. (1987). "Term graph rewriting". PARLE Parallel Architectures and Languages Europe (Lecture Notes in Computer Science). 259: 141–158. doi:10.1007/3-540-17945-3_8.
{{cite journal}}: Unknown parameter|coauthors=ignored (|author=suggested) (help)
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |