A lookahead LR parser (LALR) generator is a software tool that reads a context-free grammar (CFG) and creates an LALR parser which is capable of parsing files written in the context-free language defined by the CFG.
Frank DeRemer invented LALR parsers with his PhD dissertation, called "Practical LR(k) Translators", in 1969, at MIT.
See Comparison of deterministic context-free language parser generators for a more detailed list.
Full LR involves much larger parse tables and is avoided unless clearly needed for some particular computer language.
This is why SLR has less language recognition power than LALR with Canonical LR being stronger than both since it does not include any simplifications.