[] Compiler theory construction produces the following languages context-free grammar, one each:

13. The configuration produces the following context-free grammar language each one:

(1) (aⁿ b^m c^2m | n,m≥0 }

S->AB
A->ε|aA
B->ε|bBcc

(2) w c w^R| w∈{a,b}* }

S->aSa
S->bSb
S->c

(. 3) {A ^m B ^n- C ^K | = n-m or n = k}

S->aSb|bSc|ε

学如逆水行舟，不进则退