# Practice Test: Question Set - 02

**1. A grammar that produces more than one parse tree for some sentence is called**

- (A) Ambiguous

- (B) Unambiguous

- (C) Regular

- (D) None of
these

**2. If e**

_{1}and e_{2}are the regular expressions denoting the languages L_{1}and L_{2}respectively, then which of the following is wrong?- (A) (e

_{1}) | (e

_{2}) is a regular expression denoting L

_{1 }∪ L

_{2}

- (B) (e

_{1}) .(e

_{2}) is a regular expression denoting L

_{1}. L

_{2}

- (C) Ï† is
not a regular expression

- (D) {e

_{x}} is a regular expression denoting L

_{1}*

**3. R1 and R2 are regular sets. Which of the following is not true?**

- (A) R1 n R2 need
not be regular

- (B) S* – R1 is
regular

- (C) R1 ? R2 is
regular

- (D) Is regular

**4. The following grammar**

G = (N, T, P, S)

N = {S, A, B}

T = {a, b, c}

P : S ? aSa

S ? aAa

A ? bB

B ? bB

B ? c is

- (A) Is type 3

- (B) Is type 2
but not type 3

- (C) Is type 1
but not type 2

- (D) Is type 0
but not type 1

**5. If L**

_{1}= {x | x is a palindrome in (0 + 1)*} L_{2} = {letter (letter + digit)* };

L_{3} = (0n 1n 2n | n > 1}

L_{4} = {ambnam+n | m, n > 1}**
then which of the following statement is correct ?**

- (A) L

_{1}is context free language and L

_{3}is context sensitive language

- (B) L

_{2}is a regular set and L

_{4}is not a context free language

- (C) Both L

_{1}and L

_{2}are regular sets

- (D) Both L

_{3}and L

_{4}are context-sensitive languages

**6. Consider the following language,**

L = {anbmcpdq|n, m, p, q = 1}

**L is?**

- (A) CFL but not
regular

- (B) CSL but not
CFL

- (C) Regular

- (D) Type 0
language but not type 1

**7. In the following grammar:**

x : : = x ⊕ y | 4

y : : = z * y I 2

z : : = id**
which of the following is true?**

- (A) ⊕ is left associative while * is right associative

- (B) Both ⊕ and * are left associative

- (C) ⊕ is right associative while * is left associative

- (D) None of
these

**8. The concept of FSA is much used in this part of the compiler**

- (A) Lexical
analysis

- (B) Parser

- (C) Code
generation

- (D) Code
optimization

**9. Pumping lemma is generally used for proving that**

- (A) Given
grammar is regular

- (B) Given
grammar is not regular

- (C) Whether two
given regular expressions are equivalent or not

- (D) None of
these

**10. A language is represented by a regular expression (a)*(a + ba). Which of the following string does not belong to the regular set represented by the above expression.**

- (A) aaa

- (B) aba

- (C) ababa

- (D) aa

**View All Answers**

**Next Tests:**

Blogger Comment

Facebook Comment