0 votes 0 votes Show that the grammar $S\rightarrow aSb|SS|\lambda$ is ambiguous, but that the language denoted by it is not. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar ambiguous + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 273 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→aSb→ab S→SS→aSbS→ab JAINchiNMay answered Oct 12, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.