Download PDF
Free download in PDF Lexical Analysis Ojective Type Questions and Answers for competitive exams. These short objective type questions with answers are very important for Board exams as well as competitive exams. These short solved questions or quizzes are provided by Gkseries.
(21)
Uniform symbol table
[A]
contains all constants in the program
[B]
is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure.
[C]
consists of full or partial list of the token's as they appear in the program created by Lexical analysis and used for syntax analysis and interpretation.
[D]
permanent table which lists all key words and special symbols of the language in symbolic form.
Answer: consists of full or partial list of the token's as they appear in the program created by Lexical analysis and used for syntax analysis and interpretation.
(22)
Which of the following system program forgoes the production of object code to generate absolute machine code and load it into the physical main storage location from which it will be executed immediately upon completion of the assembly ?
[A]
Two pass assembler
[B]
Load-and-go-assembler
[C]
Macroprocessor
[D]
Linker
Answer: Load-and-go-assembler
(23)
A system program that setup an executable program in main memory ready for execution is
[A]
assembler
[B]
linker
[C]
loader
[D]
load and go
(24)
A loader is a program that
[A]
program that places programs into memory and prepares them for execution.
[B]
program that automates the translation of assembly language into machine language.
[C]
program that accepts a program written in a high level language and produces as object program
[D]
None of these
Answer: program that places programs into memory and prepares them for execution.
(25)
A series of statements explaining how the data is to be processed is called
[A]
program
[B]
machine
[C]
assembly
[D]
None of the mentioned
(26)
System program such a s compiler are designed so that they are
[A]
re-enterable
[B]
non-reusable
[C]
serially usable
[D]
None of the above
(27)
Terminal table
[A]
contains all constants in the program.
[B]
is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure.
[C]
consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation.
[D]
is a permanent table which lists all keywords and special symbols of the language in symbolic form
Answer: is a permanent table which lists all keywords and special symbols of the language in symbolic form
(28)
An interpreter is a program that
[A]
places programs into memory and prepares them for execution
[B]
appears to execute a source program as if it were machine language.
[C]
automates the translation of assembly language into machine language.
[D]
accesses a program written in a high level language and produces an object program.
Answer: appears to execute a source program as if it were machine language.
(29)
A compiler program written in a high level language is called
[A]
source program
[B]
object program
[C]
machine language program
[D]
None of these
(30)
The output of lexical analyzer is
[A]
Set of Tokens
[B]
A set of RE
[C]
Syntax Tree
[D]
None of the above
31
For operator precedence parsing, which one is true?
[A]
For all pair of non-terminal
[B]
For all pair of non-terminals
[C]
To delimit the handle
[D]
None of the above
Answer: For all pair of non-terminal
32
Which concept of FSA is used in the compiler?
[A]
Lexical analysis
[B]
Parser
[C]
Code generation
[D]
Code optimization
33
Which of the following are Lexemes?
[A]
Keywords
[B]
Identifiers
[C]
Constants
[D]
All of the mentioned
Answer: All of the mentioned
Take Mock Tests