Exploring the c4... compiler?
This week I found myself digging through the code of c4, an implementation of C “in four functions”, by Robert Swierczek. I remember coming across c4 when it was released ten years ago. It got me excited: hey, C in four functions, that means it’s easy to understand right? That excitement turned into “oh, I see” as soon as I scrolled through the code. c4 is dense, barely commented, and, frankly, st
Compiling higher order functions with GADTs
Implementing first class functions in a bytecode interpreter is trivial. But how do compilers that generate machine code (or lower to C, or SSA) implement higher order functions? Back in 2021, I found an answer when contributing closures to the Pallene compiler. Today I was researching something loosely related, and found yet another neat trick called defunctionalization in this paper. Defunctiona
Lila: a Lil Interpreter in POSIX AWK
Lila: a Lil Interpreter in POSIX AWK AWK is among the most ubiquitous programming languages in the world. Much like ed, the standard text editor, awk is a mandatory component of any POSIX operating system. On a fresh-out-of-the-box Mac, tunneling into the embedded Linux environment on your router, or scrabbling away at GitBash on a Windows machine, you may not have access to Python, Perl, or even
The life and times of an Abstract Syntax Tree
By Francesco Bertolaccini You’ve reached computer programming nirvana. Your journey has led you down many paths, including believing that God wrote the universe in LISP, but now the truth is clear in your mind: every problem can be solved by writing one more compiler. It’s true. Even our soon-to-be artificially intelligent overlords are nothing but compilers, just as the legends foretold. That sma
Parsing and all that
Hello again! I’m picking up my series on Automata, with this post that goes into what I had always meant to get to: parsers. We’ll check out the old-school linear time parsing algorithms, which only need to go over the input once, without backtracking or caching. We’ll check out LL and LR, parse tables, recursive descent and recursive ascent. Welcome to the world of deterministic parsing… Refreshe
How to write a code formatter
I suspect it's not so much that gofmt in itself is a particular noteworthy formatter (other than not allowing you to configure it in any way, as it should be), but rather that Go itself is incredibly popular and thus subjected many developers to the beauty of not having to worry about manually formatting your code. This then caught on over time, resulting in an increase in the number of available
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
How bad is LLVM really?
How bad is LLVM really? | Lobsters
GitHub - rswier/c4: C in four functions
Exploring the c4... compiler? | Lobsters
Compiling higher order functions with GADTs | Lobsters
Decker/tools/awk at main · JohnEarnest/Decker
Lila: A Lil Interpreter in Posix Awk | Hacker News
Lila: a Lil Interpreter in Awk | Lobsters
The life and times of an Abstract Syntax Tree | Lobsters
https://waxc.netlify.app/
Wax compiler – a tiny language designed to transpile to other languages | Hacker News
Parsing and all that | Hacker News
GitHub - yorickpeterse/pattern-matching-in-rust: Pattern matching and exhaustiveness checking algorithms implemented in Rust
How to write a code formatter | Lobsters