Predictive Top-Down Parsing MCQ

Test your knowledge with important Predictive Top-Down Parsing MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Predictive Top-Down Parsing MCQs at Bissoy

• What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production to parse a string with n tokens?
  ক

  n/2

  খ

  n-1

  গ

  2n-1

  ঘ

  2^n
• Which of the following pairs is the most powerful?
  ক

  SLR, LALR

  খ

  Canonical LR ,LALR

  গ

  SLR canonical LR

  ঘ

  LALR canonical LR
• In the context of abstract-syntax-tree and control-flow-graph. Which one of the following is true?
  ক

  In both AST and CFG if node N2 be the successor of node N1

  খ

  For any input program, neither AST nor CFG will contain a cycle

  গ

  The max number of successors of a node in an AST and a CFG depends on the input program

  ঘ

  None of the mentioned
• Which one of the following is true at any valid state in shift-reduce parsing?
  ক

  At the bottom we find the prefixes

  খ

  None of the mentioned

  গ

  Stack contains only viable prefixes

  ঘ

  Stack consists of viable prefixes