Bissoy.com
Doctors Medicines MCQs Q&A

Which one of the following is a top-down parser ?

Which one of the following is a top-down parser ? Correct Answer Recursive descent parser

The correct answer is option 1

Key Points

  • A top-down parsing technique parses the input by starts constructing a parse tree from the root node moving down to the leaf nodes.
  • A top-down parser uses the leftmost derivation to generate the string. 
  • A recursive descent parser is a top-down parser

Important Points

 Parser

 Derivation

 LR parsers or Bottom-up Parsers 

 Rightmost reverse Derivation 

 LL parsers or Top-down Parsers

 Leftmost Derivation

Related Questions

Which of the following statements is/are correct? A. SLR parser is more powerful than LALR parser. B. Canonical LR parser is more powerful than LALR parser. C. LALR parser is more powerful than Canonical LR parser.
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is true?
Which of the following statements are TRUE? I. Top-down parsers are equipped to handle left recursive grammar. II. LALR parser is more powerful than an SLR parser. III. Recursive descent parsing is an example of top-down parsing.
Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.
Consider the following statements. S1 : Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1). S2 : For any context-free grammar, there is a parser that takes at most O(n3) time to parse a string of length n. Which one of the following option is correct?
Which one of the following is a top-down parser?
User level threads are threads that are visible to the programmer and are unknown to the kernel. The operating system kernel supports and manages kernel level threads. Three different types of models relate user and kernel level threads. Which of the following statements is/are true ? (a) (i) The Many - to - one model maps many user threads to one kernel thread (ii) The one - to - one model maps one user thread to one kernel thread (iii) The many - to - many model maps many user threads to smaller or equal kernel threads (b) (i) Many - to - one model maps many kernel threads to one user thread (ii) One - to - one model maps one kernel thread to one user thread (iii) Many - to- many model maps many kernel threads to smaller or equal user threads
Consider the following two sets of LR(1) items of an LR(1) grammar. X → c.X, c/d           X → c.X, $ X → .cX, c/d           X → .cX, $ X → .x, c/d             X → .d, $ Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE? 1. Cannot be merged since look aheads are different. 2. Can be merged but will result in S-R conflict. 3. Can be merged but will result in R-R conflict. 4. Cannot be merged since goto on c will lead to two different sets.
Which of the following is the fastest JavaScript parser?
Which of the following encoding an XML parser assumes ?