Question
a.
type-3 grammar
b.
type-2 grammar
c.
type-1 grammar
d.
type-0 grammar
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. The production Grammar {S->aSbb, S->abb} is
Similar Questions
Discover Related MCQs
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
Q. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w could be:
View solution
Q. Which of the following does the given parse tree correspond to?
View solution
Q. The entity which generate Language is termed as:
View solution
Q. Production Rule: aAb->agb belongs to which of the following category?
View solution
Q. The Grammar can be defined as: G=(V, ∑, p, S)
In the given definition, what does S represents?
View solution
Q. Which among the following cannot be accepted by a regular grammar?
View solution
Q. Which of the expression is appropriate?
For production p: a->b where a∈V and b∈_______
View solution
Q. For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?
View solution
Q. The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is
View solution
Q. Which of the following statement is correct?
View solution
Q. Are ambiguous grammar context free?
View solution
Q. Which of the following is not a notion of Context free grammars?
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!