Consider the block of three-address code a) Identify leaders and generate basic blocks
b) Create DAG (Directed Acyclic Graph)
1. To = a * b
2. T1 = To + j
3. T2 = T0 * T1
4. T3 = b[T2]
5. j = T3
6. T4 = j + 2
7. T5 = c[T4]
8. T6 = a * b * 10
9. i = T6
10. sub=i
11. If i <= 15 GOTO (1)