Chapter 11-CSIS 110 Question and
answers 100% correct
High-level languages must be translated into machine language before they
can be executed. T/F - True
2. Parsing is the first phase of the compilation process. T/F - False
3. In BNF, the syntax of a language is specified as a series of rules. T/F - True
4. Building two parse trees implies that the parser has demonstrated
correctness in two different ways. T/F - True
5. The English-language sentence, "The orange artichoke flew through the
pink eight-legged elephant" is semantically meaningful. T/F - False
6. 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. - tokens
7. The output of a parser is a(n) complete _______________, or an error
message if one cannot be constructed. - parse tree
8. 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. - valid
9. ____________ for high-level languages like C++ or Java are very large. -
Grammars
, 10. One of the possible _________ optimizations is eliminating unnecessary
operations. - local
11. A high-level language statement is translated into a single machine
language instruction. T/F - False
12. The singular goal of compilers is correctness. T/F - False
13. The code a compiler produces should be reasonably efficient and concise.
T/F - True
14. The input to a scanner is the machine language statement from the source
program. T/F - False
15. A BNF rule is also known as a token. T/F - False
16. The right-hand side of a BNF rule is the name of a single grammatical
category. T/F - False
17. The goal symbol is the final nonterminal. T/F - True
18. A grammar that allows the construction of two or more distinct parse trees
for the same statement is called a recursive grammar. T/F - False
19. Online debuggers help programmers locate and correct errors in
programs. T/F - True
answers 100% correct
High-level languages must be translated into machine language before they
can be executed. T/F - True
2. Parsing is the first phase of the compilation process. T/F - False
3. In BNF, the syntax of a language is specified as a series of rules. T/F - True
4. Building two parse trees implies that the parser has demonstrated
correctness in two different ways. T/F - True
5. The English-language sentence, "The orange artichoke flew through the
pink eight-legged elephant" is semantically meaningful. T/F - False
6. 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. - tokens
7. The output of a parser is a(n) complete _______________, or an error
message if one cannot be constructed. - parse tree
8. 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. - valid
9. ____________ for high-level languages like C++ or Java are very large. -
Grammars
, 10. One of the possible _________ optimizations is eliminating unnecessary
operations. - local
11. A high-level language statement is translated into a single machine
language instruction. T/F - False
12. The singular goal of compilers is correctness. T/F - False
13. The code a compiler produces should be reasonably efficient and concise.
T/F - True
14. The input to a scanner is the machine language statement from the source
program. T/F - False
15. A BNF rule is also known as a token. T/F - False
16. The right-hand side of a BNF rule is the name of a single grammatical
category. T/F - False
17. The goal symbol is the final nonterminal. T/F - True
18. A grammar that allows the construction of two or more distinct parse trees
for the same statement is called a recursive grammar. T/F - False
19. Online debuggers help programmers locate and correct errors in
programs. T/F - True
