Menu

Question Discussion & Solution

MCQ

Q.

NFA-?s are defined because certain properties can be more easily proved on them as compared to NFA.

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

Discussion

MCQ

3.

For the following grammar: S ? A | B | 2 A ? C0 | D B ? C1 | E C ? D | E | 3 D ? E0 | S E ? D1 | S Identify all the unit pairs

A

D,C

B

A,B

C

B,C

D

A,C

Discussion

MCQ

4.

A nondeterministic finite automaton with ?-moves is an extension of nondeterministic finite automaton

A

True

B

False

C

May be

D

Can't say

Discussion

MCQ

5.

Which of the following is NOT the set of regular expression R = (ab + abb)* bbab?

A

ababbbbab

B

abbbab

C

ababbabbbab

D

abababab

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