Re: Are Google summer of code 2006 ideas still available?

[Ramón García]

> As for the "Burke-Fisher Error Correction", error recovery is poor in
> Bison because the LALR(1) algorithm may, when an error token appears
> in the input, performed some reductions before the error is reported.

Perhaps I am wrong, but I think that these wrong reductions also
exists when using efficient (non cannonical) LR(1) implementations.
What they do is to apply the LALR(1) simplifications, but only when no
ambiguity is added. In particular, if a grammar is LALR(1), the
efficient LR(1) performs exactly the same shits and reductions.

Would you consider an application for a grant for implementing the
Burke-Fisher error correction? Would it be useful to offer the choice
of cannonical LR(1)?