title: Removing Cyclic Recursion from a Context Free Grammar
body: <p>I'm trying to solve the problem to write this CFG into an LL(1) parse table.  However, the problem is that it has cyclic left recursion between L/A and I can't find any resources that explain how to do this.</p>
  
  <p>Here is the CFG in question:</p>
  
  <pre><code>L -&gt; Aa | Bb
  A -&gt; La | aa
  B -&gt; bBb | ba
  </code></pre>
  
  <p>Can anyone help explain how to remove this cycle from the grammar?  Thanks!</p>