retagged by
1,099 views

2 Answers

Best answer
8 votes
8 votes
It is not LL(1). For a grammar to be LL(1), it should be unambiguous, should be deterministic and should not have left recursion.

The production A->Ab is left recursive.

Therefore, it is not a LL(1) grammar.
selected by
2 votes
2 votes
No it will not be LL(1)

Because First (S) ={a}

First(A)={a}⋂{a} ={a} !=NULL

First(B)={b}⋂{d}=∅

First(C)={d}

for First(A) it will be not LL(1), because for LL(1) there First(A) should be NULL
edited by

Related questions

1 votes
1 votes
2 answers
1
KISHALAY DAS asked Nov 12, 2016
4,093 views
0 votes
0 votes
0 answers
2
rahul sharma 5 asked Nov 12, 2017
1,105 views
Can LL(k) and LR(k) gammer has null and unit productions?
0 votes
0 votes
1 answer
3
rexritz asked Oct 22, 2023
599 views
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow...
2 votes
2 votes
1 answer
4
sripo asked Nov 10, 2018
3,182 views
Can you give an example which is not LL(1) but is CLR(1)