Menu

Question Discussion & Solution

MCQ
Q.
Are ambiguous grammar context free?

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 language {am bn Cm+n | m, n ? 1} is
forum Discussion
MCQ
2.
The set A={ 0n 1n 2 n | n=1, 2, 3, ......... } is an example of a grammar that is:
forum Discussion
MCQ
3.
Consider the languages L1 = ? and L2 = {1}. Which one of the following represents L*1? L*1 L*2 ?
forum Discussion
MCQ
4.
The Grammar can be defined as: G=(V, ?, p, S)
In the given definition, what does S represents?
forum Discussion
MCQ
5.
According to pumping lemma for context free languages: Let L be an infinite context free language, then there exists some positive integer m such that any w ? L with | w | ? m can be decomposed as w = u v x y z
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