Skip to content

Eli Bendersky personal blog

Parsing expressions by precedence climbing

eli.thegreenplace.net 9 min read

I've written previously about the problem recursive descent parsers have with expressions, especially when the language has multiple levels of operator precedence.

Read on eli.thegreenplace.net → Archived copy

Points: 0
HN comments: 0
Submissions: 0
Cited by: 10 commenters

Software Engineering Programming Languages 2013

Cited in comments

Linked from 11 Hacker News comments by 10 different people, from Sep 2013 to Dec 2025.

Most recent:

userbinator · Dec 11, 2025
sph · May 24, 2024
dkjaudyeqooe · Feb 21, 2024
sshine · Jan 17, 2023
myk9001 · Oct 21, 2020
catpolice · Dec 15, 2018

Search every comment that links here →

More from Eli Bendersky

All 57 posts →

Making any integer with four 2s

2025368 points172 comments Math & Algorithms details

How I went about learning Rust

2022347 points292 comments Programming Languages details

Better HTTP server routing in Go 1.22

2023316 points229 comments Web & Frontend details

Go hits the concurrency nail on the head

2018284 points304 comments Software Engineering details

Revisiting "Let's Build a Compiler"

2025276 points51 comments Software Engineering details

REST Servers in Go: Part 1 – standard library

2021257 points144 comments Web & Frontend details

Related posts from the same era

Microsoft takes .NET open source and cross-platform

Microsoft News20142,376 points894 comments details

Hacker News API

Y Combinator Blog20141,714 points298 commentscited by 15 details

Light Table - a new IDE concept

Chris Granger20121,592 points291 commentscited by 8 details

Visualizing Algorithms

Mike Bostock20141,557 points129 commentscited by 38 details

I'm learning to code by building 180 websites in 180 days. Today is day 115

Jennifer Dewalt20131,542 points344 commentscited by 5 details

Light Table is now open source

Chris Granger20141,256 points431 comments details