Find a regular expression for a grammar which generates a language whi – McqOptions

MCQOPTIONS

1.	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.
A.	a(aUb)b
B.	a(aUb)b
C.	a(ab)b
D.	None of the mentioned
Answer» B. a(aUb)b

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 :<br>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:<br>X->aX
If P is the production, for the given statement, state true or false.<br>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,<br>G=(V, T, P, S)
a b<br>Restriction: Length of b must be atleast as much length of a.
Context free grammar is called Type 2 grammar because of ______________ hierarchy.