Question

A grammar is a 4-tuple G, G = (Ν, Σ, Π, Σ, S) where, Ν is a finite set of nonterminal symbols, Σ is a finite set of terminal symbols, Π is a finite set of rules,S is the starting symbol.

Let, Ν = {S, T}

Σ = {a, b, c}

Π = {

​S -> aTb

​S -> ab

​aT -> aaTb

​aT -> ac

} S is the starting symbol.

A) Prove that the given grammar G is a context sensitive grammar.

B) What is the language L = L(G) generated by the given grammar G?

C) For the string aaacbbb design the appropriate syntax tree based on the context sensitive grammar G.

D) The language L = L(G) generated by the given grammar G is also context free language. Write the context free grammar G1 that generates the language L.

E) For the string aaacbbb design the appropriate syntax tree based on the context free grammar G1.

Answer 1