title: Grammar transformation for recursive descent
body: <p>I am trying to transform a given grammar in order to be ready for recursive descent. The rules I end up are: </p>
  
  <pre><code>SEQ --&gt; constSEQ | operZ     
  Z --&gt; exprX | operX   
  Y --&gt; exprX | operX   
  X --&gt; expr | exproperX | ε  .
  </code></pre>
  
  <p>What am I supposed to do with Z and Y that are the same?</p>
  
  <p>Is any of them eliminated?</p>