1.
Which makes nameless procedures into lexical closures?
A
$
B
C
#'
D
View Answer
Correct Answer: C — #'
Explanation:
#' makes it possible to produce nameless procedures into lexical closures.
Loading practice questions
5 practice sets · Page 1 of 1
Which makes nameless procedures into lexical closures?
$
#'
Correct Answer: C — #'
Explanation:
#' makes it possible to produce nameless procedures into lexical closures.
Which do not produce nested fences?
Variables
Procedure calls
Fences
All of the mentioned
Correct Answer: B — Procedure calls
Explanation:
Procedure calls do not produce nested fences.
Which helps to produce nested fences?
Lets
List
Label
None of the mentioned
Correct Answer: A — Lets
Explanation:
Lets helps to produce nested fences.
Which primitive enables you to define one procedure inside another?
Do
List
Primitive
Labels
Correct Answer: D — Labels
Explanation:
The labels primitive enables you to define one procedure inside another.
Which makes it possible to define sophisticated generator procedures that produce new values?
List
Variables
Encapsulation
None of the mentioned
Correct Answer: C — Encapsulation
Explanation:
Encapsulation makes it possible to define sophisticated generator procedures that produce new values each time they are called.