Test: Lexical Analysis

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

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

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.

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

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

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

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

Explanation: As defined in the compilation process.

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

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

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

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

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

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.

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