Question Discussion & Solution

MCQ

E(q) is known ?-closure of q.

True

False

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which one is a FALSE statement?

There exists a unique DFA for every regular language

NFA can always are converted to a PDA

Complement of CFL is always recursive

Every NDFA can be converted to a DFA

Discussion

MCQ

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?

Not recursive

Regular

Context free but not regular

None of the mentioned

Discussion

MCQ

E(q) is known ?-closure of q.

True

False

Discussion

MCQ

Match the following.

    Group 1                       Group 2
P. Regular expression        1. Syntax analysis
Q. Pushdown automata         2. Code generation
R. Dataflow analysis         3. Lexical analysis
S. Register allocation       4. Code optimization

P-4. Q-1, R-2, S-3

P-3, Q-1, R-4, S-2

P-3, Q-4, R-1, S-2

Discussion

MCQ

Does epsilon ring any change in the automata.

Yes

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Compiler Design Topics

Compiler Design Basics

Non Deterministic Finite Automata

Lexical Analysis

Regular Expressions

Finite Automata

Syntax Analyser

Semantic Analyser

Run Time Environment

Code Generation

Code Optimization

Parsing

Transformation from NFA to DFA

Cross Compiler

Epsilon Moves

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Compiler Design Topics