Test: Code Generation - Computer Science Engineering (CSE) MCQ

Ambiguous

Unambiguous

Complementary

Concatenation Intersection

a*

ab*

(a/b)*

a*b*c

Left linear grammar

Right linear grammar

Generic grammar

All of the mentioned

Type0

Type1

Type2

Type3

I only

II only

Both I and II

Neither I nor II

S1 is correct and S2 is not correct.

Both S1 and S2 are correct.

Both S1 and S2 are not correct.

S1 is not correct and S2 is correct.

It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)

It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)

Both (a) and (b)

None of the mentioned

The CFG can be converted to Chomsky normal form

The CFG can be converted to Greibach normal form

CFG is accepted by push down automata

None of the mentioned

{0ⁿ1ᵐ | n=2, m=3}

{0ⁿ1ᵐ | n=1, m=5}

{0ⁿ1ᵐ | n should be greater than two and m should be greater than four}

None of these

Equal number of 0’s and 1’s

Unequal number of 0’s and 1’s

Number of 0’s followed by any number of 1’s

None of the mentionedView Answer

In derivation tree, the label of each leaf node is terminal

In derivation tree, the label of all nodes except leaf nodes is a variable

In derivation tree, if the root of a sub tree is X then it is called –tree

None of the mentioned

Context sensitive language

Context free language

Recursive language

None of the mentioned

CFG

Non CFG

English Grammar

None of the mentioned

Union

Kleene star

Concatenation

None of the mentioned

Terminal Symbol

Non terminal Symbol

Start symbol

End Symbol