Which of the following is incorrect?
There exists algorithms to decide if:_______

Context free languages are not closed under:

Given Grammar G1:
S→aSb
S→e
Grammar G2:
R→cRd
R→e
If L(G)=L(G1) U L(G2), the number of productions the new starting variable would have:

The context free languages are closed under __________.

Given grammar G:
(1) S→AS
(2) S→AAS
(3) A→SA
(4) A→aa
Which of the following productions denies the format of Chomsky Normal Form?

A grammar with more than one parse tree is called:

Which of the following does the given parse tree correspond to?

The number of leaves in a parse tree with expression E*(E) where * and () are operators ________.

For the expression E*(E) where * and brackets are the operation, number of nodes in the respective parse tree are ___________.

For S→0S1|e for $\sum$={0,1}*, which of the following is wrong for the language produced?

Which of the expression is appropriate?
For production p: a→b where a$\in$V and b$\in$_______

Which among the following cannot be accepted by a regular grammar?

The entity which generate Language is termed as ___________.

Production Rule: aAb→agb belongs to which of the following category?

The Grammar can be defined as: G=(V, $\sum$, p, S)
In the given definition, what does S represents?