Question 1

____, the replacement of an arithmetic operation with a faster one is an example of a possible local optimization.

Accepted Answer

A)  Strength reduction 
B)  Constant evaluation 
C)  Eliminating unnecessary operations 
D)  Parse tree construction 
A)  Strength reduction 
B)  Constant evaluation 
C)  Eliminating unnecessary operations 
D)  Parse tree construction

Question 2

If a parser can convert the sequence of tokens into the goal symbol, then the sequence is an invalid statement.

Accepted Answer

A) True 
 B)False

Question 3

In addition to building tokens, a scanner must classify them by type.

Accepted Answer

A) True 
 B)False

Question 4

The goal symbol is the highest-level nonterminal.

Accepted Answer

A) True 
 B)False

Question 5

In ____ optimization, the compiler looks at large segments of the program to decide how to improve performance.

Accepted Answer

A)  local 
B)  global 
C)  semantic 
D)  syntactical 
A)  local 
B)  global 
C)  semantic 
D)  syntactical

Question 6

If a parser cannot produce a parse tree for a high-level language statement, then that statement is not correctly formed.

Accepted Answer

A) True 
 B)False

Question 7

The BNF language's syntax is specified as a series of grammars.

Accepted Answer

A) True 
 B)False

Question 8

In the ____ phase, the compiler determines whether the machine language translation that it had produced can be made more efficient.

Accepted Answer

A)  code optimization 
B)  parsing 
C)  lexical analysis 
D)  semantic analysis and code generation 
A)  code optimization 
B)  parsing 
C)  lexical analysis 
D)  semantic analysis and code generation

Question 9

The single goal of compilers is correctness.

Accepted Answer

A) True 
 B)False

Question 10

Performing local optimization is much more difficult than performing global optimization.

Accepted Answer

A) True 
 B)False

____, the replacement of an arithmetic operation with a faster one is an example of a possible local optimization.

If a parser can convert the sequence of tokens into the goal symbol, then the sequence is an invalid statement.

In addition to building tokens, a scanner must classify them by type.

The goal symbol is the highest-level nonterminal.

In ____ optimization, the compiler looks at large segments of the program to decide how to improve performance.

If a parser cannot produce a parse tree for a high-level language statement, then that statement is not correctly formed.

The BNF language's syntax is specified as a series of grammars.

In the ____ phase, the compiler determines whether the machine language translation that it had produced can be made more efficient.

The single goal of compilers is correctness.

Performing local optimization is much more difficult than performing global optimization.

An Introduction to Computer Science

Algorithm Discovery and Design

The Efficiency of Algorithms

The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Computer Systems Organization

An Introduction to System Software and Virtual Machines

Computer Networks, the Internet, and the Worldwide Web

Introduction to High-Level Language Programming

The Tower of Babel

Models of Computation

Simulation and Modeling

Electronic Commerce and Information Security

Artificial Intelligence

Making Decisions About Computers, Information, and Society

Filters

Exam 10: Compilers and Language Translation

____, the replacement of an arithmetic operation with a faster one is an example of a possible local optimization.

If a parser can convert the sequence of tokens into the goal symbol, then the sequence is an invalid statement.

In addition to building tokens, a scanner must classify them by type.

The goal symbol is the highest-level nonterminal.

In ____ optimization, the compiler looks at large segments of the program to decide how to improve performance.

If a parser cannot produce a parse tree for a high-level language statement, then that statement is not correctly formed.

The BNF language's syntax is specified as a series of grammars.

In the ____ phase, the compiler determines whether the machine language translation that it had produced can be made more efficient.

The single goal of compilers is correctness.

Performing local optimization is much more difficult than performing global optimization.

An Introduction to Computer Science

Algorithm Discovery and Design

The Efficiency of Algorithms

The Building Blocks: Binary Numbers, Boolean Logic, and Gates

Computer Systems Organization

An Introduction to System Software and Virtual Machines

Computer Networks, the Internet, and the Worldwide Web

Introduction to High-Level Language Programming

The Tower of Babel

Models of Computation

Simulation and Modeling

Electronic Commerce and Information Security

Artificial Intelligence

Making Decisions About Computers, Information, and Society

Filters