in Theory of Computation
603 views
0 votes
0 votes

Can I give any grammer for the language L = { anbncn / n>=1}  Like this----

in Theory of Computation
603 views

3 Comments

S-AB

 aAbB

aaAbbB

aaabbbB

aaabbbc

So ,no
1
1
No, you can not give grammar in such a manner.

Because the grammar you have witten is a CFG and the language for which your are trying to write the grammar is not a CFL.

The grammar for this language will be a Type 1 grammar as this language belong to the class of CSL.

Below given is the Grammar for this

S->abc|A

A->aABc|abc

cB->Bc

bB->bb
0
0
It can also generate abccccc or aabbc
0
0

1 Answer

0 votes
0 votes
Best answer
The given language is csl and giving grammar for csl language is tough
selected by

Related questions

1 vote
1 vote
1 answer
3