Which of the following is true for shift reduce parsers?
(a) Scans and parses the input in one forward pass over the text, without any backup.
(b) A shift command advances in the input stream by one symbol
(c) LALR parser
(d) All of the mentioned
I have been asked this question during an interview.
My doubt stems from Applications in division Context Free Grammars and Languages of Automata Theory