CFG to PDA You are given the CFG G = ({S,T, F,N}, {0,1, +,*, (,)}, R, S} with these rules R. S + S +TT T + T * F| F F (S) N N ON | 1N |0|1 Alphabet: {0, 1, +, *, (,)} Stack alphabet (the first symbol is the initial one): {$, S, T, F, N, O, 1, +, *, (, )} Follow the CFG to PDA procedure to produce a PDA recognizing L(G). Draw PDA. o o Use as few states and nonterminals as possible