Exam 11: Compilers and Language Translation

____ is the ability to write highly optimized programs that contain no wasted time or unnecessary memory cells.

In the ____ phase, the compiler examines the individual characters in the source program and groups them into tokens.

The singular goal of compilers is correctness.

Explain what metasymbols are and discuss their use as part of BNF rules.

A ____ is a data structure that stores information about a nonterminal, such as the actual name of the object and its data type.

Explain what the goal symbol is, and explain what its significance is.

During parsing, a compiler deals only with the ____ of a statement.

____ is the replacement of slow arithmetic operations with faster ones.

The English-language sentence, "The orange artichoke flew through the elephant" is semantically meaningful. _________________________

A(n) ____ definition defines a nonterminal symbol in terms of itself.

One of the possible local ____________________ is eliminating unnecessary operations.

____________________ for high-level languages like C++ or Java are very large.

A grammar that allows the construction of two or more distinct parse trees for the same statement is called a recursive grammar.

In the ____ phase, the compiler takes the generated code and sees whether it can be made more efficient, either by making it run faster or having it occupy less memory.

____ parsing algorithms examine several tokens "down the road" to see what would happen if a certain choice was made.

A ____ shows how individual tokens can be grouped into predefined grammatical categories until the desired goal is reached.

The input to a scanner is the machine language statement from the source program.

List three possible local optimizations.

The output of a(n) ____________________ is a list of all the tokens contained in a high-level language statement, as well as the classification number of each token found.

A BNF rule is also known as a production.