Klaus Brouwer, Wolfgang Gellerich, Erhard Ploedereder (auth.), Kai Koskimies (eds.)3540643044, 9783540643043
Table of contents :
Myths and facts about the efficient implementation of finite automata and lexical analysis….Pages 1-15
Generalised recursive descent parsing and follow-determinism….Pages 16-30
Analyzing direct non-local dependencies in attribute grammars….Pages 31-49
Storage allocation strategies for recursive attribute evaluators….Pages 50-64
Basic-block graphs: Living dinosaurs?….Pages 65-79
Analysis of loops….Pages 80-94
A new approach to control flow analysis….Pages 95-108
Flow logics for constraint based analysis….Pages 109-127
Extended SSA mumbering: Introducing SSA properties to languages with multi-level pointers….Pages 128-143
Strength reduction via SSAPRE….Pages 144-158
Detecting parallelism in C programs with recursive data structures….Pages 159-173
Live range splitting in a graph coloring register allocator….Pages 174-187
Challenges and opportunities visual programming languages bring to programming language research….Pages 188-188
Local stack allocation….Pages 189-203
A new fast algorithm for optimal register allocation in modulo scheduled loops….Pages 204-218
A code motion framework for global instruction scheduling….Pages 219-233
VLIW compilation techniques for superscalar architectures….Pages 234-248
Issues in translating Smalltalk to Java….Pages 249-263
Intermodular slicing of object-oriented programs….Pages 264-278
Portable debugging and profiling….Pages 279-293
The Eli system….Pages 294-297
Lrc — a generator for incremental language-oriented tools….Pages 298-301
An extended static checker for modula-3….Pages 302-305
Cool: A control-flow generator for system analysis….Pages 306-309
Reviews
There are no reviews yet.