title: Building Predictive Parser and parsing table
body: <p>I'm trying to build a parser for the following grammar (dragon book ex. 4.4.1 pg. 231):</p>
  
  <pre><code>S -&gt; 0 S 1 | 0 1
  </code></pre>
  
  <p>So first I left factored the grammar and got:</p>
  
  <pre><code>S  -&gt; 0 S'
  S' -&gt; S 1 | 1
  </code></pre>
  
  <p>And constructing the parsing table yielded:</p>
  
  <pre><code>     +-----------+---------+--------+
       |     0     |    1    |    $   |
  -----+-----------+---------+--------+
    S  | S -&gt; 0 S' |         |        |
  -----+-----------+---------+--------+
    S' | S' -&gt; S 1 | S' -&gt; 1 |        |
  -----+---------------------+--------+
  </code></pre>
  
  <p>Is it OK not to have any entries for the $ (end of the input) symbol?
  How is parsing performed by the predictive parser in that case?</p>