Abstract semantic graph

This article needs .
Please improve it in any way that you see fit, and remove this notice afterward. For help, see and the .

In computer science, 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 article is licensed under the GNU Free Documentation License. It uses material from Wikipedia article. Browse Wikipedia for more information.