1. The order in which DAG nodes are created from the intermediate code during the DAG construction process is in topologically sorted order.
2. The leaf nodes in a DAG cannot have any attached identifiers to it.
3. The input variables to a block manifest as leaves in the DAG during the DAG construction process
4. Each node in a flow graph is a quad.
5. There are (n – 1) points for a basic block containing ‘n’ quads.
6. The ‘available expressions’ data fl ow property is used for global common sub-expression elimination