title: How to make a grammar LL(1)?
body: <p>I have this grammar that has to be transformed to LL(1) grammar:</p>
  
  <pre><code>S-&gt;A
  A-&gt;BC|DBC
  B-&gt;Bb|epsilon
  C-&gt;c|epsilon
  D-&gt;a|b|d
  </code></pre>
  
  <p>After applying left recursion and left factoring to it, I get the grammar as below:</p>
  
  <pre><code>S-&gt;A
  A-&gt;BCA'|epsilon
  A'-&gt;D | epsilon
  B-&gt;B'
  B'-&gt;bB'|epsilon
  C-&gt;c|epsilon
  D-&gt;a|b|d
  </code></pre>
  
  <p>But the grammar is still ambiguous. Have I done something wrong?</p>