Exam 6: Syntax
Exam 1: Introduction50 Questions
Exam 2: Language Design Criteria50 Questions
Exam 3: Functional Programming50 Questions
Exam 4: Logic Programming50 Questions
Exam 5: Object-Oriented Programming50 Questions
Exam 6: Syntax50 Questions
Exam 7: Basic Semantics50 Questions
Exam 8: Data Types50 Questions
Exam 9: Control I - Expressions and Statements50 Questions
Exam 10: Control II - Procedures and Environments50 Questions
Exam 11: Abstract Data Types and Modules50 Questions
Exam 12: Formal Semantics50 Questions
Exam 13: Parallel Programming51 Questions
Select questions type
A left-recursive rule for an operation causes it to left-associate.
(True/False)
4.9/5
(32)
Reserved words,or keywords,are not considered to be a typical token category.
(True/False)
4.8/5
(31)
Recursive-descent parsers turn the nonterminals into a group of mutually recursive procedures whose actions are based on the right-hand side of the BNFs.
(True/False)
4.7/5
(34)
The use of a single token to direct a parse is called single-symbol ____.
(Multiple Choice)
5.0/5
(44)
A context-free grammar has a special nonterminal called the ____ symbol which stands for the entire top-level phrase being defined.
(Multiple Choice)
4.8/5
(43)
Words or tokens are called terminals,since they cannot be broken down further.
(True/False)
4.8/5
(37)
The principle of ____ takes the longest possible string of nonblank characters into a single token.
(Multiple Choice)
4.8/5
(38)
The processing of white space is generally handled by a ____.
(Multiple Choice)
4.8/5
(36)
Showing 41 - 50 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)