0 votes 0 votes Remove $λ$-productions from the grammar with productions $S\rightarrow aSb|SS|\lambda.$ What language does the resulting grammar generate? Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 15, 2019 Naveen Kumar 3 249 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The language generated by the above grammar contains the string Epsilon. So you can not remove the Epsilon production from the start symbol S. The grammar will remain same even after removing the Epsilon production. PRANAB NANDY answered Apr 17, 2019 PRANAB NANDY comment Share Follow See all 0 reply Please log in or register to add a comment.