Register

Ambiguous grammar

• retagged by
624 views

2 Answers

Best answer
3 votes
3 votes

Grammar is ambigous if it generate two parse tree for any string derived from grammar . here only ab is derive whic is only one derivation tree. So not ambigous.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
learner_geek asked Aug 2, 2017
561 views
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
If i am wrong please let me correct with giving proper explanation.
User Avatar
2 votes
2 votes
3 answers
2
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
0 votes
0 votes
1 answer
3
Nikhil Patil asked Feb 7, 2018
356 views
Test Questiion
$G: S\rightarrow SbS\mid a$ Grammars are ambiguous True/False.
$G: S\rightarrow SbS\mid a$Grammars are ambiguous True/False.
User Avatar
0 votes
0 votes
1 answer
4
Sanket_ asked Nov 10, 2016
354 views
Parsing
which is false? a) An unambiguous grammar has same RMD for every sentence. b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the language generated.
which is false?a) An unambiguous grammar has same RMD for every sentence.b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the la...
User Avatar
Link Copied!