Inferences to Trees, Trees to Derivations MCQ

Test your knowledge with important Inferences to Trees, Trees to Derivations MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30+ more Inferences to Trees, Trees to Derivations MCQs on Bissoy. Bissoy App

• Is the given statement correct? Statement: The mere existence of several derivations is not an issue, its is the existence of several parse trees that ruins a grammar.
  ক

  Yes

  খ

  No
• Choose the correct option: Statement: Unambiguity is the ideal structure of a language.
  ক

  true

  খ

  partially true

  গ

  false

  ঘ

  cant be said
• Which of the following are distinct to parse trees?
  ক

  abstract parse trees

  খ

  sentence diagrams

  গ

  both abstract parse trees and sentence diagrams

  ঘ

  none of the mentioned
• If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the ________ structure of w.
  ক

  semantic

  খ

  syntactic

  গ

  lexical

  ঘ

  all of the mentioned
• If |w|>=2h, then its parse tree’s height is at least _____
  ক

  h

  খ

  h+1

  গ

  h-1

  ঘ

  2h
• State true or false: Statement: A CNF parse tree’s string yield (w) can no longer be 2h-1.
  ক

  true

  খ

  false
• Given Checklist: i) G has no useless symbols ii) G has no unit productions iii) G has no epsilon productions iv) Normal form for production is violated Is it possible for the grammar G to be in CNF with the following checklist?
  ক

  Yes

  খ

  No
• Which of the following is false for a grammar G in Chomsky Normal Form:
  ক

  G has no useless symbols

  খ

  G has no unit productions

  গ

  G has no epsilon productions

  ঘ

  None of the mentioned
• A symbol X is called to be useful if and only if its is:
  ক

  generating

  খ

  reachable

  গ

  both generating and reachable

  ঘ

  none of the mentioned
• A symbol X is ________ if there exists : S->* aXb
  ক

  reachable

  খ

  generating

  গ

  context free

  ঘ

  none of the mentioned