As an outcome of the author's many years of study, teaching, and research in the field of Compilers, and his constant interaction with students, this well-written book magnificently presents both the theory and the design techniques used in Compiler Designing. The book introduces the readers to compilers and their design challenges and describes in detail the different phases of a compiler. The book acquaints the students with the tools available in compiler designing. As the process of compiler designing essentially involves a number of subjects such as Automata Theory, Data Structures, Algorithms, Computer Architecture, and Operating System, the contributions of these fields are also emphasized. Various types of parsers are elaborated starting with the simplest ones such as recursive descent and LL to the most intricate ones such as LR, canonical LR, and LALR, with special emphasis on LR parsers. The new edition introduces a section on Lexical Analysis discussing the optimization techniques for the Deterministic Finite Automata (DFA) and a complete chapter on Syntax-Directed Translation, followed in the compiler design process. Designed primarily to serve as a text for a one-semester course in Compiler Design for undergraduate and postgraduate students of Computer Science, this book would also be of considerable benefit to the professionals. KEY FEATURES • This book is comprehensive yet compact and can be covered in one semester. • Plenty of examples and diagrams are provided in the book to help the readers assimilate the concepts with ease. • The exercises given in each chapter provide ample scope for practice. • The book offers insight into different optimization transformations. • Summary, at end of each chapter, enables the students to recapitulate the topics easily. TARGET AUDIENCE • BE/B.Tech/M.Tech: CSE/IT • M.Sc (Computer Science)