Menu

Question Discussion & Solution

MCQ
Q.
Which of the following pairs of regular expressions are equivalent?

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.
Which of the following languages is/are regular?
L1: {wxwR ? w, x ? {a, b}* and ?w?, ?x? >0} wR is the reverse of string w

L2: {anbm ?m ? n and m, n?0

L3: {apbqcr ? p, q, r ? 0}
forum Discussion
MCQ
2.
Union of two languages L and M is written as?
forum Discussion
MCQ
3.
Is an ordinary NFA and a NFA-? are equivalent
forum Discussion
MCQ
4.
If a
forum Discussion
MCQ
5.
You can use RE, if you expect the value of a property to change in an unpredictable way each time its run.
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