Explore >> Select a destination
|
You are here 
|
craftinginterpreters.com | ||
| | | | |
abhinavsarkar.net
|
|
| | | | | We write a fast bytecode VM for arithmetic in Haskell. | |
| | | | |
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. | |
| | | | |
cronokirby.com
|
|
| | | | | - Read more: https://cronokirby.com/posts/2020/12/haskell-in-haskell-3/ | |
| | | | |
dusty.phillips.codes
|
|
| | | In earlier articles, we have implemented a tokenizer, parser, and transformer to convert the Web Assembly Text Format to an Abstract Syntax Tree that can hopefully easily compile to Wasm. Truthfully, the next step should be validation. Validation is the process of statically analyzing the syntax tree to catch as many errors as possible. This is where things like type checking and borrow checking happen, for example. The wasm spec has an in-depth description of what validation should look like for a conforming compiler. | ||
