title: deciding whether the grammar is LR(0) or not
body: <p>I am new to the subject of compilation and have just started an exercise for Bottom -up parsing.</p>
  
  <p>I have stuck on the following problem.</p>
  
  <p>build a LR(0) parsing table for following grammar:</p>
  
  <pre><code>1) E –&gt; E + T
  2) E –&gt; T
  3) T –&gt; (E)
  4) T –&gt; id
  
  
  I0 :
  
     E' –&gt; .E
     E –&gt; .E + T
     E –&gt; .T
     T –&gt; .(E)
     T –&gt; .id
  </code></pre>
  
  <p>on E the next state in the DFA would be :</p>
  
  <pre><code> I1:
  
      E' -&gt; E.
      E  -&gt; E. + T
  </code></pre>
  
  <p>from what I have learned so far isn't this a S-R conflict?
  because the parser would not know whether to reduce or shift as it 
  has no look-ahead variable?
  so this should not be LR(0) grammar?</p>
  
  <p>but the PDF which I am reading have built the LR(0) table.
  So is there a mistake in the PDF or have I gone wrong some where understanding the concept?</p>