1 votes 1 votes Show that the grammar $G$ =({$S$}, {$a, b$}$, S, P$), with productions $S \rightarrow SS|SSS|aSb|bSa|λ$ , is equivalent to the grammar $S \rightarrow SS$ , $S \rightarrow λ$ , $S \rightarrow aSb$ , $S \rightarrow bSa$ . Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar + – Naveen Kumar 3 asked Mar 19, 2019 Naveen Kumar 3 347 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Both grammar gives equal number of a's and equal number of b's. abhishekmehta4u answered Mar 19, 2019 • selected Mar 19, 2019 by Naveen Kumar 3 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.