retagged by
278 views

1 Answer

Best answer
1 votes
1 votes
S->A /b
A->Aa/b
It's a left recursive grammar  but it's ambiguous also because for string 'b' there are two parse trees.

S-> A/bb
A->bA/b  
It's a right recursive grammar and ambiguous also, because for the string "bb" there will be two parse trees.
selected by

Related questions

0 votes
0 votes
1 answer
1
A_i_$_h asked Dec 23, 2017
601 views
$E→E−T ∣ T$$T→T/F ∣ F$$F→(E) ∣ id$(E is the start symbol)This grammar is unambiguous but shouldn't it be ambiguous because it has left recursion?
0 votes
0 votes
1 answer
2
vaishali jhalani asked Nov 21, 2016
1,864 views
If the grammar be left recursive then is it always be ambiguous?
1 votes
1 votes
1 answer
3
1 votes
1 votes
4 answers
4
reena_kandari asked Jan 5, 2017
649 views
Consider the following grammar1)Left Recursive2)Ambiguos3)Left factored4)None of these