Algorithms for Compiler Design (Electrical and Computer Engineering Series) [Illustrated] [Paperback]

O G Kakde (Author)

Book Description

Publication Date: December 1, 2002

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.

Editorial Reviews

About the Author

O.G. Kakde is also a faculty member in the Department of Computer Science at Visvesvarya National Institute of Technology. He has done consulting work for the government as well as private organizations in the fields of embedded systems, language translators, WAP, and several programming languages. He is the author of Algorithms for Compiler Design.

Product Details

• Paperback: 334 pages
• Publisher: Charles River Media; 1 edition (December 1, 2002)
• Language: English
• ISBN-10: 1584501006
• ISBN-13: 978-1584501008
• Product Dimensions: 9.3 x 7.4 x 0.9 inches
• Shipping Weight: 1.7 pounds
• Average Customer Review: 1.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #1,361,573 in Books (See Top 100 in Books)
  • #23 in Books > Computers & Technology > Programming > Languages & Tools > Compiler Design

Customer Reviews

Most Helpful Customer Reviews

5 of 5 people found the following review helpful:

1.0 out of 5 stars Incorrect information, March 8, 2006

By 

David Veldof "Twin Cities" (Woodbury, MN. United States) - See all my reviews

This review is from: Algorithms for Compiler Design (Electrical and Computer Engineering Series) (Paperback)

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:

1.0 out of 5 stars Tough to Justify, May 14, 2004

By 

J. Martens (Baltimore Metro Area, USA) - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: Algorithms for Compiler Design (Electrical and Computer Engineering Series) (Paperback)

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.