Total No. of Questions 18] [Total No. of Pages 2
M.Sc. DEGREE EXAMINATION, MAY 2017
Second Year
COMPUTER SCIENCE
Compiler Design
Time 3 Hours Maximum Marks :70
SECTION A
Answer Any three questions. × 15 45)
Q1) How does lexical analyzer help in the process of compilation? Consider the following
Conditional statement:
if then y 5 else y 10;
Generate various lexemes of above expression.
Q2) Design SLR parser for the following frammar:
S → CC
C → cC
Q3) State and discuss about different storage allocation strategies.
Q4) Discuss various forms of intermediate code generation.
Q5) Explain peephole optimization methods with suitable example.
SECTION B
Answer Any Five questions. × 4 20)
Q6) Describe different compiler construction tools.
Q7) Construct finite state machine for the regular expression: a abb.
Q8) What is left factoring? How to eliminate left factoring? Eliminate left factoring
from the following grammar:
S → iEtS iEtSeS a
E →b
Q9) Explain shift reduce parsing technique with suitable example.
Q10) Write note on syntax directed translation.
Q11) Generate machine code for the following instruction:
X a d
Q12) Write a procedure to identify basic blocks in loop optimization.
Q13) Describe code generation algorithm.
SECTION C
Answer all questions. × 1
Q14) What is regular expression?
Q15) Define operator precedence grammar.
Q16) What is DAG?
Q17) What is input buffering?
Q18) Define dead code elimination.