title: Parse balanced parentheses CNF
body: <p>I have a grammar <code>S -&gt; (S)S | empty</code></p>
  
  <p>I converted it to a Chomsky Normal Form like this</p>
  
  <pre><code>S -&gt; AS | empty
  A -&gt; LB
  B -&gt; SR
  L -&gt; (
  R -&gt; )
  </code></pre>
  
  <p>I'm not sure if I converted it correctly, but how do I parse this input ()() using the CNF</p>