Consider the following CFG G:S SS
Chapter , Problem 2.46(choose chapter or problem)
Consider the following CFG G:S SS | T T aTb | abDescribe L(G) and show that G is ambiguous. Give an unambiguous grammar H where L(H) = L(G) and sketch a proof that H is unambiguous.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer