It's really important to me, so please help me.
Is this grammar LL(1)?
S -> LAB
L -> d | ε
A -> dA | Ba
B -> Bb | ε
can anyone help me with LL(1) parsing table?
Am I right about this?
first(S) = {a,b,d}
first(L) = {d}
first(A) = {b,d}
first(B) = {b}
follow(S) = {$}
follow(L) = {a,b,d}
follow(A) = {b,$}
follow(B) = {$}