Provide a context-free grammar that generates the following language over
Σ = {0,1}: {w = 0*1* : |w| is odd}
My Solution:
S->AB|0|1
A->0A|^
B->1B|^
But using this grammar we are able to create an even number of string.
I want grammar that produces L = {0,1,000,111,001,011,00000,11111,00001,00011....}