Lexical Analysis
1.

What is the output of lexical analyzer?
A.  

A set of RE

 B.  

Syntax Tree

 C.  

Set of Tokens

 D.  

String Character
2.

Which symbol table implementation is based on the property of locality of reference?
A.  

Linear list

 B.  

Search tree

 C.  

Hash Table

 D.  

Self Organisation
3.

Which of the following is true for operator precedence parsing?
A.  

For all pair of non-terminal

 B.  

For all pair of non-terminals

 C.  

To delimit the handle

 D.  

None of the mentioned
4.

What is an Object program?
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
5.

Which concept of FSA is used in the compiler?
A.  

Lexical analysis

 B.  

Parser

 C.  

Code generation

 D.  

Code optimization
6.

Which concept of grammar is used in the compiler?
A.  

Lexical analysis

 B.  

Parser

 C.  

Code generation

 D.  

Code optimization
7.

Which of the following are Lexemes?
A.  

Identifiers

 B.  

Constants

 C.  

Keywords

 D.  

All of the mentioned
8.

The process of forming tokens from an input stream of characters is called __________
A.  

Liberalisation

 B.  

Characterisation

 C.  

Tokenization

 D.  

None of the mentioned
9.

The process of forming tokens from an input stream of characters is called tokenization.
A.  

Identifier

 B.  

Assignment operator

 C.  

Integer Literal

 D.  

Addition Operator
10.

Which grammar defines Lexical Syntax?
A.  

Regular Grammar

 B.  

Syntactic Grammar

 C.  

Context free Grammar

 D.  

Lexical Grammar