The general algorithm to remove the left recursion follows. Several improvements to this method have been made. For each rule of the form

A A a₁ | A a₂ | ... | A a _m | β ₁ |β ₂ | .. |β _n

Where:

. A is a left-recursive non-terminal.

. a is a sequence of non-terminals and terminals that is not null ( a≠ε ).

. ß is a sequence of non-terminals and terminals that does not start with A .

Replace the A-production by the production:

A β ₁ A' | β₂ A' | ...| β_n A'

And create a new non-terminal

A' a₁ A' | a₂ A' |...| a_m A' | ε

This newly created symbol is often called the "tail", or the "rest".