Compiler Construction
Springer Berlin (Verlag)
978-3-540-43369-9 (ISBN)
Nigel Horspool is a professor of computer science at the University of Victoria. His main focus for research and teaching has been programming languages and compilers. He is the author or co-author of three books, which cover the C language, Unix and the C sharp language. He is currently the co- editor of the journal ';Software: Practice and Experience';. He has a PhD from the University of Toronto, Canada in Computer Science.
Tool Demonstrations.- LISA: An Interactive Environment for Programming Language Development.- Building an Interpreter with Vmgen.- Compiler Construction Using LOTOS NT.- Analysis and Optimization.- Data Compression Transformations for Dynamically Allocated Data Structures.- Evaluating a Demand Driven Technique for Call Graph Construction.- A Graph-Free Approach to Data-Flow Analysis.- A Representation for Bit Section Based Analysis and Optimization.- Low-Level Analysis.- Online Subpath Profiling.- Precise Exception Semantics in Dynamic Compilation.- Decompiling Java Bytecode: Problems, Traps and Pitfalls.- Grammars and Parsing.- Forwarding in Attribute Grammars for Modular Language Design.- Disambiguation Filters for Scannerless Generalized LR Parsers.- Invited Talk.- Modular Static Program Analysis.- Domain-Specific Languages and Tools.- StreamIt: A Language for Streaming Applications.- Compiling Mercury to High-Level C Code.- CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs.- Energy Consumption Optimizations.- Linear Scan Register Allocation in the Context of SSA Form and Register Constraints.- Global Variable Promotion: Using Registers to Reduce Cache Power Dissipation.- Optimizing Static Power Dissipation by Functional Units in Superscalar Processors.- Influence of Loop Optimizations on Energy Consumption of Multi-bank Memory Systems.- Loop and Array Optimizations.- Effective Enhancement of Loop Versioning in Java.- Value-Profile Guided Stride Prefetching for Irregular Code.- A Comprehensive Approach to Array Bounds Check Elimination for Java.
Erscheint lt. Verlag | 22.3.2002 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XII, 348 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 508 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | Attribut • Compiler Construction • Compiler Optimization • Data Compression • data structures • Exception • Hardcover, Softcover / Informatik, EDV/Programmiersprachen • HC/Informatik, EDV/Programmiersprachen • Java • Language Processing • parsing • program analysis • Program Compilation • programming • Programming Languae Design • Programming language • Programming Language Implementation • Program Tranformation • Text |
ISBN-10 | 3-540-43369-4 / 3540433694 |
ISBN-13 | 978-3-540-43369-9 / 9783540433699 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich