An LR parser is a bottom-up parser for context-free grammars that efficiently handles deterministic languages by reading input from left to right and producing a rightmost derivation in reverse. It is widely used in compilers due to its ability to handle a large class of grammars with high performance and error detection capabilities.