Despite using them every day, most software engineers know little about how programming languages are designed and implemented. For many, their only experience with that corner of computer science was a terrifying "compilers" class that they suffered through in undergrad and tried to blot from their memory as soon as they had scribbled their last NFA to DFA conversion on the final exam.
That fearsome reputation belies a field that is rich with useful techniques and not so difficult as some of its practitioners might have you believe. A better understanding of how programming languages are built will make you a stronger software engineer and teach you concepts and data structures you'll use the rest of your coding days. You might even have fun.
This book teaches you everything you need to know to implement a full-featured, efficient scripting language. You’ll learn both high-level concepts around parsing and semantics and gritty details like bytecode representation and garbage collection. Your brain will light up with new ideas, and your hands will get dirty and calloused.
Starting from main(), you will build a language that features rich syntax, dynamic typing, garbage collection, lexical scope, first-class functions, closures, classes, and inheritance. All packed into a few thousand lines of clean, fast code that you thoroughly understand because you wrote each one yourself.
Author(s): Robert Nystrom
Edition: 1
Publisher: Genever Benning
Year: 2021
Language: English
Pages: 639
Tags: Interpreters; Compilers;
WELCOME
1. Introduction
2. A Map of the Territory
3. The Lox Language
A TREE-WALK INTERPRETER
4. Scanning
5. Representing Code
6. Parsing Expressions
7. Evaluating Expressions
8. Statements and State
9. Control Flow
10. Functions
11. Resolving and Binding
12. Classes
13. Inheritance
14. Chunks of Bytecode
15. A Virtual Machine
16. Scanning on Demand
17. Compiling Expressions
18. Types of Values
19. Strings
20. Hash Tables
21. Global Variables
22. Local Variables
23. Jumping Back and Forth
24. Calls and Functions
25. Closures
26. Garbage Collection
27. Classes and Instances
28. Methods and Initializers
29. Superclasses
30. Optimization
BACKMATTER
Appendix I
Appendix II
Blank Page