Statement:
(a) For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with another production without the A.
(b) State true or false:
(c) true
(d) false
The question was posed to me in my homework.
This intriguing question originated from Eliminating Epsilon Productions in section Properties of Context Free Languages of Automata Theory