PLDI 1986
28 papers
- A globalizing transformation for attribute grammars
- A practical arbitrary look-ahead LR parsing technique
- A retargetable instruction reorganizer
- Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars
- Compilation for a high-performance systolic array
- Compile-time partitioning and scheduling of parallel programs
- Data flow analysis for 'intractable' system software
- Direct parallelization of call statements
- Discovering machine-specific code improvements
- EPIC - a retargetable, highly optimizing Lisp compiler
- Effectiveness of a machine-level, global optimizer
- Efficient compilation of linear recursive functions into object level loops
- Efficient incremental evaluation of aggregate values in attribute grammars
- Efficient instruction scheduling for a pipelined architecture
- Generation of run-time environments
- Global register allocation at link time
- Implementing RUSSELL
- Integrating code generation and optimization
- Interprocedural constant propagation
- Interprocedural dependence analysis and parallelization
- Interprocedural optimization: eliminating unnecessary recompilation
- ORBIT: an optimizing compiler for scheme
- Optimal chaining in expression trees
- Register allocation in the SPUR Lisp compiler
- Static evaluation of functional programs
- Transformations of denotational semantics in semantics directed compiler generation
- Unifying view of recent LALR(1) lookahead set algorithms
- Very fast LR parsing