retagged by
3,414 views

1 Answer

Best answer
1 votes
1 votes

If Grammar is unambiguous, it must be LL(1)  - False

For a given grammar to be not LL(1), there may be various reasons, like the grammar may be left recursive or left factored or the LL(1) parsing table has multiple entries.

If not LL(1) it does not mean ambiguous. - True

As specified above the various reasons for a grammar to not be LL(1), if the grammar is not LL(1), it may or may not be ambiguous.

The given grammar is not ambiguous. It is left recursive and hence not LL(1).

selected by

Related questions

0 votes
0 votes
1 answer
1
Shyam Singh 1 asked Dec 10, 2016
1,469 views
Every SLR grammar is unambiguous. True or False? Why?
1 votes
1 votes
1 answer
2
eyeamgj asked Nov 12, 2018
292 views
S->ABA->aB->bthis grammar is ambiguous or not.Q2; is it true that the number of left most derivation tree is always equal to number of right most derivation tree.?
2 votes
2 votes
3 answers
3
Rahul Ranjan 1 asked May 28, 2018
1,391 views
If a grammar( $CFG$ ) has more than one Right most derivation, Can it be called ambiguous ?Or we say a grammar is ambiguous only when it has more than one left most deriv...