/explore
|
You are here 
|
martin.janiczek.cz | ||
| | | | |
craftinginterpreters.com
|
|
| | | | | [AI summary] The text discusses the implementation of a compiler for a simple programming language, focusing on parsing and bytecode generation. It covers topics such as recursive descent parsing, Pratt parsing, and the use of a parser table to handle operator precedence. The text also includes code snippets for the parser and compiler functions, as well as instructions for debugging and testing the compiler. The author emphasizes the importance of error handling and the use of a debug flag to enable the printing of generated bytecode. | |
| | | | |
crockford.com
|
|
| | | | | [AI summary] The provided text is a comprehensive implementation of a parser for a custom programming language, using a Pratt parser (also known as a Top-down operator precedence parser) approach. It includes definitions for various language constructs like constants, statements, functions, and object/array literals, along with error handling and symbol table management. The code is structured around token processing and rule-based parsing for expressions, statements, and blocks. | |
| | | | |
eli.thegreenplace.net
|
|
| | | | | [AI summary] A technical tutorial explaining the Top-Down Operator Precedence (Pratt) parsing algorithm for handling expression grammars. | |
| | | | |
www.yoseph.tech
|
|
| | | This week I am talking about the parts of the compiler, doing a deep dive into the Lexer and Parser and showing how to build the Lexer and Parser in Python. At the end of this post, we should have a working lexer and parser. | ||
