Answer is B
There is nothing like RL(1) parsing. We have LR(1) parsing algorithm. Where L stands for left-to-right scanning of the input string and R signifies that we will get a rightmost derivation.
LALR and LR are bottom-up parsers, so A and C are true.
D is also true.