Register

ME = Compiler

• retagged by
435 views

2 Answers

Best answer
2 votes
2 votes

Yes the Grammar S→SS/ab is ambiguous

The least possible string in the grammar is ab and  abab here only one parse tree is possible but we cann't conclude it as Unambiguos and next smallest string is ababab for this string 2 parse trees are possible 

So it is Ambiguous

• selected by
User Avatar
2 votes
2 votes
derive string ababab.

it will have 2 derivations .

1. S->SS

         abS

         abSS

         ababS

         ababab

2.S->SS

        SSS

        abSS

        ababS

        ababab

 

Verify by drawing parse trees them.you will find 2 different trees.:D
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
rahul sharma 5 asked Oct 17, 2017
8,492 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
1 votes
1 votes
2 answers
2
umang_16 asked Dec 16, 2016
641 views
Compiler
Consider the grammar given below. It is E -> T+E | T T -> a a. SLR(1) but not LL(1) b. Not an operator grammar c. Ambiguous d. None of these
Consider the grammar given below. It isE - T+E | TT - aa. SLR(1) but not LL(1)b. Not an operator grammarc. Ambiguousd. None of these
User Avatar
2 votes
2 votes
1 answer
3
Amit puri asked Nov 18, 2016
260 views
COMPILER
User Avatar
0 votes
0 votes
1 answer
4
KISHALAY DAS asked Nov 9, 2016
655 views
Compiler Parsing
User Avatar
Link Copied!