In an extended PVM the computation of every run-time address by invoking a function call to traverse the static link chain might prove to be excessively slow if the idea were extended to a native-code generator. Since references to “intermediate” variables are likely to be less frequent than references to “local” or “global” variables, some compilers (for example Turbo Pascal) generate code that unrolls the loop implicit in the base function for such accesses – that is, they generate an explicit sequence of N assignments, rather than a loop that is performed N times – thereby sacrificing a marginal amount of space to obtain speed. Explore the implications and implementation of this idea