0 votes 0 votes Consider the following CFG $G:$ $S \rightarrow SS \mid T$ $T \rightarrow aT b \mid ab$ Describe $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. Theory of Computation michael-sipser theory-of-computation context-free-grammar ambiguous proof + – admin asked Oct 12, 2019 edited Oct 12, 2019 by Lakshman Bhaiya admin 414 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.