title: Step by step elimination of this indirect left recursion
body: <p>I've seen <a href="http://en.wikipedia.org/wiki/Left_recursion" rel="noreferrer">this algorithm</a> one should be able to use to remove all left recursion.
  Yet I'm running into problems with this particular grammar:</p>
  
  <pre><code>A -&gt; Cd
  B -&gt; Ce
  C -&gt; A | B | f
  </code></pre>
  
  <p>Whatever I try I end up in loops or with a grammar that is still indirect left recursive.</p>
  
  <p>What are the steps to properly implement <a href="http://en.wikipedia.org/wiki/Left_recursion" rel="noreferrer">this algorithm</a> on this grammar?</p>