title: Converting a Context-Free Grammar to a PDA
body: <p>I am attempting to convert the following CFG to a pushdown automaton:</p>
  
  <pre><code>S → AS | A
  A → 0A | 1B | 1
  B → 0B | 0
  </code></pre>
  
  <p>I'm not really sure how to approach this problem, or the problem of CFG->PDA in general.</p>