91Ó°ÊÓ

Context free language is a grammar where its language or string that formed by context free grammar is supports pushdown deterministic automata.

A variable$A$in Context free language$\mathrm{G}$is usable if it appears in some derivation of some string $\mathrm{w}∈\mathrm{G}$. And a Context free grammar$\mathrm{G}$and a variable $\mathrm{A}$,

The given grammar isambiguous context free grammar because the language and the string are formed bythe given context free grammar there exist more than one left most derivation or more than one right most derivation or more than one parse tree is called ambiguous grammar.

$\begin{array}{l}\mathrm{S}→\mathrm{SS}|\mathrm{T}\\ \mathrm{T}→\mathrm{aTb}|\mathrm{ab}\end{array}$

The LHS derivation of the given grammar,

$\begin{array}{l}\mathrm{S}→\mathrm{SS}|\mathrm{T}\\ \begin{array}{l}\mathrm{S}→\mathrm{SS}\\ \mathrm{S}→\mathrm{TS}\\ \mathrm{S}→\mathrm{aTbS}\\ \end{array}\end{array}$

$\begin{array}{l}\mathrm{S}→\mathrm{aTbS}\\ \mathrm{S}→\mathrm{aabbS}\\ \mathrm{S}→\mathrm{aabbT}\\ \mathrm{S}→\mathrm{aabbab}\end{array}$

The RHS derivation of the given grammar,

$\begin{array}{l}\mathrm{S}→\mathrm{SS}|\mathrm{T}\\ \begin{array}{l}\mathrm{S}→\mathrm{SS}\\ \mathrm{S}→\mathrm{ST}\\ \mathrm{S}→\mathrm{Sab}\\ \end{array}\end{array}$

$\begin{array}{l}\mathrm{S}→\mathrm{Sab}\\ \mathrm{S}→\mathrm{Tab}\\ \mathrm{S}→\mathrm{aTbab}\\ \mathrm{S}→\mathrm{aabbab}\end{array}$

From both the derivation from LHS or RHS the derivation evaluated is same hence, this grammar is ambiguous context free grammar.

Hence, this grammar of context free grammar is usable and this problem is decidable.