程序设计语言概念(ConceptsofProgrammingLanguages)英文第10版第10章.pptVIP

* * * * * * * Copyright ? 2012 Addison-Wesley. All rights reserved. 1-* Evaluation of Static Chains Problems:1. A nonlocal areference is slow if the nesting depth is large2. Time-critical code is difficult: a. Costs of nonlocal references are difficult to determine b. Code changes can change the  nesting depth, and therefore the cost Copyright ? 2012 Addison-Wesley. All rights reserved. 1-* Blocks Blocks are user-specified local scopes for variables An example in C {int temp; temp = list [upper]; list [upper] = list [lower]; list [lower] = temp } The lifetime of temp in the above example begins when control enters the block An advantage of using a local variable like temp is that it cannot interfere with any other variable with the same name Copyright ? 2012 Addison-Wesley. All rights reserved. 1-* Implementing Blocks Two Methods: Treat blocks as parameter-less subprograms that are always called from the same location Every block has an activation record; an instance is created every time the block is executed 2. Since the maximum storage required for a block can be statically determined, this amount of space can be allocated after the local variables in the activation record Copyright ? 2012 Addison-Wesley. All rights reserved. 1-* Implementing Dynamic Scoping Deep Access: non-local references are found by searching the activation record instances on the dynamic chain - Length of the chain cannot be statically determined - Every activation record instance must  have variable names Shallow Access: put locals in a central place One stack for each variable name Central table with an entry for each variable name Copyright ? 2012 Addison-Wesley. All rights reserved. 1-* Using Shallow Access to Implement Dynamic Scoping void sub3() { int x, z; x = u + v; … } void sub2() { int w, x; … } void sub1() { int v, w; … } void main() { int v, u; … } Copyright ? 2012 Addison-Wesley. All rights reserved. 1-* S