edited by
1,457 views

2 Answers

1 votes
1 votes

S->aA {a} S->B {b,c}  so {a} ∩ {b,c}= ∅;

     {First of the respective RHS}

A->aA {a} A->b {b}    so, {a}  {b}  =

B->bB {b} B->c {c}    so, {b}  {c} =

Therefore LL(1) grammar.Hence Deterministic,Not ambiguous and  Not Left Recursive.
edited by
Answer:

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,182 views
Can you give an example which is not LL(1) but is CLR(1)
1 votes
1 votes
2 answers
3
KISHALAY DAS asked Nov 12, 2016
4,093 views
8 votes
8 votes
3 answers
4
Parshu gate asked Nov 13, 2017
15,199 views
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...