Test: Handle of Right Sentinel Grammar


10 Questions MCQ Test Compiler Design | Test: Handle of Right Sentinel Grammar


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

DAG representation of a basic block allows

Solution:

Explanation: it detects local sub expression .

QUESTION: 2

 Inherited attribute is a natural choice in

Solution:

Explanation: These attribute keep a check on variable declaration

QUESTION: 3

An intermediate code form is

Solution:

Explanation: Intermediate code generator receives input from its predecessor phase, semantic analyzer, in the form of an annotated syntax tree.

QUESTION: 4

 Which of the following actions an operator precedence parser may take to recover from an error?

Solution:

Explanation: All these symbols are used to recover operator precedence parser from an error

QUESTION: 5

The output of lexical analyzer is

Solution:

Explanation: lexical analysis is the process of converting a sequence of characters into a sequence of tokens

QUESTION: 6

Which of the following is used for grouping of characters into tokens?

Solution:

Explanation: lexical analysis is the process of converting a sequence of characters into a sequence of tokens.

QUESTION: 7

Shift reduce parsers are

Solution:

Explanation: This corresponds to starting at the leaves of the parse tree. It can be thought of. A process of reducing the string in question to the start symbol of the grammar. Bottom-up parsing is also known as shift-reduce parsing

QUESTION: 8

A bottom up parser generates

Solution:

Explanation: This corresponds to starting at the leaves of the parse tree. It can be thought of. a process of reducing the string in question to the start symbol of the grammar. Bottom-up parsing is also known as shift-reduce parsing.

QUESTION: 9

 A garbage is

Solution:

Explanation: these are more like memory loacations with values whose pointers have been revoked

QUESTION: 10

A optimizing compiler

Solution:

Explanation: As the name suggests that it optimizes the code

Related tests