Program Representation: Directed Acyclic Graphs

This video describes the usage of directed acyclic graphs (DAGs) as a core data structure to represent the instructions in a basic block. We show how to use this data structure to carry out optimizations such as redundancy elimination and dead-code elimination.