> > Compiler Design MCQs > Basic Compiler Design MCQs

Basic Compiler Design MCQ

1. Which data structure does a compiler use to solve the register allocation problem?

registers relation map

registers interference graph

registers dependency list

registers allocation tree

Answer

Correct Answer: registers interference graph

Note: This Question is unanswered, help us to find answer for this one

2. When does a memory leak happen?

It happens when a object created, is not destroyed.

It happens when memory is still marked as used even after the object has been deleted.

It happens when two objects hold references to each other and thus they cannot be deleted.

All of the above

Answer

Correct Answer: It happens when memory is still marked as used even after the object has been deleted.

Note: This Question is unanswered, help us to find answer for this one

3. What is the main disadvantage of the bitmapped memory allocation scheme of the manual memory management?

Bitmapped memory allocation scheme belongs to automated memory management methods, so question is incorrect.

It is extremely hard to code on C and requires a great debugging effort before it starts working.

Iit causes huge and frequent memory fragmentations.

It allocates memory too slow.

Answer

Correct Answer: It allocates memory too slow.

Note: This Question is unanswered, help us to find answer for this one

4. When using 'optional' keyword for declaring a lambda, such as 'optional (x y z)', what does x, y and z signify?

They are all optional variables names

x is a variable name, y is a binding flag and z is the default value for the variable x

y is a variable name, x is a binding flag and z is the default value for the variable y

x is a variable name, z is a binding flag and y is the default value for the variable x

Answer

Correct Answer: x is a variable name, z is a binding flag and y is the default value for the variable x

Note: This Question is unanswered, help us to find answer for this one

5. Is it possible to prove the theoretical stability (that is, prove that a collection algorithm will work as expected) of a garbage collector used in conjunction with C language?

Yes, and in case of all garbage collector types.

Yes, but only in the case of a generational garbage collector.

Yes, but only in the case of an incremental garbage collector.

It is not possible to prove the theoretical stability of any garbage collector type.

Answer

Correct Answer: It is not possible to prove the theoretical stability of any garbage collector type.

Note: This Question is unanswered, help us to find answer for this one

6. Which of the following is NOT a garbage collection algorithm?

Train algorithm

Baker algorithm

Cheney algorithm

Car algorithm

Answer

Correct Answer: Car algorithm

Note: This Question is unanswered, help us to find answer for this one

7. What does it mean if when an algorithm "A", belongs to the O(n) algorithms:

That algorithm

None of the above

Answer

Correct Answer: None of the above

Note: This Question is unanswered, help us to find answer for this one

8. What is the fastest way to establish a relationship between two objects?

By using a hash map.

By using a B-tree.

By using a binary search tree.

All of the above

Answer

Correct Answer: By using a hash map.

Note: This Question is unanswered, help us to find answer for this one

9. Which of the following is a dispatch macro character in Common Lisp?

Answer

Correct Answer: #

Note: This Question is unanswered, help us to find answer for this one

10. What is the main advantage of using segregated lists usage in the manual memory management?

They keep track of memory leaks in an application

They allow to allocate memory chunks of any required size

Memory management systems based on segregated lists are extremely fast

All of the above

Answer

Correct Answer: Memory management systems based on segregated lists are extremely fast

Note: This Question is unanswered, help us to find answer for this one

11. Which of the following options is NOT a technique used in "peephole optimization" of the generated code in a compiler?

Sequential load and store instructions elimination

Identifying patterns in the instruction stream which are known to be performance gaps

Constants folding in the memory addresses used by the generated instructions

Optimization of the generated code by performing branching analysis algorithms which take target machine characteristics into account

Answer

Correct Answer: Optimization of the generated code by performing branching analysis algorithms which take target machine characteristics into account

Note: This Question is unanswered, help us to find answer for this one

12. What is the relationship between lexical and syntax analysis?

They are one and the same thing.

Lexical analysis includes syntax analysis.

Syntax analysis includes lexical analysis

They have no relationship with each other.

Answer

Correct Answer: They have no relationship with each other.

Note: This Question is unanswered, help us to find answer for this one

13. What functionality of the listed below is NOT common to a parser?

Syntax errors handling in a program sources

Semantic errors handling in a program sources

Converting a program sources to a syntax tree

Applying a language grammar rules to a program sources

Answer

Correct Answer: Semantic errors handling in a program sources

Note: This Question is unanswered, help us to find answer for this one

14. What branching instructions type is more resource-consuming on the RISC processor?

Long branch instruction

Short branch instruction

All instructions are equal in CPU resources consumption

RISC processor typically has only long branch instruction. The question therefore is incorrect

Answer

Correct Answer: Long branch instruction

Note: This Question is unanswered, help us to find answer for this one

15. Which of the following is NOT a valid Common Lisp symbol name?

||||

<><><>M<

?/?

#?#

Answer

Correct Answer: #?#

Note: This Question is unanswered, help us to find answer for this one

16. What is the difference between a Static Single Assignments graph (SSAG) and a Control Flow Graph (CFG) which are used for the intermediate compiled sources representation in a compiler?

An SSAG is more suitable for a code optimization than a CFG.

All SSAG graph elements have unique names but CFG ones do not.

SSAG graph construction is much more complicated than CFG construction.

All of the above.

Answer

Correct Answer: All of the above.

Note: This Question is unanswered, help us to find answer for this one

17. What is the difference between a general binary search tree and an optimal binary search tree?

An optimal binary search tree can be used only with unique nodes values

An optimal binary search tree has less average expected search time as compared with a general binary search tree's one.

An optimal binary search tree can not be used for solving optimization problems.

All of the above

Answer

Correct Answer: An optimal binary search tree has less average expected search time as compared with a general binary search tree's one.

Note: This Question is unanswered, help us to find answer for this one

18. What is a generated code optimization method which is NOT suitable for use in a compiler?

Code branching prediction

Constants folding and propagation

Loop invariant relocation outside

Common subexpressions elimination in a code blocks

Answer

Correct Answer: Code branching prediction

Note: This Question is unanswered, help us to find answer for this one

19. What is the advantage of using a suballocator in a memory management system?

It allows to have memory chunks of any size

It obtains large blocks of memory from the system memory manager and allocates the memory to the application in smaller pieces.

It hides memory leaks from the operating system

All of the above answers are correct

Answer

Correct Answer: It obtains large blocks of memory from the system memory manager and allocates the memory to the application in smaller pieces.

Note: This Question is unanswered, help us to find answer for this one

20. Which of the following problems prevents garbage collectors from being used in the real-time systems?

They involve huge memory fragmentation.

They can not be thread-safe.

They can make real-time systems hang for some period of time.

All of the above

Answer

Correct Answer: They can make real-time systems hang for some period of time.

Note: This Question is unanswered, help us to find answer for this one

21. What is the return value of the subtype "predicate", in case it CANNOT decide what is the relation between types it is asked about?

It will raise an exception

It will return nil

It will return (nil nil)

It will return (nil nil t)

Answer

Correct Answer: It will return (nil nil)

Note: This Question is unanswered, help us to find answer for this one

22. Is garbage collection available in Common Lisp implementations?

No, it isn't.

Yes, but only in SBCL.

Yes, in all implementations.

Yes, except in CMUCL.

Answer

Correct Answer: Yes, in all implementations.

Note: This Question is unanswered, help us to find answer for this one

Compiler Design MCQs | Topic-wise

MCQ on Basic Compiler Design

General Compiler Design MCQs