Test: Code Generation

QUESTION: 1

Grammar that produce more than one Parse tree for same sentence is

A.
Ambiguous
B.
Unambiguous
C.
Complementary
D.
Concatenation Intersection

Solution:

An ambiguous grammar is one for which there is more than one parse tree for a single sentence.

QUESTION: 2

Automaton accepting the regular expression of any number of a ‘ s is

A.
a*
B.
ab*
C.
(a/b)*
D.
a*b*c

Solution:

It gives any number of a’s.

QUESTION: 3

Grammars that can be translated to DFAs:

A.
Left linear grammar
B.
Right linear grammar
C.
Generic grammar
D.
All of the mentioned

Solution:

Right linear grammar can be translated to the DFAs.

QUESTION: 4

The language accepted by a Push down Automata

A.
Type0
B.
Type1
C.
Type2
D.
Type3

Solution:

A known fact that type 2 grammar is accepted by PDA.

QUESTION: 5

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 ?

A.
I only
B.
II only
C.
Both I and II
D.
Neither I nor II

Solution:

Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.

QUESTION: 6

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 ?

A.
S1 is correct and S2 is not correct.
B.
Both S1 and S2 are correct.
C.
Both S1 and S2 are not correct.
D.
S1 is not correct and S2 is correct.

Solution:

The assumptions of statement S1 and S2 are correct.

QUESTION: 7

A context free language is called ambiguous if

A.
It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
B.
It has 2 or more than 2 left derivations for some terminal string ѡ є L (G)
C.
Both (a) and (b)
D.
None of the mentioned

Solution:

When two or more Left and right most derivative occur the grammar turn ambiguous.

QUESTION: 8

Which of the following statement is false?

A.
The CFG can be converted to Chomsky normal form
B.
The CFG can be converted to Greibach normal form
C.
CFG is accepted by push down automata
D.
None of the mentioned

Solution:

All the statements follow the rules.

QUESTION: 9

The context free grammar S → A111|S1, A → A0 | 00 is equivalent to

A.
{0ⁿ1ᵐ | n=2, m=3}
B.
{0ⁿ1ᵐ | n=1, m=5}
C.
{0ⁿ1ᵐ | n should be greater than two and m should be greater than four}
D.
None of these

Solution:

S-> A111
S->00111 (A->00)

QUESTION: 10

The context free grammar S → SS | 0S1 | 1S0 | ɛ generates

A.
Equal number of 0’s and 1’s
B.
Unequal number of 0’s and 1’s
C.
Number of 0’s followed by any number of 1’s
D.
None of the mentionedView Answer

Solution:

S->SS
S->0S1S
S->0S11S0
S->0110.

QUESTION: 11

Which of the following statement is false?

A.
In derivation tree, the label of each leaf node is terminal
B.
In derivation tree, the label of all nodes except leaf nodes is a variable
C.
In derivation tree, if the root of a sub tree is X then it is called –tree
D.
None of the mentioned

Solution:

All of them are true regarding a derivation tree.

QUESTION: 12

Push down automata accepts which language

A.
Context sensitive language
B.
Context free language
C.
Recursive language
D.
None of the mentioned

Solution:

PDA accepts CFG.

QUESTION: 13

A regular Grammar is a

A.
CFG
B.
Non CFG
C.
English Grammar
D.
None of the mentioned

Solution:

Regular grammar is CFG. It restricts its rules to a single non terminal on left hand side.

QUESTION: 14

A CFG is closed under

A.
Union
B.
Kleene star
C.
Concatenation
D.
None of the mentioned

Solution:

CFG is closed under the above mentioned 3 operations.

QUESTION: 15

Which of these does not belong to CFG?

A.
Terminal Symbol
B.
Non terminal Symbol
C.
Start symbol
D.
End Symbol

Solution:

CFG consist of terminal non terminal start symbol set of production rules but does not have an end symbol.

Recommended Tests

Test: Number System- 1
Test | 20 questions

Test: Machine Language Instruction Formats
Test | 10 questions

Test: File Systems-1
Test | 15 questions

Test: Arrays, Stack, Queues & Linked List- 1
Test | 10 questions

Test: Introduction, Process, Threads & CPU Scheduling- 1
Test | 10 questions

Related tests

Test: Code Generation
Test | 15 questions | 10 min

Test: Code Generation & Optimization- 2
Test | 15 questions | 30 min

Test: Code Generation & Optimization- 1
Test | 10 questions | 30 min

Using DAG For Code Generation
Test | 10 questions | 10 min

Test: Code Optimization
Test | 10 questions | 10 min

15 Questions MCQ Test Compiler Design | Test: Code Generation

Grammar that produce more than one Parse tree for same sentence is

Automaton accepting the regular expression of any number of a ‘ s is

Grammars that can be translated to DFAs:

Recommended Content

Recommended Tests

Similar Content

Code Generation

Code Generation

Code Generation

PPT: Code Generation

Related tests

Schools

Competitive Examinations

Quick Access Links

Technical Exams