Peter Linz Edition 4 Exercise 6.1 Question 12 (Page No. 162)

Question

Remove $λ$-productions from the grammar with productions $S\rightarrow aSb|SS|\lambda.$
What language does the resulting grammar generate?

Answer 1

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.