Exam 11: Compilers and Language Translation

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

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

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

Online debuggers help programmers locate and correct errors in programs.

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

Discuss the difference between syntax and semantics and how it's important in how programs are compiled. $\text { <addition operator>}$ ::= +

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

The goal symbol is the final nonterminal.

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

The right-hand side of a BNF rule is the name of a single grammatical category.