adplus-dvertising
frame-decoration

Question

For the given Regular expression, the minimum number of terminals required to derive its grammar is:
(011+1)*(01)*

a.

4

b.

3

c.

5

d.

6

Answer: (b).3

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. For the given Regular expression, the minimum number of terminals required to derive its grammar is: (011+1)*(01)*

Similar Questions

Discover Related MCQs

Q. A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC

B->a

Q. Which among the following is a CFG for the given Language:
L={x∈{0,1}*|number of zeroes in x=number of one’s in x}

Q. Which of the following languages are most suitable for implement context free languages ?

Q. Which among the following is the correct grammar for the given language?
L={x∈{0,1}*|number of zeroes in x¹number of one’s in x}

Q. L={0^i1^j2^k | j>i+k}
Which of the following satisfies the language?

Q. The most suitable data structure used to represent the derivations in compiler:

Q. Which of the following statement is false in context of tree terminology?

Q. In which order are the children of any node ordered?

Q. Which among the following is the root of the parse tree?

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

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

Q. A grammar with more than one parse tree is called:

Q. __________ is the acyclic graphical representation of a grammar.

Q. Grammar is checked by which component of compiler

Q. A symbol X is ________ if there exists : S->* aXb

Q. A symbol X is called to be useful if and only if its is:

Q. Which of the following is false for a grammar G in Chomsky Normal Form:

Q. Given Checklist:
a) G has no useless symbols
b) G has no unit productions
c) G has no epsilon productions
d) Normal form for production is violated
Is it possible for the grammar G to be in CNF with the following checklisy ?

Q. State true or false:
Statement: A CNF parse tree’s string yield (w) can no longer be 2h-1.

Q. If |w|>=2^h, then its parse tree’s height is at least _____