title: Needed example of LR(1) grammar that is not LR(0)?
body: <p>Anyone would give me an processed example of LR(1) grammar which is not LR(0) Grammar? I was just trying to find out why LR(1) parser   is more efficient and powerful, and tried an example of grammar and found it non LR(0) ,there was conflict in parsing table,then tried LR(1) also no use...
   A very simple example of grammar ,(augmented)</p>
  
  <pre><code>S-&gt;A
  A-&gt;aBed | aEef
  B-&gt;m
  E-&gt;m
  </code></pre>
  
  <p>Needed details analysis.
  Anyone would explain with examples? Getting confused here.</p>