If we convert the context-free grammar G:

S AS | A A 0A | 1B | 1 B 0B | 0

to a pushdown automaton that accepts L(G) by empty stack, which of the following would be a rule of the PDA?

a)(q,0,0) = {(q,)} b)(q,,B) = {(q,0B)} c)(q,,S) = {(q,AS)} d)(q,,A) = {(q,1)}