The following grammar is LL(1) ?
S -> aA/∈
A-> abS/∈
We know that, if a grammar has to be LL(1), there should be not be multiple entries for any column of any row.
Alternatively we can check like,
First(aA) and Follow(S)(This is for ∈ production) should not have common terminals.
Similarly for First(abS) and Follow(A) should not have common terminals.
so,we have First(aA) = { a },
Follow(S) = { dollarSign }.
hence no common terminals.
First(abS) = { a },
Follow(A) = { dollar Sign } .
here also no common terminals.
Is My understanding correct. Please correct me if iam wrong.