Font size
Worksheetsrees
Total questions: 61
Worksheet time: 46mins
Feature multiplicity increases readability.
True
False
Pure Interpretation was one of the programming domains discussed in class.
True
False
Logical was one of the language evaluation criteria we discussed in class.
False
True
Readability was one of the language evaluation criteria we discussed in class
True
Flase
A language's reliability is based upon its readability, writability, ability to block aliasing, and its ability to perform type checking and exception handling.
True
False
Compilation was one of the programming domains discussed in class.
True
False
Interpreters provide the tradeoff of harder implementation for faster execution
True
False
Business applications was one of the programming domains discussed in class.
True
False
The von Neumann bottleneck is the primary limiting factor in the speed of memory.
True
False
Cost was one of the language evaluation criteria we discussed in class.
True
False
Pure interpretered languages are easier to implement because all run-time error messages can refer to source-level units.
True
False
Systems Programming was one of the programming domains discussed in class.
True
False
The cost of a language is based upon the reliability of the language and the time spent training, writing, maintaining, and executing programs in the language.
True
False
Hybridness was one of the language evaluation criteria we discussed in class.
True
False
A language's reliability is based solely upon its ability to perform type checking and exception handling.
True
False
Register allocation was one of the optimizations discussed in class that some compilers implement.
True
False
Relinking was one of the optimizations discussed in class that some compilers implement.
True
False
Loop optimizations, such as loop expansion, was one of the optimizations discussed in class that some compilers implement.
True
False
Loop optimizations, such as loop expansion, was one of the optimizations discussed in class that some compilers implement
True
False
Copy propagation was one of the optimizations discussed in class that some compilers implement.
True
False
Compilation process order: Lexical analyzer
(a)
Compilation process order: Syntax analyzer
(a)
Compilation process order: Intermediate code generator and semantic analyzer
(a)
Compilation process order: Optimization (optional)
(a)
Compilation process order: Machine code generator
(a)
What is the name of the command to change into a directory?
(a)
What is the name of the command that prints its arguments to the standard output?
(a)
What is the name of the command that shows the contents of a file or files?
(a)
What is the name of the command for paging through text a screenful at a time, forwards or backwards?
(a)
What is the name of the command to remove files permanently?
(a)
What is the symbol(s) for the current directory?
(a)
Well-refinedness was one of the language evaluation critera we discussed in class
True
False
Cost was one of the language evaluation critera we discussed in calss
True
False
Readability is based solely upon the orthogonality of the language
True
False
Writability of a language is based solely upon the language's simplici
True
False
Compilation provides the tradeoff of slow translation for fast execution.
True
False
What is the name of the command that counts the number of lines, words, and characters in a text file?
(a)
The strings that comprise a language built from characters over some alphabet.
(a)
Describes how a valid program is interpreted as sequences of computational steps.
(a)
In BNF, a special element of the nonterminals that often represents a complete program.
(a)
n axiomatic semantics, logic expressions are also known as (a) .
(a) are associated with grammar rules and are also known as semantic functions.
The set of rules that a sequence of characters in a source code file must follow to be considered a conforming programing in that language.
(a)
The name of the assertion before a statement that states the relationships and constraints among variables that are true at that point in execution.
(a)
In BNF, these are used to describe syntactic variables and are often enclosed in angle brackets.
(a)
(a) are associated with grammar symbols and have values assigned to them.
A category of lexemes.
(a)
Use the grammar and denotation semantics below, determine the integer value generated by the string "cba"
Grammar
<abc>::='a'|'b'|'c'
<abc>::=<abc>'a'|<abc>'b'|<abc>'c'
Semantics
Mabc('a')=1
Mabc('b')=4
Mabc('c')=7
Mabc(<abc>'a')=2*Mabc(<abc>)+2
Mabc(<abc>'b')=3*Mabc(<abc>)+1
Mabc(<abc>'c')=1*Mabc(<abc>)+3
(a)
Use the grammar and denotation semantics below, determine the integer value generated by the string "acb"
Grammar
<abc>::='a'|'b'|'c'
<abc>::=<abc>'a'|<abc>'b'|<abc>'c'
Semantics
Mabc('a')=3
Mabc('b')=5
Mabc('c')=6
Mabc(<abc>'a')=2*Mabc(<abc>)+2
Mabc(<abc>'b')=3*Mabc(<abc>)+1
Mabc(<abc>'c')=1*Mabc(<abc>)+3
(a)
Use the grammar and denotation semantics below, determine the integer value generated by the string "acb"
Grammar
<abc>::='a'|'b'|'c'
<abc>::=<abc>'a'|<abc>'b'|<abc>'c'
Semantics
Mabc('a')=1
Mabc('b')=4
Mabc('c')=7
Mabc(<abc>'a')=2*Mabc(<abc>)+2
Mabc(<abc>'b')=3*Mabc(<abc>)+1
Mabc(<abc>'c')=1*Mabc(<abc>)+3
(a)
Use the grammar and denotation semantics below, determine the integer value generated by the string "cab"
Grammar
<abc>::='a'|'b'|'c'
<abc>::=<abc>'a'|<abc>'b'|<abc>'c'
Semantics
Mabc('a')=3
Mabc('b')=5
Mabc('c')=6
Mabc(<abc>'a')=2*Mabc(<abc>)+2
Mabc(<abc>'b')=3*Mabc(<abc>)+1
Mabc(<abc>'c')=1*Mabc(<abc>)+3
(a)
Use the grammar and denotation semantics below, determine the integer value generated by the string "bca"
Grammar
<abc>::='a'|'b'|'c'
<abc>::=<abc>'a'|<abc>'b'|<abc>'c'
Semantics
Mabc('a')=1
Mabc('b')=4
Mabc('c')=7
Mabc(<abc>'a')=2*Mabc(<abc>)+2
Mabc(<abc>'b')=3*Mabc(<abc>)+1
Mabc(<abc>'c')=1*Mabc(<abc>)+3
(a)
[A]?
int x = 12; [A]
[B] int y = x - 8; [C]
[D] cout << y; {y > 4}
(a)
[B]?
int x = 12; [A]
[B] int y = x - 8; [C]
[D] cout << y; {y > 4}
(a)
[C]?
int x = 12; [A]
[B] int y = x - 8; [C]
[D] cout << y; {y > 4}
(a)
[D]?
int x = 12; [A]
[B] int y = x - 8; [C]
[D] cout << y; {y > 4}
(a)
Match the notational conventions for grammars we used while discussing parsers: Terminal Symbols
Lowercase letters at the beginning of the English alphabet. (a, b, c, …)
Uppercase letters at the beginning of the English alphabet. (A, B, C, …)
Uppercase letters at the end of the English alphabet. (W, X, Y, Z)
Lowercase letters at the end of the English alphabet. (w, x, y, z)
Lowercase Greek letters (α, β, γ, δ)
Match the notational conventions for grammars we used while discussing parsers: Nonterminal symbols
Lowercase letters at the beginning of the English alphabet. (a, b, c, …)
Uppercase letters at the beginning of the English alphabet. (A, B, C, …)
Uppercase letters at the end of the English alphabet. (W, X, Y, Z)
Lowercase letters at the end of the English alphabet. (w, x, y, z)
Lowercase Greek letters (α, β, γ, δ)
Match the notational conventions for grammars we used while discussing parser:Terminals or nonterminals
Lowercase letters at the beginning of the English alphabet. (a, b, c, …)
Uppercase letters at the beginning of the English alphabet. (A, B, C, …)
Uppercase letters at the end of the English alphabet. (W, X, Y, Z)
Lowercase letters at the end of the English alphabet. (w, x, y, z)
Lowercase Greek letters (α, β, γ, δ)
Match the notational conventions for grammars we used while discussing parsers: Strings of terminals
Lowercase letters at the beginning of the English alphabet. (a, b, c, …)
Uppercase letters at the beginning of the English alphabet. (A, B, C, …)
Uppercase letters at the end of the English alphabet. (W, X, Y, Z)
Lowercase letters at the end of the English alphabet. (w, x, y, z)
Lowercase Greek letters (α, β, γ, δ)
Match the notational conventions for grammars we used while discussing parsers: Mixed String (terminals and/or nonterminals)
Lowercase letters at the beginning of the English alphabet. (a, b, c, …)
Uppercase letters at the beginning of the English alphabet. (A, B, C, …)
Uppercase letters at the end of the English alphabet. (W, X, Y, Z)
Lowercase letters at the end of the English alphabet. (w, x, y, z)
Lowercase Greek letters (α, β, γ, δ)
