/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 austinhenley.com
Let's make a Teeny Tiny compiler, part 3 - Austin Z. Henley
| | mko.re
A Dynamic Forth Compiler for WebAssembly
1.7 parsecs away

Travel
| | [AI summary] The author shares an experimental hobby project involving a Forth compiler and interpreter for WebAssembly, discussing its design, implementation details, and performance benchmarks against native and JavaScript versions.
| | thomascountz.com
Entry-level Compiler - Thomas Countz
1.4 parsecs away

Travel
| | [AI summary] The article discusses the development of a markdown-to-HTML compiler called markie, explaining the core steps of compiler architecture including lexical analysis, parsing, and target code emission, with examples using Ruby and real-world applications.
| | cowlark.com
Live coding a compiler for CP/M, from scratch
1.3 parsecs away

Travel
| | [AI summary] A developer documents live coding a minimal, fast, one-pass compiler for an Ada-inspired 8-bit language from scratch.
| | rcoh.me
No Magic: Regular Expressions
21.6 parsecs away

Travel
| The code for this post, as well as the post itself, are on github. This post is part 1 of a 3 part series. Part 1: Parsing Part 2: Generate an NFA Part 3: Evaluate an NFA Until recently, regular expressions seemed magical to me. I never understood how you could determine if a string matched a given regular expression. Now I know! Here's how I implemented a basic regular expression engine in under 200 lines of code.