NAME: ABU MINHAJ FAROOQI

REG #: 37560
COURSE: COMPILER CONSTRUCTION

ANSWER OF QUESTION NO 1(A):

Left Recursion does not exist.

ANSWER OF QUESTION NO 1(B):

ANSWER OF QUESTION NO 1(C):

A => Ba
B => q
 A => q | c B b | d C b | d C a (We cannot further proceed)
B => Aac
A => dCa
B => dCa
C => q
B => dqa

C => f A C B
A => Ba
C => q
B => q
C => fBaqq
B => q
C => fqqq

This grammar is ambiguous

ANSWER OF QUESTION NO 1(D):

The language generated by this grammar is e, q and five strings are:
⦁ cdfcqaqfa
⦁ abcdefq
⦁ cdfcqbqfc
⦁ ddfaqbqfb
⦁ fdccqbqfd

ANSWER OF QUESTION NO 1(E):

Non-Terminal Symbol First Set
B B
a a
c c
b b
d d
C C
A B, c, d

Follow Set
Non-Terminal Symbol Follow Set
A $

First Set
Non-Terminal Symbol First Set
q q
e e
A A
a a
C C
B q, e, A

Follow Set
Non-Terminal Symbol Follow Set
B $

First Set
Non-Terminal Symbol First Set
f f
A A
B B
q q
C f, q

Follow Set
Non-Terminal Symbol Follow Set
C $, B

ANSWER OF QUESTION NO 1(F):

LL(1) Parsing Table:
[[0,"B","a","c","b","d","C","$"], [0,0,0,0,0,0,0,0], [0,1,6,2,6,4,6,5]]
[[0,"q","e","A","a","C","$"], [0,0,0,0,0,0,0], [0,1,2,3,5,5,4]]
[[0,"f","A","B","q","$"], [0,0,0,0,0,0], [0,1,4,3,2,3]]

ANSWER OF QUESTION NO 1(G):