Something like a in b <- a. Without any surrounding information, a will produce the identifier reference a. Similarly, b will create a reference.

interface InGraphIdentifierDefinition {
    controlDependencies: undefined | ControlDependency[];
    definedAt: NodeId;
    name: undefined | Identifier;
    nodeId: NodeId;
    type: InGraphReferenceType;
}

Hierarchy (view full)

Hierarchy-Diagram

UML class diagram of InGraphIdentifierDefinition

Properties

controlDependencies: undefined | ControlDependency[]

If the reference is only effective, if, for example, an if-then-else condition is true, this references the root of the if. As a hacky intermediate solution (until we have pointer-analysis), an empty array may indicate a maybe which is due to pointer access (e.g., in a[x] <- 3).

definedAt: NodeId

The assignment (or whatever, like assign function call) node which ultimately defined this identifier

name: undefined | Identifier

Name the reference is identified by (e.g., the name of the variable), undefined if the reference is "artificial" (e.g., anonymous)

nodeId: NodeId

Node which represents the reference in the AST

Type of the reference to be resolved