Explore >> Select a destination

You are here

 willhbr.net
Making a Compiler to Prove tmux Is Turing Complete
| | coredumped.dev
Building an Emacs lisp VM in Rust ? Core Dumped
3.6 parsecs away

Travel
| | Updated: 2023-01-06 About a year ago I was bitten by the PL bug. It started with reading Crafting Interpreters and discovering the wonders hidden under the hood of a compiler. I am also been a big fan of Emacs, and this started to get me interested in how its interpreter works. At the same time, I was reading the Rust book and trying to understand the concepts there. This all came to a head, and I decided to write an Emacs Lisp interpreter called rune in Rust.
| | justin.abrah.ms
Tools I use: Tmux
3.9 parsecs away

Travel
| | [AI summary] The author discusses their extensive use of Tmux, a terminal multiplexer, for tasks like pair programming, managing long-running processes, and customizing its configuration for enhanced productivity.
| | ketansingh.me
Writing a toy compiler with Go and LLVM
3.0 parsecs away

Travel
| | A place for me to share my thoughts, experiences, and insights on technology relevant to enthusiasts and hackers like myself
| | www.engr.mun.ca
Parsing Expressions by Recursive Descent
11.5 parsecs away

Travel
| [AI summary] The text provides a detailed explanation of the precedence climbing algorithm, a method for parsing expressions with operator precedence and associativity. It outlines the algorithm's development, its relation to recursive descent parsing and Pratt parsing, and its implementation in various programming languages and compilers. The text also includes historical context, references to key papers and authors, and acknowledgments for contributions to the algorithm's development.