Title Aho - Compilers - Principles, Techniques, and Tools 2e.pdf ✅

Second Edition Alfred V. Aho Columbia University Monica S. Lam Stanford University Ravi Sethi Ava ya Jeffrey D. Ullman Stanford University Boston San Francisco NewYork London Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Paris Cape Town Hong Kong Montreal
Publisher Executive Editor Acquisitions Editor Project Editor Associate Managing Editor Cover Designer Digital Assets Manager Media Producer Senior Marketing Manager Marketing Assistant Senior Author Support1 Technology Specialist Senior Manufacturing Buyer Cover Image Greg Tobin Michael Hirsch Matt Goldstein Katherine Harutunian Jeffrey Holcomb Joyce Cosentino Wells Marianne Groth Bethany Tidd Michelle Brown Sarah Milmore Joe Vetere Carol Melville Scott Ullman of Strange Tonic Productions (www. strangetonic.com) Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and Addison-Wesley was aware of a trademark claim, the designations have been printed in initial caps or all caps. This interior of this book was composed in L*T~X. Library of Congress Cataloging-in-Publication Data Compilers : principles, techniques, and tools 1 Alfred V. Aho ... [et al.]. -- 2nd ed. p. cm. Rev. ed. of: Compilers, principles, techniques, and tools / Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman. 1986. ISBN 0-32 1-4868 1 - 1 (alk. paper) 1. Compilers (Computer programs) I. Aho, Alfied V. 11. Aho, Alfred V. Compilers, principles, techniques, and tools. QA76.76.C65A37 2007 005.4'53--dc22 2006024333 Copyright O 2007 Pearson Education, Inc. All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher. Printed in the United States of America. For information on obtaining permission for use of material in this work, please submit a written request to Pearson Education, Inc., Rights and Contracts Department, 75 Arlington Street, Suite 300, Boston, MA 021 16, fax your request to 61 7-848-7047, or e-mail at http://www .pearsoned.com/legal/permissions.htm.
Preface In the time since the 1986 edition of this book, the world of compiler design has changed significantly. Programming languages have evolved to present new compilation problems. Computer architectures offer a variety of resources of which the compiler designer must take advantage. Perhaps most interestingly, the venerable technology of code optimization has found use outside compilers. It is now used in tools that find bugs in software, and most importantly, find security holes in existing code. And much of the "front-end" technology - grammars, regular expressions, parsers, and syntax-directed translators - are still in wide use. Thus, our philosophy from previous versions of the book has not changed. We recognize that few readers will build, or even maintain, a compiler for a major programming language. Yet the models, theory, and algorithms associ- ated with a compiler can be applied to a wide range of problems in software design and software development. We therefore emphasize problems that are most commonly encountered in designing a language processor, regardless of the source language or target machine. Use of the Book It takes at least two quarters or even two semesters to cover all or most of the material in this book. It is common to cover the first half in an undergraduate course and the second half of the book - stressing code optimization - in a second course at the graduate or mezzanine level. Here is an outline of the chapters: Chapter 1 contains motivational material and also presents some background issues in computer architecture and programming-language principles. Chapter 2 develops a miniature compiler and introduces many of the impor- tant concepts, which are then developed in later chapters. The compiler itself appears in the appendix. Chapter 3 covers lexical analysis, regular expressions, finite-state machines, and scanner-generator tools. This material is fundamental to text-processing of all sorts.