Menu

Question Discussion & Solution

MCQ

Q.

Does epsilon ring any change in the automata.

A

Yes

B

No

C

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.

Does epsilon ring any change in the automata.

A

Yes

B

No

C

Discussion

MCQ

2.

Which one is a FALSE statement?

A

There exists a unique DFA for every regular language

B

NFA can always are converted to a PDA

C

Complement of CFL is always recursive

D

Every NDFA can be converted to a DFA

Discussion

MCQ

3.

The transitions which does not take an input symbol are called ___________

A

?-transitions

B

?-transitions

C

?-transitions & ?-transitions

D

none of the mentioned

Discussion

MCQ

4.

Convert the NFA to DFA.

A

B

C

All of the mentioned

D

None of the mentioned

Discussion

MCQ

5.

Match the following.

    Group 1                       Group 2
P. 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-3, Q-4, R-1, S-2

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