|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $54.95Amazon.com's Price: $40.11 You Save: $14.84 (27%)Prices subject to change.
Availability: Usually ships in 10 to 14 days
This item ships for FREE with Super Saver Shipping.
Binding: Paperback
Dewey Decimal Number: 005
EAN: 9781584501008
Edition: 1
ISBN: 1584501006
Label: Charles River Media
Manufacturer: Charles River Media
Number Of Items: 1
Number Of Pages: 334
Publication Date: December 01, 2002
Publisher: Charles River Media
Studio: Charles River Media
Related Items:
Browse for similar items by category:
Editorial Review:
Product Description:
A compiler translates a high-level language program into a functionally equivalent low-level language program that can be understood and executed by the computer. Crucial to any computer system, effective compiler design is also one of the most complex areas of system development. Before any code for a modern compiler is even written, many students and even experienced programmers have difficulty with the high-level algorithms that will be necessary for the compiler to function. Written with this in mind, Algorithms for Compiler Design teaches the fundamental algorithms that underlie modern compilers. The book focuses on the "front-end" of compiler design: lexical analysis, parsing, and syntax. Blending theory with practical examples throughout, the book presents these difficult topics clearly and thoroughly. The final chapters on code generation and optimization complete a solid foundation for learning the broader requirements of an entire compiler design.
KEY FEATURES:
* Focuses on the "front-end" of compiler design—lexical analysis, parsing, and syntax—topics basic to any introduction to compiler design
* Covers storage management and error handling and recovery
* Introduces important "back-end" programming concepts, including code generation and optimization
Average Rating: 
Rating: -
First the good news. This is a high quality production. Acid free paper and excellent type font. The section on Finite Automata Regular expressions is pretty good.
It all goes horribly wrong in the section on "Top down parsing".The author "explains" that a recursive descent parser may have to back track. He then wastes 20 pages describing a back tracking parser. Lastly he mentions LL(k) grammars but doesn't make the connection to recursive descent parsers.
There is no excuse for this shoddiness. This stuff has been around since the late 60's early 70's. It's described in every Textbook since then. Why is this bad information promulgated in a publication written in 2002?
Rating: -
There are a lot of compiler books out there--many of which are quite good--and reading the back cover and the preface provide no clue as to why the author or publisher thought one would prefer this book over another. It's pretty obviously fleshed out (very slightly) from lecture notes, overly terse, not well written, and not well edited. I'd avoid this--Appel and the dragon book are both much, much better.
Availability: Usually ships in 10 to 14 days
|
Amazon Store 