Compiler Design
CSE · Final · Summer 25
Paper 1 of 3Batch 62Switch
Batch 62
Paper 1 of 3
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Daffodil International University
Faculty of Science & Information Technology
Department of Computer Science & Engineering
Final Examination, Summer 2025
Course Code: CSE331, Course Title: Compiler Design
Level: 3 Term: 3 Batch: 62
Time: 02:00 Hrs.
Marks: 40
Answer ALL Questions
[The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.]
1. a) Consider the following grammar to produce LR(0) parser and Canonical Table.
E -> E+E | E*E | (E) | id
[8]
1. b) int main() {
int a = 10, b=2;
int c = a + b;
int f = a + b;
int i = f;
while (i < 20) {
int temp2 = a * b;
i++;
}
if (c < 0) { i = e + f; }
return temp2+i ;
}
Relate the optimization techniques that can be applied to the above code.
Rewrite the code after applying optimization techniques.
[2]
CO2
2. a) Suppose you are part of a compiler design team assigned to develop a predictive parser for a basic arithmetic expression grammar. The grammar is defined as:
E -> E+T | E-T | T
T -> T*F | T/F | F
F -> (E) | id
Apply analytical skills to:
i. Eliminate left recursion from the given grammar and write the equivalent grammar suitable for predictive parsing.
[2]
[6]
ii. Develop the predictive parsing table for the modified grammar
[2]
iii. When can a grammar be called an LL(1) grammar?
[CO2]
3. a) Consider the following expression and answer the questions.
speed + distance * (rate + fee) - (limit * speed) + gain / (extra + fee) + distance * limit
i. Represent the expression using Three Address Code (TAC).
ii. Represent the expression using Quadruples.
iii. Implement a Triples data structure to represent the expression.
[6]
CO3
3. b) Using 3(a) equation answer the following questions.
i. Construct the Syntax Tree for the expression.
ii. Construct a Directed Acyclic Graph (DAG) for the expression.
[4]
4. a)
1 | t89 = b[t42] | 16 | if t17 > t52 goto (22)
2 | goto (22) | 17 | t3 = t40 / t65
3 | a[t82] = t59 | 18 | if t42 < t5 goto (11)
4 | b[t16] = t89 | 19 | goto (46)
5 | if t29 >= t98 goto (16) | 20 | if t17 >= z goto (22)
6 | t96 = a[t66] | 21 | t89 = a[t52]
7 | m = t15 | 22 | t38 = c[t13]
8 | t77 = a[t3] | 23 | v = t67
9 | c[t53] = t16 | 24 | if t44 >= t2 goto (26)
10 | z = t12 | 25 | x = t35
11 | j = t52 | 26 | if t14 < t69 goto (19)
12 | j = t72 | 27 | b[t57] = y
13 | goto (42) | 28 | x = t63
14 | if t22 >= t34 goto (36) | 29 | t82 = b[t54]
15 | t90 = b[t53] | 30 | v = t40
i. Which lines in the code qualify as leaders by leader selection rule 2?
ii. Is / Are there any instruction(s) designated as leaders more than twice?
iii. Conclude the total number of basic blocks identified from the code?
[6]
CO3
4. b) Draw the flow graph for the above mentioned instructions.
[4]