Compiler Design

Which of the following symbol table implementation has the minimum access time?

• (A) Self-organizing list

• (B) Linear

• (C) Search tree

• (D) Hash table

The top-down parsing method is also called

• (A) Operator precedence parsing

• (B) Recursive descent parsing

• (C) Shift reduce parsing

• (D) None of these

The lexical analyzer takes ____ as input and produces a list of ___ of output

• (A) Machine code, mnemonic

• (B) Tokens, source code

• (C) Source code, tokens

• (D) Both a and b

_____ constructs the desired target program from the intermediate representation of the source program.

• (A) Analysis part

• (B) Lexical part

• (C) Synthesis part

• (D) None of these

The parsing technique that avoids backtracking is

• (A) Top-down parsing

• (B) Recursive-descent parsing

• (C) Predictive parsing

• (D) Both (b) and (c)

Interpreter is preferred over a compiler is

• (A) During program development phase

• (B) When storage space is to be minimized

• (C) When efficient use of computer resources is the consideration

• (D) All of these

Which of the following is language processor?

• (A) Interpreters

• (B) Assembler

• (C) Compilers

• (D) All of these

Semantic errors can be detected at

• (A) Compile time only

• (B) Run-time only

• (C) Both (a) and (b)

• (D) None of these

Which of the following is true about interpreters?

• (A) Interpreters convert source code to machine code

• (B) Interpreters execute code line by line

• (C) Interpreters optimize code for faster execution

• (D) Interpreters generate executable files

When are semantic errors typically detected?

• (A) Compile time only

• (B) Run-time only

• (C) Both compile time and run-time

• (D) None of these