From the definition of context free grammars,G=(V, T, P, S) – McqOptions

MCQOPTIONS

1.	From the definition of context free grammars,G=(V, T, P, S)
A.	nWhat is the solution of V T?
B.	Null
C.	Not Null
D.	Cannot be determined, depends on the language
E.	None of the mentioned
Answer» B. Null

Discussion

No Comment Found

Related MCQs

A CFG consist of the following elements:
Find a regular expression for a grammar which generates a language which states :L contains a set of strings starting wth an a and ending with a b, with something in the middle.
If the partial derivation tree contains the root as the starting variable, the form is known as:
There exists a Context free grammar such that:X->aX
If P is the production, for the given statement, state true or false.P: V->(V T)* represents that the left hand side production rule has no right or left context.
From the definition of context free grammars,G=(V, T, P, S)
a bRestriction: Length of b must be atleast as much length of a.
Context free grammar is called Type 2 grammar because of ______________ hierarchy.