Context Free Grammar
Q1. Remover the useless productions from given grammar
S -> abS | abA | abB
A -> cd
B -> aB
C -> dc
Q2: Remove Unit Production from given grammar
S -> Aa | B
A -> b | B
B -> A | a
Q3. Remove the Null production from given grammar
S -> ABCd
A -> BC
B -> bB | λ
C -> cC | λ
Q4. Convert the given CFG to CNF.
S → a | aA | B
A → aBB | ε
B → Aa | b
Pushdown Automata
Q1. Design a PDA which accepting the language
L = {WcWR | W ∈ (a,b)*}.
Q2. Design a PDA which accepting L={0n+11n|n>0}.
Q3. NPDA for accepting the language L = {an bm cn | m, n>=1}
Q4. Construct Pushdown automata for L = {0n1m2m3n | m, n ≥ 0}
