title: Repetitions Grammar parsing S -> ( E ';' )+
body: <p>I know how to parse grammars like this:</p>
  
  <pre class="lang-grammar prettyprint-override"><code>E -&gt; E '*' E
  E -&gt; E '+' E
  E -&gt; N
  N -&gt; '0'
  N -&gt; '1'
  </code></pre>
  
  <p>But what if I have the following example grammar (with a "regex repitition"):</p>
  
  <pre class="lang-grammar prettyprint-override"><code>E -&gt; 'e'
  S -&gt; ( E ';' )+ // '+' used like in regexes
  </code></pre>
  
  <p>How can i parse such grammars with LR(k) (or some other parsing algorythm) and build a tree?</p>