Compiler Design (2170701)

BE | Semester 7 
  Winter - 2018|15/11/2018
Total Marks 70

Q1 (a) List the cousins of compiler and explain the role of any one of them.

Q1 (b) Write a brief note on input buffering techniques.

Q1 (c) Explain front end and back end of compiler in detail.

Q2 (a) Define the following terms and give suitable example for it.
1.) Handle   2.) Handle Pruning   3.) Left Factoring

Q2 (b) Explain all error recovery strategies used by parser.

Q2 (c) Construct LL(1) parsing table for the following Grammar:   
  • E -> E+T | T
  • T -> T*F | F
  • F -> (E) | a

(c)
OR

Q2 (c) Construct NFA for following regular expression using Thompson’s notation and then convert it into DFA. (a/b)*abb#

Q3 (a) Define the following terms and give suitable example for it.
1) Augmented Grammar  2) LR(0) Item  3) LR(1) Item

Q3 (b) Differentiate Top Down Parsing and Bottom up parsing.

Q3 (c) Construct SLR parsing table for the following grammar :
S ->(L)|a
L->L,S|S

Q3 (a) Give the difference between SLR and CLR Parser.

Q3 (b) List the different conflicts that occur in Bottom up parsing and give examples for that.

Q3 (c) Implement the following grammar using Recursive Descent Parser.
S -> Aa | bAc | bBa
A -> d
B -> d

Q4 (a) What is Ambiguous Grammar? Describe with example.

Q4 (b) Give the difference between synthesized attributes and inherited attributes.

Q4 (c) Construct CLR parsing table for the following grammar :
S ->AA
A->aA|b

OR

Q4 (a) List the different issues in code generation phase and describe any two issues.

Q4 (b) Explain parameter passing techniques for procedure.

Q4 (c) Explain Quadruple, triple and indirect triple with suitable example.

Q5 (a) Draw syntax tree and DAG for the statement
  x=(a+b)*(a+b+c)*(a+b+c+d)

Q5 (b) Explain dynamic memory allocation strategy.

Q5 (c) What is an activation record? Explain how they are used to access local and global variables.

OR

Q5 (a) Write a note on stack allocation strategy.

Q5 (b) Give the translation scheme that converts infix to postfix expression for the following grammar and also generate the annotated parse tree for input string : “id+id*id”
E -> E+T | T
T -> T*F | F
F -> id

Q5 (c) Discuss various code optimization techniques with examples.