Question
a.
It has 2 or more left derivations for some terminal string ѡ є L (G)
b.
It has 2 or more right derivations for some terminal string ѡ є L (G)
c.
Both of the mentioned
d.
None of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. A context free language is called ambiguous if
Similar Questions
Discover Related MCQs
Q. Which of the following statement is false?
View solution
Q. The context free grammar S → A111|S1, A → A0 | 00 is equivalent to
View solution
Q. The context free grammar S → SS | 0S1 | 1S0 | ɛ generates
View solution
Q. Which of the following statement is false?
View solution
Q. Push down automata accepts which language
View solution
Q. A regular Grammar is a
View solution
Q. A CFG is closed under
View solution
Q. Which of these does not belong to CFG ?
View solution
Q. A language is regular if and only if
View solution
Q. Regular grammar is
View solution
Q. Give a production grammar that specified language L = {a^i b^2i >= 1}
View solution
Q. The production Grammar {S->aSbb, S->abb} is
View solution
Q. S → SS S → λ S → aSb S → bSa which type of grammar is it?
View solution
Q. S → abS S → a is which grammar ?
View solution
Q. What are the two types of Linear Grammar?
View solution
Q. Which Type of Grammar is it?
S → Aa A → Aab | λ
View solution
Q. Which of the following is the most general phase structured grammar
View solution
Q. Which of the following grammars are not phase structured ?
View solution
Q. CSG can be recognized by
View solution
Q. Which of the following is/are the suitable approaches for inferencing?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
