# Determining Ambiguity of grammar

I read that no LL(1) grammar can be ambiguous.

Can we just make a LL(1) predictive parser table for a grammar to determine whether it's ambiguous? If the grammar is not LL(1), can we say that grammar is ambiguous?

• Suppose we have a grammar $A -> aA / b$ . If we reverse it then grammar is $A -> Aa / b$ . Here the grammar is unambiguous but not LL(1) because we have left recursion after reversing. Did you mean this ? – Sagar P Nov 7 '17 at 6:50