Give a context-free grammar for the following language L = {a n b n+mc m : n ≥ 0, m ≥ 0}.

Community Answer

Honor CodeSolved 1 Answer

See More Answers for FREE

Enhance your learning with StudyX

Receive support from our dedicated community users and experts

See up to 20 answers per week for free

Experience reliable customer service

Get Started

Q> the context free grammar of the language L={a^nb^n+mc^m m>=0 and n>=0}   the language in format if m=2 and n=2then Lang usage string aabbbbcc and if m=0 and n=0 then language contain the epsilon   The grammar generated by the language is   1>A->abA| abB | ab| epsilon   2>B->bBc | bc | epsilon   Example 1>   A->abB (put B->bBc)   A- >abbBc(put B->bBc)   A->abbbBcc(put B->bBc) A->abbbbBccc(putB->epsilon) A->abbbbBccc(if n=1 and m=3 then m+n=4)                           Edit answer   Add comment ...