Menu

Question Discussion & Solution

MCQ
Q.
Which of the following CFG

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.
E(q) is known ?-closure of q.
forum Discussion
MCQ
2.
A nondeterministic finite automation with ?-moves is an extension of nondeterministic finite automation.
forum Discussion
MCQ
3.
The transitions which does not take an input symbol are called ___________
forum Discussion
MCQ
4.
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
forum Discussion
MCQ
5.
NFA-?s are defined because certain properties can be more easily proved on them as compared to NFA.
forum Discussion

category More Compiler Design Topics

article

Compiler Design Basics

format_list_bulleted 61 MCQs
article

Non Deterministic Finite Automata

format_list_bulleted 26 MCQs
article

Lexical Analysis

format_list_bulleted 64 MCQs
article

Regular Expressions

format_list_bulleted 64 MCQs
article

Finite Automata

format_list_bulleted 48 MCQs
article

Syntax Analyser

format_list_bulleted 29 MCQs
article

Semantic Analyser

format_list_bulleted 11 MCQs
article

Run Time Environment

format_list_bulleted 10 MCQs
article

Code Generation

format_list_bulleted 12 MCQs
article

Code Optimization

format_list_bulleted 22 MCQs
article

Parsing

format_list_bulleted 110 MCQs
article

Transformation from NFA to DFA

format_list_bulleted 15 MCQs
article

Cross Compiler

format_list_bulleted 15 MCQs
article

Epsilon Moves

format_list_bulleted 15 MCQs