Menu

Question Discussion & Solution

MCQ

Q.

?-transitions does not add any extra capacity of recognizing formal.

A

True

B

False

C

n>

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.

Which of the following CFG

A

S->Sa/b

B

S->aSb/ab

C

S->abX, X->cY, Y->d/aX

D

None of the mentioned

Discussion

MCQ

2.

Convert the NFA to DFA.

A

B

C

All of the mentioned

D

None of the mentioned

Discussion

MCQ

3.

Does epsilon ring any change in the automata.

A

Yes

B

No

C

Discussion

MCQ

4.

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

5.

Which of the following is a correct statement?

A

{ If an bn | n = 0,1, 2, 3 ..} is regular language

B

Strings with equal number of a

C

L (A* B*)? B gives the set A

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