0 votes 0 votes Is the string $aabbababb$ in the language generated by the grammar $S → aSS|b$? Show that the grammar with productions $S\rightarrow aAb|\lambda,$ $A\rightarrow aAb|\lambda$ is unambiguous. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar ambiguous + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 333 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→aSS→aaSSS→aabbS→aabbaSS→aabbabS→aabbabaSS→aabbababb JAINchiNMay answered Oct 12, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.