Which of the following parser reaches the root symbol of the tree at last?
(a) Top down parser
(b) Bottom up parser
(c) TOP down and Bottom up parser
(d) None of the mentioned
I have been asked this question in an interview for internship.
The query is from Applications in chapter Context Free Grammars and Languages of Automata Theory