Have one to sell? Sell yours here
Algorithms for Compiler Design (Charles River Media Computer Engineering)
 
See larger image
 
Tell the Publisher!
I’d like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Algorithms for Compiler Design (Charles River Media Computer Engineering) [Illustrated] [Paperback]

O. G. Kakde


Available from these sellers.


Amazon.co.uk Trade-In Store
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Visit the Amazon.co.uk Trade-In Store for more details.

Product details


Product Description

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.

Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organise and find favourite items.
Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:  2 reviews
5 of 5 people found the following review helpful
Incorrect information 9 Mar 2006
By Twin Cities - Published on Amazon.com
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?
7 of 10 people found the following review helpful
Tough to Justify 14 May 2004
By J. Martens - Published on Amazon.com
Amazon Verified Purchase
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.

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Listmania!

Create a Listmania! list

Look for similar items by category


Look for similar items by subject


Feedback