Question 1

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

Accepted Answer

Grammars

Question 2

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

Accepted Answer

Local optimization focuses on finding the best solution in a local neighborhood of the problem space, which is generally easier and requires less computational effort than global optimization, which seeks the best solution across the entire problem space.

Question 3

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

Accepted Answer

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

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.

Accepted Answer

The answer of If a parser can convert the sequence...

Question 5

Parsing is the first phase of the compilation process. _________________________

Accepted Answer

Lexical analysis or scanning is the first phase of the compilation process, where the source code is converted into tokens. Parsing comes after this phase, where the tokens are analyzed to ensure they follow the language's syntax rules.

Question 6

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

Accepted Answer

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

Question 7

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

Accepted Answer

The right-hand side of a BNF (Backus-Naur Form) rule can consist of multiple grammatical categories, terminal symbols, and/or other production rules, not just a single grammatical category.

Question 8

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

Accepted Answer

The input to a scanner is the source code written in a high-level programming language, not machine language. The scanner's role is to read this source code and convert it into tokens for further processing by the compiler.

Question 9

One of the possible _______ optimizations is eliminating unnecessary operations.

Accepted Answer

The answer of One of the possible _______ optimizations is...

Question 10

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

Accepted Answer

In Backus-Naur Form (BNF), the syntax of a programming language or any formal language is indeed specified as a series of production rules, each defining a symbol in terms of other symbols.

Question 11

The goal symbol is the final nonterminal.

Accepted Answer

The goal symbol is the nonterminal that represents the entire grammar. It is the starting point for the parser, and it is the final symbol that is produced when the parser has successfully parsed the input.

Question 12

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

Accepted Answer

A compiler is designed to translate high-level source code into machine code or intermediate code that is efficient and concise, optimizing for performance and resource usage.

Question 13

The singular goal of compilers is correctness.

Accepted Answer

While correctness is a crucial goal, compilers also aim for optimization and efficiency in the code they generate, among other objectives.

Question 14

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

Accepted Answer

The sentence lacks semantic meaning because it assembles words in a way that does not correspond to any plausible reality or logical construct, involving an artichoke flying and an eight-legged elephant, which are nonsensical concepts.

Question 15

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

Accepted Answer

A high-level language statement often translates to multiple machine language instructions, as high-level languages are more abstract and require more detailed instructions for the computer to execute the same task.

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.

Accepted Answer

The answer of The output of a scanner is a...

Question 17

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

Accepted Answer

The answer of The output of a parser is a(n)complete...

Question 18

Online debuggers help programmers locate and correct errors in programs.

Accepted Answer

Online debuggers are tools that assist programmers in identifying and fixing errors or bugs in their code by allowing them to execute their programs step by step, examine variable values, and understand the flow of execution.

Question 19

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

Accepted Answer

High-level languages are designed to be easy for humans to read and write, but computers can only execute instructions in machine language. Therefore, programs written in high-level languages must be translated into machine language through a process involving compilers or interpreters before they can be executed by a computer.

Question 20

A BNF rule is also known as a token.

Accepted Answer

A BNF (Backus-Naur Form) rule defines the syntax of a language, specifying how its sentences are constructed, rather than representing a single lexical item or token.

Quiz 11: Compilers and Language Translation