# What is the language L, generated by the grammar G?

Given the grammar $$G = (Ν, Σ, Π, S)$$, where $$Ν = \{S\}$$, $$Σ = \{0, 1\}$$, $$Π = \{S → ε, S → 0, S → 1, S → 0S0, S → 1S1\}$$, and $$S$$ is $$S$$. What is the language generated by the grammar?

• What did you try? Where did you get stuck? We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question. – dkaeae Mar 13 at 16:26
• Hint, can you generate at least 10 words? What is the pattern? 20 words? even more? If you are still stuck, edit the question to show all the words you have generated. – Apass.Jack Mar 13 at 17:58