Explore >> Select a destination
|
You are here 
|
dusty.phillips.codes | ||
| | | | |
blog.scottlogic.com
|
|
| | | | | Have you ever wanted to write your own compiler? ... yes? ... of course you have! I've always wanted to have a go at writing a compiler, and with the recent release of WebAssembly, I had the perfect excuse to have a go. | |
| | | | |
matklad.github.io
|
|
| | | | | In this tutorial, I will explain a particular approach to parsing, which gracefully handles syntax errors and is thus suitable for language servers, which, by their nature, have to handle incomplete and invalid code. Explaining the problem and the solution requires somewhat less than a trivial worked example, and I want to share a couple of tricks not directly related to resilience, so the tutorial builds a full, self-contained parser, instead of explaining abstractly just the resilience. | |
| | | | |
patshaughnessy.net
|
|
| | | | | [AI summary] The article explains how the Crystal compiler parses code by breaking it down into tokens and constructing an abstract syntax tree (AST), highlighting the recursive process and the challenges of reading code one token at a time. | |
| | | | |
v8.dev
|
|
| | | JavaScript regular expressions are getting some new functionality: lookbehind assertions. | ||
