Scribd
Upload
835 views4 pages

Compiler Design Solutions: 1. What Is in The Follow (S) ?

The document contains solutions to 8 questions about compiler design concepts like follow sets, LL(1) grammars, LR parsing, syntax directed translation, register allocation, and backtracking. Key details include: - Follow(S) = {b, c, +, *, $} - Follow(B) = {c, b, *, a, d} - LR parsing can describe more languages than LL parsing - Grammar G2: A → 0A | 1 is LR(k) but grammar G1 is ambiguous - 2 registers are required to generate code for the expression x = a*b – c*d+e - 2 backtracks are needed to generate the string aab from

Uploaded by

Nirav
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
835 views4 pages

Compiler Design Solutions: 1. What Is in The Follow (S) ?

The document contains solutions to 8 questions about compiler design concepts like follow sets, LL(1) grammars, LR parsing, syntax directed translation, register allocation, and backtracking. Key details include: - Follow(S) = {b, c, +, *, $} - Follow(B) = {c, b, *, a, d} - LR parsing can describe more languages than LL parsing - Grammar G2: A → 0A | 1 is LR(k) but grammar G1 is ambiguous - 2 registers are required to generate code for the expression x = a*b – c*d+e - 2 backtracks are needed to generate the string aab from

Uploaded by

Nirav
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

COMPILER DESIGN

SOLUTIONS

S → aSAb | bSBc ⇨First(S) = {a, b}


A → +AB | ε ⇨First(A) = {+, ε}
B → *BC | ε ⇨First(B) = {*, ε}
C → aC | d ⇨First(C) = {a, d}

1. What is in the Follow(S)?

(a) {a, b, c, +, $} (b) {a, c, +, *, $}


(c) {b, c, +, *, $} (d) {a, b, d, *, $}

Solution: Option (c)

Explanation:

S → aSAb | bSBc
A → +AB | ε
B → *BC | ε
C → aC | d

Follow(S) = {First(A), First(B), b, c, $}

2. What is in the Follow(B)?

(a) {a, b, c, d, *} (b) {a, b, d, ε, $}


(c) {a, c, d, *, $} (d) {c, d, b, +, *}

Solution: Option (a)

Explanation:

Follow(B) = {C, Follow(A), First(C)}

b, First(B)

= {c, b, *, a, d}

1
3. Choose the False statement.

(a) No left recursive/ ambiguous grammar can be LL(1)


(b) The class of grammars that can be parsed using LR methods is proper subset of the class of
grammar that can be parsed by LL method
(c) LR parsing is non-backtracking method
(d) LR parsing can describe more languages than LL parsing

Solution: Option (b)

Explanation:

FALSE, as LL(1) ⊆ LR(k)

4. Consider the following SDT.

A → BC *(I) B.i = f(A.i)


(II) B.i = f(A.S)
(III) A.S = f(B.s)

Which of the above is violating L – attributed definition?

(a) I only (b) II only


(c) I, II (d) I, II, III

Solution: Option (b)

Explanation:

It does not follow L-attribute definition.

5.

X → YZ

Y → Y + Z {print (‘+’);}
T {Y.val = T.val}

Z → *Y {print (‘*’);} Z
T {Z.val = T.val}
ε

T → num {print(num.val);}

2
For 2+3*2, the above translation scheme prints

(a) 2+3*2 (b) 23+2*


(c) 232*+ (d) 23*2+

Solution: Option (b)

Explanation:

23 + 2*

6. Consider the following expression


x = a*b – c*d+e

For generating target code how many register will be required apart from accumulator A?

(a) 1 (b) 2
(c) 3 (d) 5

Solution: Option (a)

Explanation:

x=a*b–c*d+e

MOV A, a
MUL b
MOV R1, A
MOV A, C
MUL d
SUB R1, A
ADD R1, e

So, One Register required.

3
7. Consider the following two grammars

G1: A → A1 | 0A1 | 01
G2: A → 0A | 1

Which of the following is True regarding above grammars?

(a) L1 is LR(k) (b) L2 is LR(k)


(c) Both L1 and L2 is LR(k) (d) None is LR(k)

Solution: Option (b)

Explanation:

G1: A → A1 | 0A1 | 01 --- Ambiguous grammar


G2: A → 0A | 1 --- Regular grammar

Ambiguous grammar is not LR(k)


Above Regular grammar is LR(k)

8. Consider the following grammar.

S → aB | aAb
A → bAb | a
B → aB | ε

How many back tracks are required to generate the string aab from the above grammar?

(a) 1 (b) 2
(c) 3 (d) 4

Solution: Option (b)

Explanation:

S ⇨ aB S ⇨ aAb S ⇨ aAb
⇨ aaB ⇨ abAbb ⇨ aab
⇨ aa ⇨ ababb
Backtrack Backtrack

So, 2 backtracking is required.

You might also like