Bottom-up parsers construct derivations by reducing strings to the start symbol. They generate rightmost derivations in reverse order because they work from the leaves (terminals) upward toward the root (start symbol), effectively undoing a rightmost derivation step by step.