in Compiler Design retagged by
1,840 views
0 votes
0 votes
Get LL(1) parsing table for the following grammar
A--> aCDq / aBg
C --> p /Ct / BD / rAB
D--> d
B-->e
in Compiler Design retagged by
1.8k views

1 Answer

0 votes
0 votes

May be wrong?

Anyone pls verify:

 

First (C) = p,r,e

3 Comments

edited by
We need to have the actual production in the table.

For example in 'A' row and 'a' column, we need to have the productions A--> aCDq / aBg

Similarly we need to correct the other entries in the table
0
0

Yes this was an example the grammer is not LL(1) as there are two entries in [A,a] . Is this correct?

Columns for g,q,t,$ are empty and is [C,e] = C-> BD???

0
0
yes, you are right, the grammar is not LL(1) as there are 2 entires in [A,a]
0
0

Related questions