Problem Set 7: Liveness Analysis
Due Tuesday, 9 Apr 2013, 11:59pm
The goal of this problem set is to learn about dataflow analysis and in particular, how to determine what variables are live at at a given program point. Ultimately, your job is to build an interference graph on variables, which has an edge between two variables x and y when there exists a program point p such that x and y are both live at p. The interference graph you construct will be used in Problem Set 8 to build the graph-coloring, coalescing register allocator.
Download the assignment as a zip file. You will find all of the files needed for this assignment in your directory.
The file README contains more detailed directions about what you need to do. In particular, you will be modifying the file cfg.ml to complete the parts that are missing.
Submitting your workWhen you have completed the assignment, zip up your ps7 directory as ps7-lastname1-lastname2 and email it to 4410staff at ccs.neu.edu.