Eliminate direct left recursion for a given grammar. For example: Remove the left recursion

from the following set of rules.

$EE+T|T$

$TF$

$Fid$

Eliminate indirect left recursion for a given grammar. For example: Remove the left recursion

from the following set of rules:

$E->E+T|E+(T)|T$

$TF|F+(id)|E$

$Fid$

Eliminate backtracking for a given grammar. For example: Eliminate backtracking from the

following set of rules:

$E->E+T|E+(T)|T$

$TF|F+(id)|E$

$Fid$