Total No. of Questions 18] [Total No. of Pages 02
M.Sc. DEGREE EXAMINATION, MAY 2018
Second Year
COMPUTER SCIENCE
Compiler Design
Time 3 Hours Maximum Marks :70
SECTION A
Answer any three questions. x 15 45)
Q1) State and describe various phases of compilers.
Explain about boot strapping in compilers.
Q2) Consider the grammar given below:
S A
A aB| Ad
B bBC| f
C g
→
→
→
→
Find the FIRST and FOLLOW set.
Construct Predictive Parsing table.
Trace whether the string "abbfgg" is accepted or not.
Q3) Explain about syntax directed definition and syntax directed translation with
example.
Q4) Discuss different storage allocations strategies.
Q5) Illustrate loop optimization with suitable example.
SECTION B
Answer any five questions. x 4 20)
Q6) Construct DFA for the regular expressions:
Q7) Describe the functions of lexical analyzer.
Q8) What is left factoring? Explain it with suitable example.
Q9) Apply shift reduce parser for parsing following string using unambiguous
grammar.
id id id id
Q10) Translate the expression: a b c c into quadruples and triples.
Q11) What is a symbol table? Discuss the most suitable data structure for it.
Q12) Describe various addressing modes and their costs.
Q13) Explain about common sub expression elimination and copy propagation with
example.
SECTION C
Answer all questions. x 1
Q14) What is interpreter?
Q15) Define input buffering.
Q16) Define operator precedence grammar.
Q17) Define basic block.
Q18) What is meant by abstract syntax tree?