This book is highly accessible to both computer science students and programme The approach is similar to that taken by Tanenbaum for operating systems in the C-language code that implements all algorithms.
Table of Contents
Preface. Basic Concepts. Input and Lexical Analysis. Context-Free Grammars. Top-Down Parsing. Bottom-Up Parsing. Code Generation. Optimization Strategies. Appendix A: Support Functions. Appendix B: Notes on Pascal Compilers. Appendix C: A Grammar for C. Appendix D: LEX. Appendix E: LLama and Occs. Appendix F: A C-code Summary. Bibliography. Index. Cross Reference by Symbol.