Register

Are right recursive grammars ambiguous?

927 views

1 Answer

Best answer
1 votes
1 votes
A grammar is ambiguous if it is both left and right recursive.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

24 votes
24 votes
1 answer
1
Harsh Tripathi asked Jun 30, 2016
4,680 views
CAN Inherently ambiguous languages HAVE DETERMINISTIC CONTEXT FREE GRAMMARS?
DANGLING ELSE PROBLEM: S->iEtSS' / a S'->∊/ eS E->b is a Deterministic context free grammar, and is ambiguous for "iEtiEtSeS" but ALL DCFG ARE UNAMBIGUOUS . so " how can this DCFG be ambiguous?"
DANGLING ELSE PROBLEM:S->iEtSS' / aS'->∊/ eS E->b is a Deterministic context free grammar, and is ambiguous for "iEtiEtSeS" but ALL DCFG ARE UNAMBIGUOUS . so " how c...
User Avatar
0 votes
0 votes
3 answers
3
Yogendraa asked Jun 9, 2022
1,087 views
How many parse tree can be constructed for the given ambiguous grammar?
E--> E+E E--> E*E E--> id Input string: id + id + id
E E+EE E*EE idInput string: id + id + id
User Avatar
2 votes
2 votes
3 answers
4
Rahul Ranjan 1 asked May 28, 2018
1,445 views
Ambiguous and unambiguous grammar
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 derivation ?
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...
User Avatar
Link Copied!