'Design grammar for the following language over {0, 1} L={ a^n b^m c^m d^2n | n>=0; m >0 }

I am searching for the grammar for the language - L={ a^n b^m c^m d^2n | n>=0; m >0 }
I have tried this but I think this is wrong

R-> aSbPcQ, P
S->aS,epsilon
P->bPc,epsilon
Q->Qdd,epsilon

please provide the correct solution, thanks.

grammarcontext-free-grammarautomatacontext-free-language


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions