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.
Posts
Welcome to my Blog Posts!
Here you’ll find everything I’m excited to share, from deep dives into systems software and compiler design to personal reflections and project highlights.
Whether you’re here for technical guides or stories from my journey as a CS student at KU Leuven, I hope you’ll learn something new (and maybe have a little fun along the way).
Here you’ll find everything I’m excited to share, from deep dives into systems software and compiler design to personal reflections and project highlights.
Whether you’re here for technical guides or stories from my journey as a CS student at KU Leuven, I hope you’ll learn something new (and maybe have a little fun along the way).
Feel free to browse by tag or date, and don’t hesitate to reach out if something sparks your interest.
Stay curious and happy reading! 📚✨
2025
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.