Exam 10: Compilers and Language Translation

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

One of the possible local optimizations is eliminating unnecessary operations.

Free
(True/False)
4.7/5
(40)
Correct Answer:
Verified

True

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

Free
(True/False)
4.7/5
(37)
Correct Answer:
Verified

False

All high-level programming language statements are translated into machine language code, whether or not they are semantically correct.

Free
(True/False)
4.9/5
(44)
Correct Answer:
Verified

False

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

(Multiple Choice)
4.9/5
(36)

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

(Multiple Choice)
4.9/5
(46)

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

(True/False)
4.8/5
(36)

In the ____ phase, the compiler analyzes the meaning of the tokens making up a programming language statement and tries to understand the actions they perform.

(Multiple Choice)
4.8/5
(34)

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

(True/False)
4.8/5
(38)

The output of a parser is either a parse tree or an error message.

(True/False)
4.7/5
(34)

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

(True/False)
4.9/5
(27)

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

(Multiple Choice)
4.8/5
(31)

On-line debuggers help programmers locate and correct errors in programs.

(True/False)
4.9/5
(34)

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

(Multiple Choice)
4.8/5
(36)

In BNF, ____ are not defined any further by other rules of the grammar.

(Multiple Choice)
4.9/5
(31)

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

(Multiple Choice)
4.8/5
(27)

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

(Multiple Choice)
4.8/5
(29)

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

(Multiple Choice)
4.9/5
(41)

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

(True/False)
4.7/5
(38)

BNF metasymbols are symbols of BNF that are used to describe BNF symbols.

(True/False)
4.8/5
(47)

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

(Multiple Choice)
4.7/5
(37)
Showing 1 - 20 of 50
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)