Consider the following CF G G: S → SS | T T → aT b | ab • What is the language G generates • Show that G is ambiguous •
Posted: Fri May 20, 2022 11:52 am
Consider the following CF G G:
S → SS | T
T → aT b | ab
• What is the language G generates
• Show that G is ambiguous
• Give an unambiguous grammar H where L(G) = L(H)
• Sketch a proof that H is unambiguous.
S → SS | T
T → aT b | ab
• What is the language G generates
• Show that G is ambiguous
• Give an unambiguous grammar H where L(G) = L(H)
• Sketch a proof that H is unambiguous.