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

Test: Machine Model - Computer Science Engineering (CSE) MCQ


Test Description

10 Questions MCQ Test Compiler Design - Test: Machine Model

Test: Machine Model for Computer Science Engineering (CSE) 2024 is part of Compiler Design preparation. The Test: Machine Model questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Machine Model MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Machine Model below.
Solutions of Test: Machine Model questions in English are available as part of our Compiler Design for Computer Science Engineering (CSE) & Test: Machine Model 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: Machine Model | 10 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
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 for Test: Machine Model - 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 for Test: Machine Model - 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.

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: Machine Model - Question 3

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

Detailed Solution for Test: Machine Model - 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 for Test: Machine Model - 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 for Test: Machine Model - 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 for Test: Machine Model - 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 for Test: Machine Model - 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 for Test: Machine Model - 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 for Test: Machine Model - 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 for Test: Machine Model - 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|66 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

Top Courses for Computer Science Engineering (CSE)

26 videos|66 docs|30 tests
Download as PDF

Top Courses for Computer Science Engineering (CSE)