Test: Code Generation

# Test: Code Generation

Test Description

## 15 Questions MCQ Test Compiler Design | Test: Code Generation

Test: Code Generation for Computer Science Engineering (CSE) 2023 is part of Compiler Design preparation. The Test: Code Generation questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Code Generation MCQs are made for Computer Science Engineering (CSE) 2023 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Code Generation below.
Solutions of Test: Code Generation questions in English are available as part of our Compiler Design for Computer Science Engineering (CSE) & Test: Code Generation solutions in Hindi for Compiler Design course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Code Generation | 15 questions in 10 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Compiler Design for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
 1 Crore+ students have signed up on EduRev. Have you?
Test: Code Generation - Question 1

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

Detailed Solution for Test: Code Generation - Question 1

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

Test: Code Generation - Question 2

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

Detailed Solution for Test: Code Generation - Question 2

It gives any number of a’s.

Test: Code Generation - Question 3

### Grammars that can be translated to DFAs:

Detailed Solution for Test: Code Generation - Question 3

Right linear grammar can be translated to the DFAs.

Test: Code Generation - Question 4

The language accepted by a Push down Automata

Detailed Solution for Test: Code Generation - Question 4

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

Test: Code Generation - 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 ?

Detailed Solution for Test: Code Generation - Question 5

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.

Test: Code Generation - 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 ?

Detailed Solution for Test: Code Generation - Question 6

The assumptions of statement S1 and S2 are correct.

Test: Code Generation - Question 7

A context free language is called ambiguous if

Detailed Solution for Test: Code Generation - Question 7

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

Test: Code Generation - Question 8

Which of the following statement is false?

Detailed Solution for Test: Code Generation - Question 8

All the statements follow the rules.

Test: Code Generation - Question 9

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

Detailed Solution for Test: Code Generation - Question 9

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

Test: Code Generation - Question 10

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

Detailed Solution for Test: Code Generation - Question 10

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

Test: Code Generation - Question 11

Which of the following statement is false?

Detailed Solution for Test: Code Generation - Question 11

All of them are true regarding a derivation tree.

Test: Code Generation - Question 12

Push down automata accepts which language

Detailed Solution for Test: Code Generation - Question 12

PDA accepts CFG.

Test: Code Generation - Question 13

A regular Grammar is a

Detailed Solution for Test: Code Generation - Question 13

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

Test: Code Generation - Question 14

A CFG is closed under

Detailed Solution for Test: Code Generation - Question 14

CFG is closed under the above mentioned 3 operations.

Test: Code Generation - Question 15

Which of these does not belong to CFG?

Detailed Solution for Test: Code Generation - Question 15

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

## Compiler Design

15 videos|55 docs|30 tests
 Use Code STAYHOME200 and get INR 200 additional OFF Use Coupon Code
Information about Test: Code Generation Page
In this test you can find the Exam questions for Test: Code Generation solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Code Generation, EduRev gives you an ample number of Online tests for practice

## Compiler Design

15 videos|55 docs|30 tests