Exam 10: Compilers and Language Translation
Exam 1: An Introduction to Computer Science50 Questions
Exam 2: Algorithm Discovery and Design50 Questions
Exam 3: The Efficiency of Algorithms50 Questions
Exam 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates50 Questions
Exam 5: Computer Systems Organization50 Questions
Exam 6: An Introduction to System Software and Virtual Machines50 Questions
Exam 7: Computer Networks, the Internet, and the Worldwide Web50 Questions
Exam 8: Introduction to High-Level Language Programming100 Questions
Exam 9: The Tower of Babel100 Questions
Exam 10: Compilers and Language Translation50 Questions
Exam 11: Models of Computation50 Questions
Exam 12: Simulation and Modeling50 Questions
Exam 13: Electronic Commerce and Information Security50 Questions
Exam 14: Artificial Intelligence50 Questions
Exam 15: Making Decisions About Computers, Information, and Society50 Questions
Select questions type
A ____ is a data structure that stores information about a nonterminal, such as the actual name of the object and its data type.
(Multiple Choice)
4.9/5
(35)
The input to a scanner is the machine language statement from the source program.
(True/False)
4.8/5
(40)
The English-language sentence, "The orange artichoke flew through the elephant" is syntactically incorrect, but semantically meaningful.
(True/False)
4.7/5
(38)
In BNF, a ____ is an intermediate grammatical category used to help explain and organize the language.
(Multiple Choice)
4.7/5
(34)
Following ____, the compiler makes a second pass over the parse tree to produce the code.
(Multiple Choice)
4.8/5
(29)
In BNF, the ____ is used to separate two alternative definitions of a nonterminal.
(Multiple Choice)
4.9/5
(35)
Grammars for high-level languages like C++ or Java are very large.
(True/False)
4.8/5
(34)
In the ____ phase, the compiler examines the individual characters in the source program and groups them into tokens.
(Multiple Choice)
4.9/5
(34)
Nonterminals must appear on the left-hand side of one or more BNF rules.
(True/False)
4.8/5
(41)
The collection of all statements that can be successfully parsed is called the ____ defined by a grammar.
(Multiple Choice)
4.8/5
(45)
A ____ shows how individual tokens can be grouped into predefined grammatical categories until the desired goal is reached.
(Multiple Choice)
4.8/5
(33)
During the compilation process, ____ is the next step after the code generation step.
(Multiple Choice)
4.8/5
(48)
Showing 21 - 40 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)