Question

Give a counter example to show that the following construction fails to prove that the class of context-free languages is closed under star. Let A be a CFL $\mathrm{G}=(\mathrm{V},\sum ,R,S)$that is generated by the CFG . Add the new rule $\mathrm{S}\to \mathrm{SS}$and call the resulting grammar. This grammar is supposed to generate A* .

Short answer

The construction fails for $L=\left\{a\right\}$

Step-by-step solution

Define Context Free Language

The context free language is generated by context free grammar. These languages are accepted by Pushdown Automata. These are the superset of regular languages.

Consider context-free languages $L_1$described as $G_1=(V_{1\text{'}}S,R_{1\text{'}}{S}_1)$

Consider context-free language $L_2$described as $G_2=(V_{2\text{'}}S,R_{2\text{'}}{S}_2)$

Determine the counter example

Consider the language $L=\left\{a\right\}$

The given grammar and the language is in context free grammar in the form of .$\mathrm{G}=(\mathrm{V},\underset{}{\sum ,}\mathrm{R},\mathrm{S})$

Note that $L*=\{t,a,aa,aa{a}_{},\dots \}$

A grammar of $LisG=(\{S\},\{a\},\{(S\to a)\},S)$

The construction gives: $G\text{'}=(\{S\},\{a\},\{(S\to a),(S\to SS)\},S)$

However, $\mathrm{\{}L\left(\mathrm{G}\right)$does not contain ε so the construction doesn’t produce a grammar for L*.

Hence, the construction fails for L = {a}