Deck 11: Compilers and Language Translation

Question 1

____________________ for high-level languages like C++ or Java are very large.

Answer 1

Grammars

Question 2

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

Answer 2

False

Question 3

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

Answer 3

True

Question 4

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.

Question 5

Parsing is the first phase of the compilation process. _________________________

Question 6

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

Question 7

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

Question 8

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

Question 9

One of the possible _______ optimizations is eliminating unnecessary operations.

Question 10

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

Question 11

The goal symbol is the final nonterminal.

Question 12

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

Question 13

The singular goal of compilers is correctness.

Question 14

The English-language sentence, "The orange artichoke flew through the pink eight-legged elephant" is semantically meaningful . _________________________

Question 15

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

Question 16

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.

Question 17

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

Question 18

Online debuggers help programmers locate and correct errors in programs.

Question 19

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

Question 20

A BNF rule is also known as a token.

Question 21

In BNF, the ____ is used to separate two alternative definitions of a nonterminal.

A)forward slash
B)vertical bar
C)backward slash
D)asterisk

Question 22

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

A)Look-ahead
B)Token prediction
C)Down-the-road
D)Recursive

Question 23

During parsing, a compiler deals only with the ____ of a statement.

A)semantics
B)syntax
C)grammar
D)rules

Question 24

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

A)Code generation
B)Parsing
C)Lexical analysis
D)Semantic analysis

Question 25

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

A)ambiguous
B)recursive
C)local
D)global

Question 26

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

A)semantic analysis
B)lexical analysis
C)code optimization
D)code generation

Question 27

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

A)Compilation
B)Generation
C)Optimization
D)Efficiency

Question 28

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

A)language
B)terminal
C)nonterminal
D)rule

Question 29

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

A)object
B)source
C)lexical
D)token

Question 30

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

A)parse tree
B)scanner
C)parser
D)compiler

Question 31

In the ____ phase, the compiler takes the generated code and sees whether it can be made more efficient, either by making it run faster or having it occupy less memory.

A)code optimization
B)parsing
C)lexical analysis
D)semantic analysis and code generation

Question 32

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

A)large
B)small
C)incorrect
D)syntactical

Question 33

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.

A)grammatically
B)algorithmically
C)always
D)syntactically

Question 34

____ is the replacement of slow arithmetic operations with faster ones.

A)Strength reduction
B)Constant evaluation
C)Eliminating unnecessary operations
D)Parse tree construction

Question 35

In _______, a nonterminal is an intermediate grammatical category used to help explain and organize the language.

A)code optimization
B)BNF
C)OOP
D)parsing

Question 36

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

A)debugger
B)reusable code library
C)visual development library
D)integrated development environment

Question 37

The Greek character lambda represents ___.

A)zero
B)the null string
C)the defined string
D)the unknown string

Question 38

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

A)rule
B)production
C)parse tree
D)semantic record

Question 39

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

A)semantic analysis and code generation
B)parsing
C)lexical analysis
D)code optimization

Question 40

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

A)Conciseness
B)Ambiguity
C)Code-aware
D)Efficiency

Question 41

Explain what the goal in compiler design today is.

Question 42

Discuss the difference between syntax and semantics and how it's important in how programs are compiled.
::= +

Question 43

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?

Question 44

What is the fundamental rule of parsing?

Question 45

What are the four phases of compilation?

Question 46

Explain what metasymbols are and discuss their use as part of BNF rules.

Question 47

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

Question 48

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

Question 49

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.

Question 50

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