- $S \to A \mid B$
- $A \to a \mid \epsilon$
- $B \to b \mid \epsilon$
Now if I want to generate empty string ($\epsilon$) from above grammar, I have more than one option to generate it. Obviously grammar is ambiguous. No parser will work.
So, just for answer : Grammar is NOT LL(1).