Other useful parsers to teach would be SLR (aka LR(0)), which would fit the library.
Another one that might be out of scope but also really useful to implement is the LL parser, it should be pretty easy to make, not handling left recursion obviously, that's left to the creator of the grammar.
This would complete all the parsers seen in compilers architecture lectures in universities: LL, LR(0), LR(1), LALR
Other useful parsers to teach would be SLR (aka LR(0)), which would fit the library.
Another one that might be out of scope but also really useful to implement is the LL parser, it should be pretty easy to make, not handling left recursion obviously, that's left to the creator of the grammar.
This would complete all the parsers seen in compilers architecture lectures in universities: LL, LR(0), LR(1), LALR