Scribd
Upload
3 views

mca-501a-distributed-database-management-2012

The document is an examination paper for Compiler Design, including multiple choice, short answer, and long answer questions. It covers topics such as grammar, parsing, three-address code, and optimization techniques. The exam is structured into three groups with varying question formats and marks allocation.

Uploaded by

rajgobindadham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

mca-501a-distributed-database-management-2012

The document is an examination paper for Compiler Design, including multiple choice, short answer, and long answer questions. It covers topics such as grammar, parsing, three-address code, and optimization techniques. The exam is structured into three groups with varying question formats and marks allocation.

Uploaded by

rajgobindadham
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

http://www.makaut.

com

Name : …………………………………………….………………
Roll No. : …………………………………………...……………..
Invigilator’s Signature : ………………………………………..

CS/MCA/SEM-5/MCAE-504A/2012-13

2012
COMPILER DESIGN
Time Allotted : 3 Hours Full Marks : 70

The figures in the margin indicate full marks.


Candidates are required to give their answers in their own words
as far as practicable.

GROUP – A
( Multiple Choice Type Questions )

1. Choose the correct alternatives for any five of the following :


5 × 2 = 10
i) If G is S → aS / bS / a / b, then L(G) is :
a) {a, b}* b) {a, b}+
c) {a, b, S} d) None of these.
ii) Context free grammar is accepted by :
a) Turing Machine b) Finite Automata
c) Push Down Automata d) None of these.
iii) A symbol table is a :
a) Compilation phase b) Error handler
c) Data structure d) None of these.
iv) Bottom up parsing is a right choice to handle a larger
class of grammar.
a) True b) False
c) Not always d) Irrelevant.

5351 [ Turn over


CS/MCA/SEM-5/MCAE-504A/2012-13

v) The difference between DAG and Syntax tree lies in the


fact that :

a) A node in a Syntax tree for a common sub


expression has more than one parent

b) A node in a DAG for a common sub expression has


more than one parent

c) A node in a Syntax tree for a common sub


expression may have more than one parent.
vi) What is not the phase of a compiler ?

a) Syntax analyzer b) Code generator

c) Code optimizer d) Code linker.

vii) What is the first phase of a compiler ?

a) Code generator b) Code optimizer

c) Lexical analyzer d) Syntax analyzer.

GROUP – B
( Short Answer Type Questions )
Answer any three of the following. 3 × 5 = 15

2. Generate 3 address code for the following program segment


sum = 0;
for (j = 1; j<=10;j++)
sum=sum+a[j]+b[j];
3. a) What do you mean Left recursion ?
b) Eliminate the left recursion from the following grammar:
S → (L) / a
L → L, S / S 2+3

5351 2
CS/MCA/SEM-5/MCAE-504A/2012-13

4. Compare different implementation of 3 – address code. 5


5. a) What is DAG ?
b) Draw the DAG for the following expression
a + (b*d) + c* (b*d) + e + a/(b*d)
6. Find out FIRST and FOLLOW for the following grammar :
E→E+T/T
T → TF / F
F→F*/a

GROUP – C
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45
7. a) A grammar is given below :
S → aS |aSbS|∈
Show that the grammar is ambiguous by constructing
two parse trees and two leftmost derivations for aab.
b) Consider the following grammar :
S → CC
C → cC|d
Construct the canonical collection of LR(1) items for this
grammar. 8+7
8. a) Draw the DAG for the expression
a + a * (b – c) + ( b – c ) * d
b) What is syntax tree ?
c) Write the three address code for the following :
for (i = 1; i < 10; i++)
if (a < 10)
a = a + b;
else
a = a-b;

5351 3 [ Turn over


CS/MCA/SEM-5/MCAE-504A/2012-13

d) What are the rules to compute FIRST and FOLLOW ?


3+2+5+5

9. Briefly explain each of the following with example 5 × 3 = 15

i) Constant Folding

ii) Common sub expression elimination

iii) Dead code elimination

iv) Loop unrolling

v) Code motion.

10. Write short notes on the following (any three) : 3 × 5 = 15

a) Three address code

b) Peephole optimization

c) Basic Block

d) Symbol table.

11. a) Discuss the procedure to convert a regular expression to


corresponding NFA with figure, and hence convert the
following regular expression to NFA :

(a|b)*(ab)*aabb

b) Eliminate the left recursion of the following productions:

bexpr-> bexpr or bterm|bterm

bterm-> bterm and bfactor|bfactor

bfactor -> not bfactor|(bexpr)|true|false

and hence find out the FIRST and FOLLOW of the above
productions. 6+9

5351 4

You might also like