Implementation of left-recursion elimination and epsilon handling

Question

I have the following grammar (other rules above and below eliminated):

expression = (expression, ("+" | "-"), term) | term ;
term = (term, (&q