Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Test  >  Compiler Design  >  Test: Machine Model - Computer Science Engineering (CSE) MCQ

Machine Model - Free MCQ Practice Test with solutions, GATE CSE (CSE) Compiler


MCQ Practice Test & Solutions: Test: Machine Model (10 Questions)

You can prepare effectively for Computer Science Engineering (CSE) Compiler Design with this dedicated MCQ Practice Test (available with solutions) on the important topic of "Test: Machine Model". These 10 questions have been designed by the experts with the latest curriculum of Computer Science Engineering (CSE) 2026, to help you master the concept.

Test Highlights:

  • - Format: Multiple Choice Questions (MCQ)
  • - Duration: 10 minutes
  • - Number of Questions: 10

Sign up on EduRev for free to attempt this test and track your preparation progress.

Test: Machine Model - Question 1

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

Detailed Solution: Question 1

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

Test: Machine Model - Question 2

 When there is a reduce/reduce conflict?

Detailed Solution: Question 2

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.

Test: Machine Model - Question 3

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

Detailed Solution: Question 3

 There is no terminal before the non terminal beta.

Test: Machine Model - Question 4

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

Detailed Solution: Question 4

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

Test: Machine Model - 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?

Detailed Solution: Question 5

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

Test: Machine Model - Question 6

Terminal table

Detailed Solution: Question 6

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.

Test: Machine Model - Question 7

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

Detailed Solution: Question 7

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

Test: Machine Model - Question 8

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

Detailed Solution: Question 8

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

Test: Machine Model - Question 9

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

Detailed Solution: Question 9

Re-enterable is the keyword for compiler being designed.

Test: Machine Model - Question 10

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

Detailed Solution: Question 10

 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.

26 videos|92 docs|30 tests
Information about Test: Machine Model Page
In this test you can find the Exam questions for Test: Machine Model solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Machine Model, EduRev gives you an ample number of Online tests for practice
26 videos|92 docs|30 tests
Download as PDF