Discrete Structure - Old Questions

18. Let G be the grammar with vocabulary V = {S, 0,1} , set of terminals T = {0,1} , starting symbol S, and

productions P = {S → 11S, S → 0}. What is L(G), the language of this grammar?

8 marks | Asked in 2065