can someone share the approach for the following que

Question

14.Show that the grammar S → aSb |SS| e is ambiguous, but that the language denoted by it is not.

Can someone share the approach for second part.

Answer 1

there is no specific approach for solving these kind of questions.

question ask that, show that there exist one unambiguous Grammar which is equivalent to the given grammar.

 

check this : 

S -> epsilon | ab | AB

B -> AB| A

A -> aAb | ab | aABb

Answer 2

S ->∈ | ab | AB

B -> AB| A

A -> aAb | ab | aABb