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