title: Understand whether a grammar is LR(1) with no parsing table
body: <p>I've found out an exercise that require a trick to understand whether a grammar is LR(1) with no parsing table operations.</p>
  
  <p>The grammar is the followed:</p>
  
  <pre><code>S -&gt; Aa | Bb
  A -&gt; aAb | ab
  B -&gt; aBbb | abb
  </code></pre>
  
  <p>Do you know what is the trick behind?</p>
  
  <p>Thanks, :)</p>