Menu

Question Discussion & Solution

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

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Let L = L1 ? L2, where L1 and L2 are languages as defined below.
L1 = {ambmcanbn | m, n >= 0 }
L2 = {aibjck | i, j, k >= 0 }
Then L is?
forum Discussion
MCQ
2.
Which one is a FALSE statement?
forum Discussion
MCQ
3.
A nondeterministic finite automation with ?-moves is an extension of nondeterministic finite automation.
forum Discussion
MCQ
4.
Is an ordinary NFA and a NFA-? are equivalent.
forum Discussion
MCQ
5.
The transitions which does not take an input symbol are called ___________
forum Discussion

category More Compiler Design Topics

article

Compiler Design Basics

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Non Deterministic Finite Automata

format_list_bulleted 26 MCQs
Practice arrow_forward
article

Lexical Analysis

format_list_bulleted 64 MCQs
Practice arrow_forward
article

Regular Expressions

format_list_bulleted 64 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 48 MCQs
Practice arrow_forward
article

Syntax Analyser

format_list_bulleted 29 MCQs
Practice arrow_forward
article

Semantic Analyser

format_list_bulleted 11 MCQs
Practice arrow_forward
article

Run Time Environment

format_list_bulleted 10 MCQs
Practice arrow_forward
article

Code Generation

format_list_bulleted 12 MCQs
Practice arrow_forward
article

Code Optimization

format_list_bulleted 22 MCQs
Practice arrow_forward
article

Parsing

format_list_bulleted 110 MCQs
Practice arrow_forward
article

Transformation from NFA to DFA

format_list_bulleted 15 MCQs
Practice arrow_forward
article

Cross Compiler

format_list_bulleted 15 MCQs
Practice arrow_forward
article

Epsilon Moves

format_list_bulleted 15 MCQs
Practice arrow_forward