1,086 views

1 Answer

1 votes
1 votes
Grammar free from left recursion and common prefixes ..
First (S) = first (C) = {c,d}
follow (S) = $  
Follow (C) = {c,d,$}
S ----> CCC   //single production so no conflict
C ----> cC| d  
First of {cC} ^ First of {d} = phi, so no conflict
Grammar  is LL(1).

Related questions

2 votes
2 votes
1 answer
3
Mk Utkarsh asked Jan 19, 2018
396 views
S $\rightarrow A$A $\rightarrow AB/$$\epsilon$B $\rightarrow aB/b$is this grammar LALR(1) ?