Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  GATE Computer Science Engineering(CSE) 2025 Mock Test Series  >  Test: Lexical Analysis- 1 - Computer Science Engineering (CSE) MCQ

Test: Lexical Analysis- 1 - Computer Science Engineering (CSE) MCQ


Test Description

10 Questions MCQ Test GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Test: Lexical Analysis- 1

Test: Lexical Analysis- 1 for Computer Science Engineering (CSE) 2024 is part of GATE Computer Science Engineering(CSE) 2025 Mock Test Series preparation. The Test: Lexical Analysis- 1 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Lexical Analysis- 1 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Lexical Analysis- 1 below.
Solutions of Test: Lexical Analysis- 1 questions in English are available as part of our GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) & Test: Lexical Analysis- 1 solutions in Hindi for GATE Computer Science Engineering(CSE) 2025 Mock Test Series course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Lexical Analysis- 1 | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study GATE Computer Science Engineering(CSE) 2025 Mock Test Series for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Lexical Analysis- 1 - Question 1

In analyzing the compilation of PL/I program, the term “Machine independent optimization” is associated with:

Detailed Solution for Test: Lexical Analysis- 1 - Question 1

The code optimization phase [i.e. machine independent optimization] attempts to improve the intermediate code, so that faster-running machine code will result.
Hence, it is associated with the creation of more optimal matrix.

Test: Lexical Analysis- 1 - Question 2

In analyzing the compilation of PL/I program the description “resolving symbolic address (lables) and generating machine language” is associated with _______.

Detailed Solution for Test: Lexical Analysis- 1 - Question 2

The final phase of the compiler is the generation of target code, consisting of relocatable machine code or assembly code. Intermediate instruction are each translated into a sequence of machine instructions that perform the same task. A crucial aspect is the assignment of variables to registers.

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

In analyzing the compilation of PL/I program the description “creation of more optimal matrix” is associated with

Detailed Solution for Test: Lexical Analysis- 1 - Question 3

In analysing the compilation of PL/I program the description "creation of more optimal matrix” is associated with machine independent optimization.

Test: Lexical Analysis- 1 - Question 4

In analyzing the compilation of PL/I program, the term “lexical analysis” is associated with

Detailed Solution for Test: Lexical Analysis- 1 - Question 4

The main task of lexical analyser is to read the input characters and producers as output  sequence of tokens that the parser uses for syntax analysis.

Test: Lexical Analysis- 1 - Question 5

The translator is best described as

Detailed Solution for Test: Lexical Analysis- 1 - Question 5

Translator is a system software. Generally, it comes with the operating system.

Test: Lexical Analysis- 1 - Question 6

Resolution is externally defined symbols is performed by

Detailed Solution for Test: Lexical Analysis- 1 - Question 6

Resolution is generally done during linking. Hence, linker does this

Test: Lexical Analysis- 1 - Question 7

A simple two-pass assembler does which of the following in the first pass?
1. It allocates space for the literals.
2. It computes the total length of the program.
3. It builds the symbol table for the symbols and their values.
4. It generates code for all the load and stores register instruction.

Detailed Solution for Test: Lexical Analysis- 1 - Question 7

Simple two-pass assembler:
1. Allocates space for the literals.
2. Computers the total length of program (syntax analysis).
3. Builds the symbol table for the symbols and their values.

Test: Lexical Analysis- 1 - Question 8

A compiler is

Detailed Solution for Test: Lexical Analysis- 1 - Question 8

A compiler is a software program that accepts a program written in a high level language and generate object code.

Test: Lexical Analysis- 1 - Question 9

A loader is

Detailed Solution for Test: Lexical Analysis- 1 - Question 9

A loader is a program that place programs into memory and prepare them for execution.

Test: Lexical Analysis- 1 - Question 10

Which of the following are language processors?

Detailed Solution for Test: Lexical Analysis- 1 - Question 10

There are three types of language processors:

  • Assembler
  • Interpreter
  • Compiler
55 docs|215 tests
Information about Test: Lexical Analysis- 1 Page
In this test you can find the Exam questions for Test: Lexical Analysis- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Lexical Analysis- 1, EduRev gives you an ample number of Online tests for practice

Top Courses for Computer Science Engineering (CSE)

Download as PDF

Top Courses for Computer Science Engineering (CSE)