Define DAG.

A DAG for a basic block is a directed acyclic graph with the following labels on nodes:
i)    Leaves are labeled by unique identifiers, either variable names or constants.
ii)    Interior nodes are labeled by an operator symbol.
iii)    Nodes are also optionally given a sequence of identifiers for labels.