DPDA and Ambiguous Grammars MCQ

Test your knowledge with important DPDA and Ambiguous Grammars MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more DPDA and Ambiguous Grammars MCQs on Bissoy. Bissoy App

• L->rLt|tLr|t|r The given grammar produces a language which is:
  ক

  All palindrome

  খ

  All even palindromes

  গ

  All odd palindromes

  ঘ

  Strings with same begin and end symbols
• Which of the following are context free language?
  ক

  L={aibi|i>=0}

  খ

  L={wwr| w is a string and r represents reverse}

  গ

  All of the mentioned

  ঘ

  one of the mentioned
• Which of the following are non essential while simplifying a grammar?
  ক

  Removal of useless symbols

  খ

  Removal of unit productions

  গ

  Removal of null production

  ঘ

  None of the mentioned
• Statement 1: Ambiguity is the property of grammar but not the language. Statement 2: Same language can have more than one grammar. Which of the following options are correct with respect to the given statements?
  ক

  Statement 1 is true but statement 2 is false

  খ

  Statement 1 is false but statement 2 is true

  গ

  Both the statements are true

  ঘ

  Both the statements are false
• Let G=(V, T, P, S) where a production can be written as: S->aAS|a A->SbA|ba|SS Which of the following string is produced by the grammar?
  ক

  aabbaab

  খ

  aabbaa

  গ

  baabab

  ঘ

  None of the mentioned
• Which among the following is incorrect with reference to a derivation tree?
  ক

  Every vertex has a label which is a terminal or a variable.

  খ

  The root has a label which can be a terminal.

  গ

  The label of the internal vertex is a variable.

  ঘ

  None of the mentioned
• CFGs are more powerful than:
  ক

  DFA

  খ

  NDFA

  গ

  Mealy Machine

  ঘ

  All of the mentioned