0 votes 0 votes Can I give any grammer for the language L = { anbncn / n>=1} Like this---- Theory of Computation theory-of-computation grammar + – mrinmoyh asked Feb 1, 2018 mrinmoyh 608 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Ajay Jadhav commented Feb 1, 2018 reply Follow Share S-AB aAbB aaAbbB aaabbbB aaabbbc So ,no 1 votes 1 votes Shashank Mishra commented Feb 2, 2018 reply Follow Share 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 votes 0 votes Tesla! commented Feb 2, 2018 reply Follow Share It can also generate abccccc or aabbc 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes The given language is csl and giving grammar for csl language is tough rajatmyname answered Feb 1, 2018 • selected Feb 2, 2018 by mrinmoyh rajatmyname comment Share Follow See all 0 reply Please log in or register to add a comment.
