Register

Ambiguous grammar

1,323 views
1 votes
1 votes
How is this grammar Ambiguous??

S-> SS+ /   SS*  / a      

Can anyone give me an example of a string with parse trees ,I am unable to find such string.
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
3 answers
1
Yogendraa asked Jun 9, 2022
1,104 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
0 votes
0 votes
0 answers
2
o asked Jan 2, 2022
708 views
(Answered) Self doubt about ambiguous grammar
I understand all these following separately : 1) DCFG is always unambiguous 2) Regular grammar is a subset of DCFG 3) Regular grammar can be ambiguous But can't understand how any DCFG is unambiguous if its subset can be ambiguous
I understand all these following separately :1) DCFG is always unambiguous2) Regular grammar is a subset of DCFG3) Regular grammar can be ambiguousBut can't understand ho...
User Avatar
1 votes
1 votes
1 answer
3
Dhananjay15 asked Aug 14, 2018
1,368 views
Is all ambiguous grammar could be converted to unambiguous?
User Avatar
2 votes
2 votes
3 answers
4
Rahul Ranjan 1 asked May 28, 2018
1,448 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!