Menu

Question Discussion & Solution

MCQ
Q.
The regular expression denotes a language comprising all possible strings of even length over the alphabet (0, 1).

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.
The regular expressions denote zero or more instances of an x or y is?
forum Discussion
MCQ
2.
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
forum Discussion
MCQ
3.
The set of all strings over ? = {a,b} in which strings consisting a
forum Discussion
MCQ
4.
Match the following
Group 1 Group 2P. 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