title: What is the closure of a left-recursive LR(0) item with epsilon transitions?
body: <p>Let's say I have this grammar:</p>
  
  <pre><code>A: ε
   | B 'a'
  B: ε
   | B 'b'
  </code></pre>
  
  <p>What is considered to be the closure of the item <code>A: • B 'a'</code>?<br>
  In other words, how do I deal with the epsilon transitions when figuring out closures?</p>