0 votes 0 votes Show that the following grammar is ambiguous. $S\rightarrow aSbS|bSaS|\lambda$ Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar ambiguous + – Naveen Kumar 3 asked Apr 14, 2019 Naveen Kumar 3 229 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S ⇒ aSbS ⇒ abS ⇒ abab S ⇒ aSbS ⇒ aSb ⇒ abab. JAINchiNMay answered Oct 12, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.