Addison-Wesley Series in Computer Science

A primer for everyday people who are interested in algorithms and how they impact our digital lives. Based on the fact that we already live in a world where algorithms are behind most of the technology we use, this book offers eye-opening information on the pervasiveness and importance of this mathematical science--how it plays out in our everyday digestion of news and entertainment, as well as in its influence on our social interactions and consumerism. Readers even learn how to program an algorithm using Python--Publsiher's description.

This book covers topics related to the functionality and design of compilers, including: - Compiler structure - Lexical analysis (including regular expressions and finite automata) - Syntax analysis (including context-free grammars, LL parsers, bottom-up parsers, and LR parsers) - Syntax-directed translation - Type checking (including type conversions and polymorphism) - Run-time environment (including parameter passing, symbol tables, and storage allocation) - Code generation (including intermediate code generation) - Code optimization

"This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--BOOK JACKET.