Lexical Analysis Questions

MCQ bookmark_border

1.

What is the output of lexical analyzer?

A

A set of RE

B

Syntax Tree

C

Set of Tokens

D

String Character

Correct Answer: C

A lexical analyzer coverts character sequences to set of tokens.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

Correct Answer: C

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

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

Correct Answer: A

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.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

Correct Answer: C

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

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

Which concept of FSA is used in the compiler?

A

Lexical analysis

B

Parser

C

Code generation

D

Code optimization

Correct Answer: A

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

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

Which concept of grammar is used in the compiler?

A

Lexical analysis

B

Parser

C

Code generation

D

Code optimization

Correct Answer: B

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

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

Which of the following are Lexemes?

A

Identifiers

B

Constants

C

Keywords

D

All of the mentioned

Correct Answer: D

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

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

Correct Answer: C

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

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

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

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

Which grammar defines Lexical Syntax?

A

Regular Grammar

B

Syntactic Grammar

C

Context free Grammar

D

Lexical Grammar

Correct Answer: D

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

Check Answer report_problem Report forum Discussion