Question

Give a brief description of the language generated by the following production rules.

S → abc

S → aXbc

Xb → bX

Xc → Y bcc

aY → aa

aY → aaX

bY → Y b

aY → aa aY → aaX

Answer 1

The given grammar accepts the language

L={aⁿbⁿcⁿ | nE N}

in this we can generate any number of a's and b's and c's.

In this grammar right side symbols are increasing and is never less than the left side symbols so it is context sensitive language.

Because it satisifies the length increasing property.

It is not context free grammar because the symbols on the left side is longer than single non terminals.

so this is a context free grammar which generates the language that contains any number of a's and b's and c's.

THANK YOU