1.

Which of the following languages is generated by the given grammar?S → aS | bS | ϵ

A. {anbm | n, m ≥ 0}
B. {w ∈ {a, b} * | w has equal number of a’s and b’s}
C. {an | n ≥ 0} ∪ { bn | n ≥ 0} ∪ {an bn | n ≥ 0}
D. (a + b}*
Answer» E.


Discussion

No Comment Found