Programming language concepts 2/E
Programming language concepts 2/E
Programmming languages: design and implementation (2nd ed.)
Programmming languages: design and implementation (2nd ed.)
Crafting a compiler
The Rearranger - A New Assembler Utility
ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Generalized structured programs and loop trees
Science of Computer Programming
Constructing the Call Graph of a Program
IEEE Transactions on Software Engineering
Using mathematics to improve ada compiled code
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
| Hi-index | 0.00 |
In a previous paper, we presented a method of eliminating most procedure call overhead, and most static scoping overhead, in compiling a program written in Ada, or, for that matter, in any language which allows nested procedures. This involves the construction of a loop tree for the call graph of the program; we described this in another earlier paper. Once this is constructed, we make use of a criterion for deciding when a new base register is needed. Suppose that U and V are procedures, with V nested in U. Then the only time a new base register might be needed by V is when there is a loop, in the loop tree, that contains V but not U. This result was stated without proof in the first part of this paper; here we present the proof, after reviewing some basic mathematical concept.