0 votes 0 votes Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar ambiguous + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 322 views answer comment Share Follow See 1 comment See all 1 1 comment reply Tesla! commented Apr 17, 2019 reply Follow Share In this gammer there are strings that can be created with different production leading to same string. basically tree structure is different for same string eg: abab 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes S→aSb→ab S→SS→aSbS→ab it is same as the last question :p JAINchiNMay answered Oct 12, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.