Question

Given a grammar G, G = (Ν, Σ, Π, S), where

Ν = { ... }

Σ = { ... }

Π = { ... }

S is ...

What is the language L, L = L(G) ?

Answer 1

As grammar G is given G = (Ν, Σ, Π, S), where Ν = {S} and Σ = {0, 1} so using this Π = {S → ε, S → 0, S → 1, S → 0S0, S → 1S1} we evaluate a language L by putting non-terminal value and generating new strings that can be a part of language L and accepted by the grammar rule: so L={ ε, 0 , 1, 00,11,000,111,010,101,0000,1111,00100,00000,11111,11011,....} so on and so forth. we will just evaluate a non-terminal with a terminal value and get a resultant string.