Menu

Question Discussion & Solution

MCQ

Q.

A regular language over an alphabet ? is one that cannot be obtained from the basic languagesusing the operation

A

Union

B

Concatenation

C

Kleene*

D

All 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.

Number of final state require to accept ? in minimal finite automata.

A

1

B

2

C

3

D

None of the mentioned

Discussion

MCQ

2.

Transition function maps.

A

? * Q -> ?

B

Q * Q -> ?

C

? * ? -> Q

D

Q * ? -> Q

Discussion

MCQ

3.

Maximum number of states of a DFA converted from an NFA with nstates is?

A

n

B

n²

C

2n

D

None of the mentioned

Discussion

MCQ

4.

The basic limitation of finite automata is that

A

It can

B

It sometimes recognize grammar that are not regular.

C

It sometimes fails to recognize regular grammar.

D

All of the mentioned

Discussion

MCQ

5.

Finite automata requires minimum _______ number of stacks.

A

1

C

2

D

None of the mentioned

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