Reference no: EM133027013

COMPILER DESIGN ASSIGNMENT

Question 1. Eliminate left recursion from the grammar shown below:

a. S→S a b | b

b. S→S a | S b | c

Question 2. Left factor each of the grammars shown below:

a. S→ x S | y S | y

b. S→ a S b | a b

Question 3. Fill in the tables below with the FIRST and FOLLOW sets of each grammar shown.

a.
                        FIRST                   FOLLOW
S→ x B
B→Sy |y

b.
                        FIRST                   FOLLOW
S→Bb |C d
B→ a B |ε
C→cC |ε

c.
                        FIRST                   FOLLOW
S→A B C
A→CB
B→b |ε
C→c |ε

Question 4. Create a predictive parsing table for the following grammar:

S→ x B
B→S y | y

Question 5. Create the LR(0) automaton (state diagram) and then the SLR parsing table for the augmented grammar shown below with the preassigned rule numbers.

(0) S' →S
(1) S→BB
(2) B → a B
(3) B→ c