A. Bottom-up parser.
An operator-precedence parser is a simple shift-reduce parser that is capable of parsing a subset of $\text{LR(1)}$ grammars. More precisely, the operator-precedence parser can parse all $\text{LR(1)}$ grammars where two consecutive non-terminals and epsilon never appear in the right-hand side of any rule.