Jump to content

Term graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Eptified (talk | contribs) at 16:34, 1 June 2013 (Created page with 'A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms. Term graphs are more powerful form of rep...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms. Term graphs are more powerful form of representation than expression trees because they can represent common subexpressions (i.e. they can take the structure of a directed acyclic graph) as well as cyclic/recursive subexpressions (cyclic digraphs).