Menu

Question Discussion & Solution

MCQ

Q.

DFAs, NFAs, and ?-NFA s are equivalent

A

True

B

False

C

May be

D

Can't say

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.

DFAs, NFAs, and ?-NFA s are equivalent

A

True

B

False

C

May be

D

Can't say

Discussion

MCQ

2.

Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________

A

reflexive

B

transitive

C

symmetric

D

reflexive and transitive

Discussion

MCQ

3.

The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | wherestring s contains even number of 0 and 1

A

01,0011,010101

B

0011,11001100

C

?,0011,11001100

D

?,0011,11001100

Discussion

MCQ

4.

Transition function maps.

A

? * Q -> ?

B

Q * Q -> ?

C

? * ? -> Q

D

Q * ? -> Q

Discussion

MCQ

5.

The production Grammar is {S->aSbb,S->abb} is __________ grammar.

A

Type-3

B

Type-2

C

Type-1

D

Type-0

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