Code Generation and Storage Allocation for Machines with Span-Dependent Instructions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Assembling code for machines with span-dependent instructions
Communications of the ACM
The Design of an Optimizing Compiler
The Design of an Optimizing Compiler
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Design of an optimizing, dynamically retargetable compiler for common Lisp
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Retargetable Compiler Code Generation
ACM Computing Surveys (CSUR)
A Formal Framework for the Derivation of Machine-Specific Optimizers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Description-driven code generation using attribute grammars
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An implementation of a code generator specification language for table driven code generators
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
| Hi-index | 0.00 |
The assembled length of a span-dependent jump instruction depends on the distance between the instruction and its target. Such instructions are found on many computers and typically have two forms, long and short. We consider the problem of minimizing object program length for such machines by chaining together jumps with the same target. Although the problem is NP-complete in its most general form, several mildly restricted forms of the problem exist that are of practical importance and have efficient solutions.