retagged by
1,604 views
1 votes
1 votes

Consider the following grammar G:

$S\rightarrow AB\mid d$

$A\rightarrow aA\mid b$

$B\rightarrow bB\mid c$

The grammar G is:

  1. LL (1) grammar and not LR (0)
  2. LL (1) and LR (0)
  3. Not LL (1) but LR (0)
  4. Neither LL (1) nor LR (0)
retagged by

6 Answers

0 votes
0 votes

It is LL(1) but not LR (0) correct me if I am wrong 

edited by
Answer:

Related questions

0 votes
0 votes
1 answer
5
2 votes
2 votes
2 answers
6
Subhrangsu asked Apr 16, 2022
9,915 views
Is the following grammar LL(1) ?S→ aABbCD | ϵA→ ASd | ϵB→ Sac| hC | ϵC→ Sf |CgD→ aBD | ϵDraw the LL(1) parsing table for the given grammar.
0 votes
0 votes
2 answers
7
sripo asked Nov 1, 2018
2,429 views
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]