Menu

Question Discussion & Solution

MCQ

Q.

For every DFA, there is a ?-NFA that accepts the same language

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.

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

A

Type-3

B

Type-2

C

Type-1

D

Type-0

Discussion

MCQ

2.

Language of finite automata is.

A

Type 0

B

Type 1

C

Type 2

D

Type 3

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.

Given: ?= {a, b}
L= {x??*|x is a string combination}
?4 represents which among the following?

A

{aa, ab, ba, bb}

B

{aaaa, abab, ?, abaa, aabb}

C

{aaa, aab, aba, bbb}

D

All of the mentioned

Discussion

MCQ

5.

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

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