Menu

Question Discussion & Solution

MCQ

Q.

The grammar G: S ? SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G

A

bbb

B

ab

C

All of the mentioned

D

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

A regular expression enables a quick test to determine objects and text strings with undependable values.

A

True

B

False

C

n>

Discussion

MCQ

2.

Match the following
Group 1 Group 2P. Regular expression 1. Syntax analysis

Q. Pushdown automata 2. Code generation

R. Dataflow analysis 3. Lexical analysis

S. Register allocation 4. Code optimization

A

P-4. Q-1, R-2, S-3

B

P-3, Q-1, R-4, S-2

C

P-3, Q-4, R-1, S-2

D

P-2, Q-1, R-4, S-3

Discussion

MCQ

3.

Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*

B

a*

C

All of the mentioned

D

None of the mentioned

Discussion

MCQ

4.

E(q) is known ?-closure of q.

A

True

B

False

C

May be

D

Can't say

Discussion

MCQ

5.

Which of the following regular expression denotes zero or more instances of an a or b?

A

a/b

B

(a/b)*

C

(ab)*

D

a*Ib

Discussion

More Compiler Design Topics

Compiler Design Basics

61 MCQs

Non Deterministic Finite Automata

26 MCQs

Lexical Analysis

64 MCQs

Regular Expressions

64 MCQs

Finite Automata

48 MCQs

Syntax Analyser

29 MCQs

Semantic Analyser

11 MCQs

Run Time Environment

10 MCQs

Code Generation

12 MCQs

Code Optimization

22 MCQs

Parsing

110 MCQs

Transformation from NFA to DFA

15 MCQs

Cross Compiler

15 MCQs

Epsilon Moves

15 MCQs