Test: Machine Model


10 Questions MCQ Test Compiler Design | Test: Machine Model


Description
This mock test of Test: Machine Model 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: Machine Model (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Machine Model quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Machine Model exercise for a better result in the exam. You can find other Test: Machine Model extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

If a state does not know whether it will make a shift operation or reduction for a terminal is called

Solution:

As the name suggests that the conflict is between shift and reduce hence it is called shift reduce conflict.

QUESTION: 2

 When there is a reduce/reduce conflict?

Solution:

It occurs when If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal.

QUESTION: 3

When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-head

Solution:

 There is no terminal before the non terminal beta.

QUESTION: 4

 When ß is empty (A -> ß.,a ), the reduction by A-> a is done

Solution:

 The next token is considered in this case it’s a.

QUESTION: 5

The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?

Solution:

Closure and goto do work differently in case of LR (0) and LR (1).

QUESTION: 6

Terminal table

Solution:

A permanent database that has entry for each terminal symbols such as arithmetic operators, keywords, punctuation characters such as ‘;’, ‘,’etc Fields: Name of the symbol.

QUESTION: 7

Advantage of incorporating the macro-processor into pass 1 is that

Solution:

A general-purpose macro processor or general purpose pre-processor is a macro …designed primarily for string manipulation, macro definition.

QUESTION: 8

Which of the following is a phase of a compilation process?

Solution:

Lexical analysis and code generation is a phase of compilation process.

QUESTION: 9

System program such a s compiler are designed so that they are

Solution:

Re-enterable is the keyword for compiler being designed.

QUESTION: 10

 A series of statements explaining how the data is to be processed is called

Solution:

 A program is a sequence of instructions, written to perform a task by computer. It requires programs to function, typically executing the program’s instructions in a central processor.

Similar Content

Related tests