CS402 Quiz 4 by VU Topper RM

Consider the following CFG: S->a|Xb|aYa X->Y|^ (NOTE: ^ means NULL) Y->b|X Which Non-terminals are nullable?

A. X

B. Y C. Z D. S,X and Y

The CFG S--> aSa | bSb | a | b | ^ represents ___________ language.

A. EQUAL

B. ODD-ODD C. EVEN-EVEN D. PALINDROME

The structure given below is called _________ S -> aaBm A -> Asia B -> sub A. RE B. TG

C. CFG

D. PDA

One language can have ______ CFG(s). A. Only one B. At most one C. At least one

D. More than one

Consider the Following CFG: (NOTE: ^ means NULL) S-Xa XaX|bX|^ Above give a CFG can be represented by RE

A. a*b*a

B. a*b* C. (a+b)*a D. a(a+b)*a

The tree which produces all the strings of a language is called

A. Derivation tree B. Ambiguous tree

C. Total language tree Page 96

D. Non ambiguous tree

The language of all strings partition ∑* into ___________ class(es).

A. Two

B. Five C. Four D. Three

There is at least one production in CFG that has one _________ on its left side. A. Terminal

B. Non terminal Page 87

C. Unit production D. Null production

The CFG that generates the regular language is called _______. A. finite automata B. regular expression

C. regular grammar Google

D. non-regular grammar

Prime is a ______________ language. A. Finite

B. Regular Page 75

C. Non-regular D. Both context free and regular

Which of the following cannot be represented by a regular expression?

1. Language of odd-odd
2. Language of even-even
3. String of 0’s with an odd length
4. String of 0’s with a prime length

Correct answer: String of 0’s with a prime length

"CFG" stands for __________________. A. Context Free Graph B. Context Finite Graph

C. Context Free Grammar Page 87

D. Context Finite Grammar

In pref(Q in R), Q is _______ to/than R. A. Equal B. Smaller C. Greater

D. Not equal Page 79

The operators like (* , +) in the parse tree are considered as ________.

A. Terminals Page 93

B. Productions C. Intermediates D. non-terminals