title: How to show grammar is not LL(1) and convert grammar to LL(1)
body: <p>I'm trying to find the ambiguity in this grammar so I can remove it and convert it to LL(1), however for the life of me I can't find the ambiguity. Any help will be much appreciated.</p>
  
  <pre><code>D -&gt; if (C) {S} | if (C) {S} else {S}
  S -&gt; D | SA | A
  A -&gt; V = T;
  V -&gt; x | y
  T -&gt; 1 | 2
  C -&gt; true | false
  </code></pre>