Removing left recursion with terminals only I have a grammar:
$G → id &gt; id$
   $| id &lt; id$
   $| G and id$
Does anybody know how I can do left recursive elimination on this one, when it doesn't have any extra non terminals?
You'll need to introduce a new non-terminal to factor this, like:
$\begin{align*}
   G &amp;\to id A \\
   A &amp;\to &lt; id \mid &gt; id
\end{align*}$
Then you'll need to get rid of the left recursion.