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

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