Test: Lexical Analysis

QUESTION: 1

The output of lexical analyzer is

A.
A set of RE
B.
Syntax Tree
C.
Set of Tokens
D.
String Character

Solution:

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

QUESTION: 2

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

A.
Linear list
B.
Search tree
C.
Hash Table
D.
Self Organisation

Solution:

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

QUESTION: 3

For operator precedence parsing, which one is true?

A.
For all pair of non-terminal
B.
For all pair of terminals
C.
To delimit the handle
D.
None of the mentioned

Solution:

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.

QUESTION: 4

Object program is a

A.
Program written in machine language
B.
Program to be translated into machine language
C.
Translation of high-level language into machine language
D.
None of the mentioned

Solution:

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

QUESTION: 5

Which concept of FSA is used in the compiler?

A.
Lexical analysis
B.
Parser
C.
Code generation
D.
Code optimization

Solution:

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

QUESTION: 6

Which concept of grammar is used in the compiler

A.
Lexical analysis
B.
Parser
C.
Code generation
D.
Code optimization

Solution:

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

QUESTION: 7

Which of the following are Lexemes?

A.
Identifiers
B.
Constants
C.
Keywords
D.
All of the mentioned

Solution:

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

QUESTION: 8

What constitutes the stages of the compilation process?

A.
Feasibility study, system, design, and testing
B.
Implementation and. documentation
C.
Lexical analysis, syntax. Analysis and code generation
D.
None of the mentioned

Solution:

Explanation: As defined in the compilation process.

QUESTION: 9

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

A.
Source program, tokens
B.
Token, source program
C.
Either of the two
D.
None of the mentioned

Solution:

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

QUESTION: 10

Which grammar defines Lexical Syntax

A.
Regular Grammar
B.
Syntactic Grammar
C.
Context free Grammar
D.
Lexical Grammar

Solution:

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

QUESTION: 11

A compiler program written in a high level language is called

A.
Source Program
B.
Object Program
C.
Machine Language Program
D.
None of the mentioned

Solution:

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

QUESTION: 12

System program such a compiler are designed so that they are

A.
Re-enterable
B.
Non-Usable
C.
Serially usable
D.
None of the mentioned

Solution:

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

QUESTION: 13

Which of the following is not feature of compiler?

A.
Scan the entire program first and translate into machine code
B.
To remove syntax errors
C.
Slow for debugging
D.
Execution time is more

Solution:

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

QUESTION: 14

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

A.
Assembler
B.
Linking loader
C.
Cross compiler
D.
None of the mentioned

Solution:

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.

QUESTION: 15

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