Exam 11: Compilers and Language Translation

The righthand side of a BNF rule is the name of a single grammatical category.

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.

Building two parse trees implies that the parser has demonstrated correctness in two different ways. _________________________

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

The collection of all statements that can be successfully parsed is called the ____ defined by a grammar.

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

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

Regardless of which programming language is being analyzed, every scanner performs virtually the same set of operations. What are they?

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

A high-level language program is called a(n) ____ program.

If a parser is analyzing a statement in a language and it sees exactly the same sequence of objects that appears on the right-hand side of a BNF rule, what is it allowed to do?

Following ____, the compiler makes a second pass over the parse tree to produce the translated code.

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

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

A high-level language statement is translated into a single machine language instruction.

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

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

The output of a parser is a(n) complete ____________________, or an error message if one cannot be constructed.

What are the four phases of compilation?

The goal symbol is the final nonterminal.