Question: Consider the following CF G G: S - > SS | T T - > aT b | ab What is the language G generates

Consider the following CF G G:
S -> SS | T
T -> aT b | ab
What is the language G generates [2 marks]
Show that G is ambiguous [4 marks]
Give an unambiguous grammar H where L(G)= L(H)[4 marks]
Sketch a proof that H is unambiguous.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!