

Recent
Coverage checkers
·2406 words·12 mins
This post introduces pattern‐match coverage checking in Vig, showing how Luc Maranget’s constructor‑matrix algorithm can be implemented in Rust to detect unreachable arms and guarantee exhaustiveness at compile time without any runtime cost.
Lexing Numbers in Multiple Bases
Why and how to support hexadecimal, octal, and binary literals in your lexer. Improve dev experience by validating and parsing multiple bases at compile time.
The Shunting Yard algorithm
Exploring the Shunting Yard algorithm, how does it parse infix expressions into postfix or AST form, with insights into handling precedence, associativity, and extensions for unary operators and functions.
Coding before AI
AI’s arrival has shifted coding from forum deep-dives and trial-and-error to “vibe coding,” where LLMs handle boilerplate and prototyping but lack true understanding.