Menu

Question Discussion & Solution

MCQ
Q.
Here is a context-free grammar G: S ? AB A ? 0A1 | 2 B ? 1B | 3A which of the following strings are in L (G)?

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.
If a
forum Discussion
MCQ
2.
Which one of the following languages over the alphabet {0, 1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
forum Discussion
MCQ
3.
A nondeterministic finite automaton with ?-moves is an extension of nondeterministic finite automaton
forum Discussion
MCQ
4.
?-transitions does not add any extra capacity of recognizing formal
forum Discussion
MCQ
5.
E(q) is known ?-closure of q.
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