$L(G)=\{a^i{b}^j{c}^k|i,j,k0,$ and $i=jori=k\}$

$G=(NT,T,S,P)$ with set of variables $NT=\{S,W,x,Y,Z\},$ where $S$ is the start variable; set of terminals $T=\{a,b,c\}$; and the production rules:

$SxY|W$

$x$axb$|$

$YcY|$

$W$aWc$|Z$

$ZbZ|$

Parse the following string $($aabcc$)$ and show the parse tree using the CFG

Convert the CFG to a PDA

Parse the following sting $($aabbc$)$ using the PDA