Exam 11: Compilers and Language Translation

High-level languages must be translated into machine language before they can be executed. _________________________

A(n)____ is a compiler embedded with a collection of supporting software.

During the parsing phase, the sequence of tokens formed by the scanner is checked to see whether it is _________ correct according to the rules of the programming language.

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

Focus on one of the three optimizations discussed and explain the type of program it would be best suited for and the type of program that it wouldn't be very good with.

If a parser can convert the sequence of input tokens into the goal symbol, then that sequence of tokens is a syntactically ____________________ statement of the language.

The code a compiler produces should be reasonably efficient and concise.

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

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

The output of a scanner is a list of all the _______ 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 token.

The singular goal of compilers is correctness.

Explain what the goal in compiler design today is.

What is the fundamental rule of parsing?

____ is where the compiler polishes and fine-tunes the translation so that it runs a little faster or occupies a little less memory.

In BNF, the syntax of a language is specified as a series of rules . _________________________

Parsing is the first phase of the compilation process. _________________________

____ begins at the productions in the tree that are nearest to the original input tokens.

The Greek character lambda represents ___.

Present what each individual BNF rule looks like, and briefly explain its components.