Menu

Question Discussion & Solution

MCQ
Q.
The context free grammer S->SS | oS1 | 1So |  e generates

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.
A context free language is called ambiguous if _________
forum Discussion
MCQ
2.
The Grammar can be defined as: G=(V, ?, p, S)
In the given definition, what does S represents?
forum Discussion
MCQ
3.
The minimum state automaton equivalent to the below FSA has the following number of states---

forum Discussion
MCQ
4.
Which of the expression is appropriate?
For production p: a->b where a?V and b?_______
forum Discussion
MCQ
5.
Which of the following statement is false?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward