Chomsky Normal Form MCQ

Test your knowledge with important Chomsky Normal Form MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Chomsky Normal Form MCQs at Bissoy

• Let G be a grammar: S->AB|e, A->a, B->b Is the given grammar in CNF?
  ক

  Yes

  খ

  No
• Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be in ___________
  ক

  restricted form

  খ

  parsed form

  গ

  normal form

  ঘ

  all of the mentioned
• In which of the following, does the CNF conversion find its use?
  ক

  CYK Algorithm

  খ

  Bottom up parsing

  গ

  Preprocessing step in some algorithms

  ঘ

  All of the mentioned
• With reference to the process of conversion of a context free grammar to CNF, the number of variables to be introduced for the terminals are: S->ABa A->aab B->Ac
  ক

  3

  খ

  4

  গ

  2

  ঘ

  5
• Which of the following grammars are in Chomsky Normal Form:
  ক

  S->AB|BC|CD, A->0, B->1, C->2, D->3

  খ

  S->AB, S->BCA|0|1|2|3

  গ

  S->ABa, A->aab, B->Ac

  ঘ

  All of the mentioned
• Given grammar G: (1)S->AS (2)S->AAS (3)A->SA (4)A->aa Which of the following productions denies the format of Chomsky Normal Form?
  ক

  2,4

  খ

  1,3

  গ

  1, 2, 3, 4

  ঘ

  2, 3, 4
• Which of the production rule can be accepted by Chomsky grammar?
  ক

  A->BC

  খ

  A->a

  গ

  S->e

  ঘ

  All of the mentioned
• Every grammar in Chomsky Normal Form is:
  ক

  regular

  খ

  context sensitive

  গ

  context free

  ঘ

  all of the mentioned
• Which of the following does not have left recursions?
  ক

  Chomsky Normal Form

  খ

  Greibach Normal Form

  গ

  Backus Naur Form

  ঘ

  All of the mentioned
• The format: A->aB refers to which of the following?
  ক

  Chomsky Normal Form

  খ

  Greibach Normal Form

  গ

  Backus Naur Form

  ঘ

  None of the mentioned