title: Rules to convert a CFG to a NDPA?
body: <p>I have to define an FA by using this grammar:</p>
  
  <pre><code>S -&gt; aSb
  S -&gt; c
  S -&gt; dA
  A -&gt; Sd
  </code></pre>
  
  <p>How do I manage the first rule and the last one?
  For the second one I think I have to create another state (the final one) and link S and this new state. For the third one instead, I think I have to create the state "A" and link it to S by passing "d".</p>