Page 1 of 2
Name
Reg No

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
07 THRISSUR CLUSTER
SECOND SEMESTER M.TECH. DEGREE EXAMINATION APRIL 2018
Computer Science and Engineering
Computer Science and Engineering
07CS6102 ADVANCED COMPILER DESIGN
Time 3 hours Max.Marks: 60
Answer all six questions. Part of each question is compulsory.
Answer either part or part of each question
Q.no. Module 1 Marks
1a Describe about L-Attributed definitions with an example. 4
b How syntax directed translation is applied to implement array data types? 5
c Write the procedure for implementing while statements using LL parsing. 5
Q.no. Module 2 Marks
2a How intermediate code will be generated using static single assignment form? 4
Write the static single assignment for the following expression





Answer b or c
b Translate the arithmetic expression a into 5
A syntax tree ii) Quadruples iii) Triples iv) Indirect triples
c Illustrate about Back patching for Boolean expressions. 5
Q.no. Module 3 Marks
3a Show the complete activation tree for the following program 4
int f int
Page 2 of 2

int t
if(n return
return s+t
Answer b or c
b Show the control stack implementation of quick sort program. 5
c Write Baker's mark-and-sweep garbage collector algorithm. 5
Q.no. Module 4 Marks
4a Differentiate register allocation and register assignment with example. 4
Answer b or c
b Write an algorithm to partition three-address instruction into basic block 5
and draw the flow graph for the following code fragment.
for i from 1 to 10
for j from 1 to 10

c Describe code generation algorithm with suitable example. 5
Q.no. Module 5 Marks
5a How global common sub-expressions are eliminated. Explain with example. 5
Answer b or c
b Illustrate loops in flow graph. 7
c Describe about data-flow schema implementation using reaching definitions. 7
Q.no. Module 6 Marks
6a Discuss about various constraints in code scheduling. 5
Answer b or c
b Write short note on basic-block scheduling. 7
c Discuss about global code scheduling by illustrating algorithm. 7