Paper Tayyari

Lecture 32: Trees

MCQs, short and long questions from lecture 32.Lecture 32 ki MCQs, short aur long sawal.

6 MCQs · 1 short question · 6 MCQs from past papers6 MCQs · 1 short sawal · 6 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/6
– correctsahi
1.
★ Final term Spring 2007

Syntax tree or Generation tree or Derivation tree are same tree

  1. ATrue
  2. BFalse

These are three names for the same tree that shows a derivation.

2.
★ Final term Spring 2005

A Total Language Tree has

  1. AAll languages over Σ
  2. BAll strings over Σ
  3. CAll words of all languages over Σ
  4. DAll words of one language over Σ

The total language tree of a CFG shows every derivation, so its leaves are all words of that one language.

3.
★ Final term past paper

The …………. is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree .

  1. ACFL
  2. BCFG
  3. CGTG
  4. DNone of the given

Ambiguity is a property of a CFG.

4.
★ Final term past paper

The CFG is said to be ambiguous if there exists atleast one word of its language that can be generated by the different production trees,

  1. ATRUE
  2. BFALSE

That is the definition of ambiguity.

5.
★ Final term past paper

Consider the following CFG S→aS|bS|aaS|Λ it can be observed that the word aaa can be derived from more than:

  1. Aone production tree
  2. Btwo producton tree
  3. CTotal language tree
  4. DAll of above

aaa has several trees (a·a·a, aa·a, a·aa), so it has more than one production tree.

6.
★ Final term past paper

Any word generated by given CFG cannot also be expressed by Syntax tree or Generation tree or Derivation tree as well

  1. Atrue
  2. Bfalse

Every derivation can be drawn as a tree.