Enter your question hereContext Free Language Let L = {a^ i b^j c^i +j| i ≥ 0, j ≥ 0}. a) Give a CFG G that generates L

cfg-gnf-pda

#1

Enter your question here Context Free Language Let L = {a^ i b^j c^i +j| i ≥ 0, j ≥ 0}. a) Give a CFG G that generates L. b) Put G into an equivalent GNF. c) Give a PDA that accepts L.

Answer:

Grammar(EPS stands for epsilon):
S : aSc | B
B : bBc | EPS
PDA is difficult to draw here, you can follow the standard procedure to convert the aboce grammmar.