CFG定义语言

Question

I need to generate a context free grammar for this language L= { a^ib^jc^k | i, j, k ≥ 0 , i = j or i = k }

what I already have is S : aSc | T | abS T : bT | cT | ԑ

Do you guys think that the above grammar can correctly define the language? if not, is there any better suggestion?

Answer 1

No, that grammar does not correctly define the language. It accepts "bc", for instance.