Question

Construct a context-free grammar for the language L={ ab^n ab^n a | n> 1}.

Answer 1

Solution:-

Context-free grammar for the language L={ ab^n ab^n a | n> 1} can be denoted by G.

G: ({S,X,Y,Z} , {a,b} , S , P)

Here P is the production defined as

$S \rightarrow Za$

$Z \rightarrow XX$

$X \rightarrow aY$

$Y \rightarrow bb | bY$