There exists a Context free grammar such that:X->aXWhich among the fo – McqOptions

MCQOPTIONS

1.	There exists a Context free grammar such that:X->aXWhich among the following is correct with respect to the given assertion?
A.	Left Recursive Grammar
B.	Right Recursive Grammar
C.	Non Recursive Grammar
D.	None of the mentioned
Answer» C. Non Recursive Grammar

Discussion

No Comment Found

Related MCQs

A CFG for a program describing strings of letters with the word “main” somewhere in the string:
A CFG consist of the following elements:
Which of the following is the correct representation of grammar for the given regular expression?a(aUb)*b
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->aXWhich among the following is correct with respect to the given assertion?
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)What is the solution of VÇT?
a→bRestriction: Length of b must be atleast as much length of a.Which of the following is correct for the given assertion?
Context free grammar is called Type 2 grammar because of ______________ hierarchy.