LR parsers are attractive because _________
(a) It can be constructed to recognize CFG corresponding to almost all programming constructs
(b) It does not backtrack
(c) It can be constructed to recognize CFG corresponding to almost all programming constructs & It does not backtrack
(d) None of the mentioned
This question was posed to me in an internship interview.
I'd like to ask this question from Data Structure for Representing Parsing Table in division Bottom Up Parsing of Compiler