Consider the matrix multiplication program in Fig. 10.72.

a) Assuming a. b, and care allocated static storage and there ale four bytes per word in a byte-addressed memory, produce three address statements for the program in Fig. 10.72,

b) Generate target-machine code from the three-address statements.

c) Construct a flow graph from the three-address statements.

d) Eliminate the common sub expressions from each basic block.

e) Find the loops in the flow graph. f) Move rne loop-invariant computation s out of the loops.

g) Find the induction variables of each loop and eliminate them where possible.

h) Generate target-machine code from the flow graph in (g). Compare the code with that produced in