Question

Which of these is true about LR parsing?

(a) Is most general non-backtracking shift-reduce parsing

(b) It is still efficient

(c) Is most general non-backtracking shift-reduce parsing & It is still efficient

(d) None of the mentioned

I got this question in class test.

This intriguing question originated from LR Parser in section Bottom Up Parsing of Compiler

Answer 1

Right answer is (c) Is most general non-backtracking shift-reduce parsing & It is still efficient

Easy explanation: LR parsers are a type of bottom-up parsers that efficiently handle deterministic context-free languages in guaranteed linear time.