Consider the following grammar:

S → 0A|0BB

A → 00A|λ

B → 1B|11C

C → B

Which language does this grammar generate?

Given grammar is generating string of type: {0, 000, 00000,0000000…...}

1) L((00) * 0 + (11) * 1)

This language generating string with combination of 0’s and 1’s. But given grammar is not generating any string composed of 1’s.

2) L(0(11) * + 1(00) * )

This language is not generating string which contains three 0’s together. Also, it is generating strings which contains 1 in it. So, it is not correct option.

3) L((00) * 0)

It is generating strings of type: {0, 0³, 0⁵, 0⁷,.}. These set of strings is similar to the one generating from given grammar. So, this language is generated by given grammar.

4) L(0(11) * 1)

It is incorrect because it is generating strings which contains 1 which is not the case with given grammar.