Let ∑={0,1}* and the grammar G be: S->ε S->SS S->0S1|1S0 State which of the following is true for the given
Posted: Thu Jul 14, 2022 9:24 am
a) Language of all and only Balanced strings
b) It contains equal number of 0’s and 1’s
c) Ambiguous Grammar
d) All of the mentioned
b) It contains equal number of 0’s and 1’s
c) Ambiguous Grammar
d) All of the mentioned