Open srhickma opened 6 years ago
Right recursion runs in quadratic time with the Earley parser on grammars that can be parsed in linear time by LR(k) parsers. Ideally we should optimize the parser, but for the time being, grammars should be rewritten to use left-recursion instead.
Take a look at: http://loup-vaillant.fr/tutorials/earley-parsing/right-recursion https://github.com/jeffreykegler/kollos/blob/master/notes/misc/leo2.md
The urgency of this has been dwarfed by other improvements in #12, and this should be moved to the backlog.
Right recursion runs in quadratic time with the Earley parser on grammars that can be parsed in linear time by LR(k) parsers. Ideally we should optimize the parser, but for the time being, grammars should be rewritten to use left-recursion instead.
Take a look at: http://loup-vaillant.fr/tutorials/earley-parsing/right-recursion https://github.com/jeffreykegler/kollos/blob/master/notes/misc/leo2.md