16

17

18

19

20

b)
a)

b)
a)
b)

a)

b)
a)
b)

03000CS304052001

managing various tasks in stack allocation strategy when a procedure is
activated.

Explain copy propagation with an example.

Write SDD to produce three-address code for Boolean expressions and obtain
the three-address code for the statement given below:

while a < b do
if c > 0 then
X=y+zZ
else
X=y-Z
Explain common sub expression elimination with an example.

Identify any four issues in the design of a Code Generator.

Write the three address code sequence for the statement x=y*z + y*-z. Also give
its triple representation.

Write the code generation algorithm. Using this algorithm generate code
sequence for the expression x = (a - 0) + (३ + ९).

With suitable example of a basic block, explain the code-improving
transformations of a basic block.

Describe the various fields in an activation record.

Explain the 3 representations of three-address code statements.

What is static allocation strategy? What are its limitations?

Page 3 of 3

(4)
(6)

(4)
(6)
(4)

(10)

(6)

(4)

(6)
(4)