From 3f811670189375319990a8684eb0b057868a875b Mon Sep 17 00:00:00 2001 From: "Brandon C. Irizarry" Date: Fri, 27 Feb 2026 10:39:14 -0500 Subject: Remove TOC from blog posts --- drafts/posts/understanding-pratt-parsing.md | 15 --------------- 1 file changed, 15 deletions(-) (limited to 'drafts/posts/understanding-pratt-parsing.md') diff --git a/drafts/posts/understanding-pratt-parsing.md b/drafts/posts/understanding-pratt-parsing.md index 4c058fe..d88ba88 100644 --- a/drafts/posts/understanding-pratt-parsing.md +++ b/drafts/posts/understanding-pratt-parsing.md @@ -12,15 +12,6 @@ programming language I was designing at the time. +++ -# Table of Contents - -+ [Introduction](#introduction) -+ ["It's like a burrito"](#its-like-a-burrito) -+ [Down To Brass Tacks](#down-to-brass-tacks) -+ [Wanting More](#wanting-more) - - - # Introduction I've forgotten how I came across Pratt parsing specifically. I had @@ -47,8 +38,6 @@ are always used for application terms there.) This time though, I wanted to try something different. And so, rummaging through the internets, I stumbled across Pratt parsing. - - # "It's like a burrito" Understanding Pratt parsing ended up being much harder than I @@ -115,8 +104,6 @@ the current `level`, the while loop exits and `acc` is returned. The algorithm is initialized by calling `parse(0)`. - - # Down To Brass Tacks My approach was to take Eli Bendersky's full source code at the bottom @@ -138,8 +125,6 @@ say you have precedence levels `MULTIPLICATION = 2` and associativity for exponentiation. I found this to be one of the more remarkable aspects of the algorithm. - - # Wanting More To be fair, my calculator app technically doesn't parse arithmetic -- cgit v1.2.3