Jump to content

Abstract semantic graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 70.24.10.47 (talk) at 03:09, 6 November 2004. 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)

An abstract semantic graph (ASG) is a higher abstraction than an abstract syntax tree (AST). Unlike ASTs, ASGs also represent semantic elements of a program in addition to syntax. This is essentially done through the use of back-pointers. A back-pointer is an edge from an identifier node to a node that represents its declaration... [this text needs to be verified and corrected]