|
|
Sold Out
Book Categories |
| Myths and facts about the efficient implementation of finite automata and lexical analysis | 1 | |
| Generalised recursive descent parsing and follow-determinism | 16 | |
| Analyzing direct non-local dependencies in attribute grammars | 31 | |
| Storage allocation strategies for recursive attribute evaluators | 50 | |
| Basic-block graphs: living dinosaurs? | 65 | |
| Analysis of loops | 80 | |
| A new approach to control flow analysis | 95 | |
| Flow logics for constraint based analysis | 109 | |
| Extended SSA numbering: introducing SSA properties to languages with multi-level pointers | 128 | |
| Strength reduction via SSAPRE | 144 | |
| Detecting parallelism in C programs with recursive data structures | 159 | |
| Live range splitting in a graph coloring register allocator | 174 | |
| Invited lecture (abstract): Challenges and opportunities visual programming languages bring to programming language research | 188 | |
| Local stack allocation | 189 | |
| A new fast algorithm for optimal register allocation in modulo scheduled loops | 204 | |
| A code motion framework for global instruction scheduling | 219 | |
| VLIW compilation techniques for superscalar architectures | 234 | |
| Issues in translating Smalltalk to Java | 249 | |
| Intermodular slicing of object-oriented programs | 264 | |
| Portable debugging and profiling | 279 | |
| The Eli system | 294 | |
| Lrc - a generator for incremental language-oriented tools | 298 | |
| An extended static checker for Modula-3 | 302 | |
| Cool: a control-flow generator for system analysis | 306 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Michael Huxley
reviewed Compiler Construction, Vol. 138 on November 09, 2016
Compiler Construction, Vol. 138
I read this on the advice of Dr. Eiselt, Dean (at that time) of the College of Computing, after asking him via email "alright, I'm taking classes and whatnot, but I want the Stygian deep; I want to go down as far as I can; I want and need to read those books which have shaped the great computer scientists before me, the real thing." Having probed the shelves of computer science and mathematics since, I remain convinced he could have given no better advice to a precocious freshman. Used for several decades at MIT, this second edition is more than thorough enough for an introduction to computer science anywhere. Taught using the Scheme system (with its close bindings to the type-free λ-calculus), this canonical work covers register machines, logic programming, nondeterministic evaluation, the relations of recursion to iteration, and a wealth of carefully-woven-in jewels from number theory and discrete mathematics. Every programmer thinking himself the real deal owes it to himself to read through this grand work, epic in scope and breathtaking in sudden illuminations.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Compiler Construction, Vol. 138
X
This Item is in Your Inventory
Compiler Construction, Vol. 138
X
You must be logged in to review the productsX
X
X
Add Compiler Construction, Vol. 138, , Compiler Construction, Vol. 138 to the inventory that you are selling on WonderClubX
X
Add Compiler Construction, Vol. 138, , Compiler Construction, Vol. 138 to your collection on WonderClub |