Test: Bottom Up Parsing


15 Questions MCQ Test Compiler Design | Test: Bottom Up Parsing


Description
This mock test of Test: Bottom Up Parsing for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 15 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Bottom Up Parsing (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Bottom Up Parsing quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Bottom Up Parsing exercise for a better result in the exam. You can find other Test: Bottom Up Parsing extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

 Inherited attribute is a natural choice in

Solution:

Explanation: It keeps track of variable.

QUESTION: 2

 YACC builds up

Solution:

Explanation: It is a parser generator.

QUESTION: 3

In an absolute loading scheme which loader function is accomplished by assembler?

Solution:

Explanation: Large number variables onto a small number of CPU register.

QUESTION: 4

A parser with the valid prefix property is advantageous because it

Solution:

Explanation: Advantage for a valid prefix property.

QUESTION: 5

The action of parsing the source program into proper syntactic classes is called

Solution:

Explanation: Conversion of characters to tokens.

QUESTION: 6

Relocating bits used by relocating loader are specified by

Solution:

Explanation: Takes an object files and combines them into a single executable file, library file, or another object file.

QUESTION: 7

What is the binary equivalent of the decimal number 368

Solution:

QUESTION: 8

AB+(A+B)’ is equivalent to

Solution:

Explanation: It is equivalent to A? B.

QUESTION: 9

A top down parser generates

Solution:

Explanation: Top-down parsing is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar.

QUESTION: 10

Running time of a program depends on

Solution:

Explanation: Run time, runtime or execution time is the time during which a program is running (executing)

QUESTION: 11

Which of the following is the fastest logic ?

Solution:

Explanation: In electronics, emitter-coupled logic (ECL) is a high-speed integrated circuit

QUESTION: 12

A bottom up parser generates

Solution:

Explanation: This corresponds to starting at the leaves of the parse tree also known as shift-reduce parsing.

QUESTION: 13

A grammar that produces more than one parse tree for some sentence is called

Solution:

Explanation: ambiguous grammar has more than one parse tree.

QUESTION: 14

An optimizer Compiler

Solution:

Explanation: In computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program.

QUESTION: 15

The linker

Solution:

Explanation: It is a program that takes one or more object files generated by a compiler and combines them into a single executable file, library file, or another object file.

Related tests