Register

ambiguity test

1,809 views
0 votes
0 votes
  • S -> SS|AB 
  • A -> Aa|a  
  • B -> Bb|b    Is this grammar is ambigious or Not?
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
A_i_$_h asked Dec 23, 2017
657 views
ambiguity
$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?
$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?
User Avatar
0 votes
0 votes
2 answers
2
rahul sharma 5 asked Oct 17, 2017
8,501 views
[Compiler Design] Ambiguity
The productions E -> E+E | E-E | E*E | id a:) generates inherently ambiguous languages b:) generates and ambiguous language c:) is an ambiguous grammer d) none of these
The productionsE - E+E | E-E | E*E | ida:) generates inherently ambiguous languagesb:) generates and ambiguous languagec:) is an ambiguous grammerd) none of these
User Avatar
Link Copied!