University of Pune 2007 B.Tech Computer Science and Engineering Pune University - Question Paper
Tuesday, 23 April 2013 04:55Web
Q1 a)What is the difference ranging from a phase and a pass of a compiler?Explain
machine dependent and machine independent phases of compiler. [Marks 8]
b)Explain the front end,back end model.What is backpatching?Explain
its need. [Marks 8]
OR
Q2 a)Expalin Incremental,Boot strapping,byte code compilers with
examples [Marks 8]
b)List and discuss different compiler construction tools.List different [Marks 8]
operators used in BNF notation.
Q3 a)Test whether the subsequent grammar is LL(1) or not?Construct LL(1) [Marks 10]
parser table.
S ---->AB g Da
A ----->ab c
B----->dC
C---->gC g
D---->fD g
b)Discuss the issues with Top-Down Parsing. [Marks 8]
OR
Q4 a)Construct SLR Parsing table for the grammar provided in Q3(a)above. [Marks 8]
b)Construct an LALR parsing table for the subsequent grammar:
S Aa bAc dc bda
A d
Q5a)Explain why every S-attributed definition is L-attributed? [Marks 8]
b)List the commonly used intermediate representations.Write the
subsequent expression in all kinds of intermediate representations you
know:
(a-b)*(c+d)-(a+b) [Marks 12]
OR
Q6 a) Write syntax-Directed definition to translate ’switch’ statement. With
suitable example, show the translation of the source language ‘switch’
statement. [Marks 8]
b)What is need of Semantic Analysis? discuss the position of kind
Checker with diagram. [Marks 8]
SECTION-II
Q7 a)For the subsequent expression write
i)Postfix Notation
ii)Three-address Code &
iii)Syntax tree.
A*-(B+C) [Marks 8]
b)Generate a 3 address code for the subsequent program:
while(A
if(A==3)then C=C+1
else
while(A<=D) do
A=A+3
OR
Q8a)Explain the term Run Time Support and Storage Organization. [Marks 8]
b)What is activation record?Expalin every of its fields. [Marks 8]
Q9 a)What are the problems in the code generation process?Explain in detail. [Marks 8]
b)Explain the mechanism for translating ‘printf’ function in C. [Marks 8]
OR
Q10 a)Explain the code generation algorithm. [Marks 8]
b)Write a note on application of Directed Acyclic Graph(DAG) in code
generation. [Marks 8]
Q11 a) What is a basic block? With a suitable example, explain different
transformations of the basic block. [Marks 10]
b)Explain the concept of Register-allocation and assignment. [Marks 8]
OR
Q12 a)Explain t static single assignment (SSA) form with examples [Marks 8]
b)What is “Peep-hole” optimization? discuss with suitable example. [Marks 10]
| Earning: Approval pending. |
