Is there a link between Graph Nodes and AST

[Andreas Olschnögger]

Hi,

I am using graph analysis to construct a set of nodes for further examination. I am curious if there is a way to link the statements or expressions of a node to the Abstract Syntax Tree (AST).

Initially, I considered storing my expressions in a global list and identifying the corresponding expressions by comparing them to this list. However, this approach presents a problem: when there are two different expressions with identical code, both will be regognized as part of the set.

This is a simple example:
https://boa.cs.iastate.edu/boa/?q=boa/job/109057
I want to have the node with the id 30 part of my set. and print the Expressions of my set.
I would expect just one Expression to be printed since i filled my set with only one expression.
But because there are two Expression with the same content both of them are printed.
Is there another way to identify expressions belonging to the node?

Thank you