Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  Test: Lexical Analysis - Computer Science Engineering (CSE) MCQ

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


Test Description

15 Questions MCQ Test - Test: Lexical Analysis

Test: Lexical Analysis for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Test: Lexical Analysis questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Lexical Analysis 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 below.
Solutions of Test: Lexical Analysis questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Lexical Analysis solutions in Hindi for Computer Science Engineering (CSE) 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 | 15 questions in 15 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
Test: Lexical Analysis - Question 1

The output of lexical analyzer is

Detailed Solution for Test: Lexical Analysis - Question 1

Explanation: A lexical analyzer coverts character sequences to set of tokens.

Test: Lexical Analysis - Question 2

The symbol table implementation is based on the property of locality of reference is

Detailed Solution for Test: Lexical Analysis - Question 2

Explanation: Hash table is used as a reference for symbol table because it is efficient.

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

 For operator precedence parsing, which one is true?

Detailed Solution for Test: Lexical Analysis - Question 3

There are two important properties for these operator precedence parsers is that it does not appear on the right side of any production and no production has two adjacent non-terminals. Implying that no production right side is empty or has two adjacent non-terminals. So accordingly to property option (A) is correct.

Test: Lexical Analysis - Question 4

Object program is a

Detailed Solution for Test: Lexical Analysis - Question 4

Explanation: Since the input is the source language and the output that we get after the analysis is the machine language.

Test: Lexical Analysis - Question 5

 Which concept of FSA is used in the compiler?

Detailed Solution for Test: Lexical Analysis - Question 5

Explanation: Because the lexer performs its analysis by going from one stage to another.

Test: Lexical Analysis - Question 6

Which concept of grammar is used in the compiler

Detailed Solution for Test: Lexical Analysis - Question 6

Explanation: As the lexical analysis of a grammar takes place in phases hence it is synonymous to parser.

Test: Lexical Analysis - Question 7

Which of the following are Lexemes?

Detailed Solution for Test: Lexical Analysis - Question 7

Explanation: Different Lexical Classes or Tokens or Lexemes Identifiers, Constants, Keywords, Operators.

Test: Lexical Analysis - Question 8

What constitutes the stages of the compilation process?

Detailed Solution for Test: Lexical Analysis - Question 8

Explanation: As defined in the compilation process.

Test: Lexical Analysis - Question 9

The lexical analyzer takes_________as input and produces a stream of_______as output.

Detailed Solution for Test: Lexical Analysis - Question 9

Explanation: As per the definition of Lexical Analyser which states that lexical analysis is the process of converting a sequence of characters into tokens.

Test: Lexical Analysis - Question 10

Which grammar defines Lexical Syntax

Detailed Solution for Test: Lexical Analysis - Question 10

The specification of a programming language often includes a set of rules, the lexical grammar, which defines the lexical syntax.

Test: Lexical Analysis - Question 11

 A compiler program written in a high level language is called

Detailed Solution for Test: Lexical Analysis - Question 11

Explanation: The input that we give in high level language is also known as the source language.

Test: Lexical Analysis - Question 12

System program such a compiler are designed so that they are

Detailed Solution for Test: Lexical Analysis - Question 12

Explanation: For the convince of the user compilers are made re-enterable.

Test: Lexical Analysis - Question 13

Which of the following is not feature of compiler?

Detailed Solution for Test: Lexical Analysis - Question 13

Explanation: The objective of the compiler is clearly not to increase the execution time of the program.

Test: Lexical Analysis - Question 14

A system program that brings together separately compiled modules of a program into a form language that is suitable for execution

Detailed Solution for Test: Lexical Analysis - Question 14

Explanation: A loader which brings together the functions of a relocating loader with the ability to combine a number of program segments that have been independently compiled into an executable program.

Test: Lexical Analysis - Question 15

A programmer, by mistakes writes a program to multiply two numbers instead of dividing them, how can this error be detected

Detailed Solution for Test: Lexical Analysis - Question 15

Explanation: This is a logical error can’t be detected by any compiler or interpreter.

Information about Test: Lexical Analysis Page
In this test you can find the Exam questions for Test: Lexical Analysis solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Lexical Analysis, 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)