1 votes 1 votes Are the two grammars with respective productions $S \rightarrow aSb|ab|λ$, and $S \rightarrow aAb|ab$, $A \rightarrow aAb|λ$, equivalent? Assume that $S$ is the start symbol in both cases. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar + – Naveen Kumar 3 asked Mar 19, 2019 Naveen Kumar 3 717 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 2nd Grammar doses not give null string. So both are not equvelent abhishekmehta4u answered Mar 19, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.