Writing An Interpreter In Go

Acknowledgments Introduction The Monkey Programming Language & Interpreter Why Go? How to Use this Book Lexing 1.1 - Lexical Analysis 1.2 - Defining Our Tokens 1.3 - The Lexer 1.4 - Extending our Token Set and Lexer 1.5 - Start of a REPL Parsing 2.1 - Parsers 2.2 - Why not a parser generator? 2.3 - Writing a Parser for the Monkey Programming Language 2.4 - Parser's first steps: parsing let statements 2.5 - Parsing Return Statements 2.6 - Parsing Expressions Expressions in Monkey Top Down Operator Precedence (or: Pratt Parsing) Terminology Preparing the AST Implementing the Pratt Parser Identifiers Integer Literals Prefix Operators Infix Operators 2.7 - How Pratt Parsing Works 2.8 - Extending the Parser Boolean Literals Grouped Expressions If Expressions Function Literals Call Expressions Removing TODOs 2.9 - Read-Parse-Print-Loop Evaluation 3.1 - Giving Meaning to Symbols 3.2 - Strategies of Evaluation 3.3 - A Tree-Walking Interpreter 3.4 - Representing Objects Foundation of our Object System Integers Booleans Null 3.5 - Evaluating Expressions Integer Literals Completing the REPL Boolean Literals Null Prefix Expressions Infix Expressions 3.6 - Conditionals 3.7 - Return Statements 3.8 - Abort! Abort! There's been a mistake!, or: Error Handling 3.9 - Bindings & The Environment 3.10 - Functions & Function Calls 3.11 - Who's taking the trash out? Extending the Interpreter 4.1 - Data Types & Functions 4.2 - Strings Supporting Strings in our Lexer Parsing Strings Evaluating Strings String Concatenation 4.3 - Built-in Functions len 4.4 - Array Supporting Arrays in our Lexer Parsing Array Literals Parsing Index Operator Expressions Evaluating Array Literals Evaluating Index Operator Expressions Adding Built-in Functions for Arrays Test-Driving Arrays 4.5 - Hashes Lexing Hash Literals Parsing Hash Literals Hashing Objects Evaluating Hash Literals Evaluating Index Expressions With Hashes 4.6 - The Grand Finale Going Further The Lost Chapter Writing A Compiler In Go Resources Feedback Changelog