Bottom-up parsers construct the parse tree from the leaves and work their way up to the root. They use the Shift-Reduce method, which involves shifting input symbols onto a stack and reducing them to non-terminals based on grammar rules. LR parsers (including SLR, LALR, and canonical LR parsers) are common examples of bottom-up parsers that use this method.