Let L be the language of all strings on [0,1] ending with 1.
Let X be the language generated by the grammar G.
$S \rightarrow 0S/1A/ \epsilon $
$A \rightarrow 1S/0A$
Then $L \cup X= $
- ∅
- ∑*
- L
- X
Ans given : B. ∑*
They said that X is a language which contains all strings that do not end with 1. But is it so?
Can’t we generate 11 from the grammar?
Please verify.