S -> abS S -> a is which grammar – McqOptions

MCQOPTIONS

1.	S -> abS S -> a is which grammar
A.	Right Linear Grammar
B.	Left Linear Grammar
C.	Right & Left Linear Grammar
D.	None of the mentioned
Answer» B. Left Linear Grammar

Discussion

No Comment Found

Related MCQs

Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?
Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?
The language accepted by a Push down Automata:
Semantic Analyser is used for?
What does a Syntactic Analyser do?
Assume the statements S1 and S2 given as:S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.S2: There exists an algorithm to determine whether two context free grammars generate the same language.Which of the following is true?
Give a production grammar for the language L = {x/x ? (a,b)*, the number of a's in x is multiple of 3}.
Let R1 and R2 be regular sets defined over alphabet ? then
Regular expression x/y denotes the set
Which of these does not belong to CFG