News for hackers. Stuff that matters.
Re:Top Down Operator Precedence (1973) by userbinator on Monday May 25, 2015 @10:40AM (#9600195)
I read through the whole thing, but there's something about the writing style which I think makes it rather difficult to follow; even the Dragon Book was more straightforward.

If I'm not mistaken, this article describes the same thing, and it was far easier to read:

https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm

Re:Top Down Operator Precedence (1973) by eliben on Monday May 25, 2015 @01:19PM (#9600854)
It took me a number of readings before I figured it out, back in the day. I summarized my understanding in http://eli.thegreenplace.net/2010/01/02/top-down-operator-pr... -- hope it's helpful
Re:Top Down Operator Precedence (1973) by elFarto on Tuesday May 26, 2015 @02:23PM (#9606591)
Re:Top Down Operator Precedence (1973) by abecedarius on Monday May 25, 2015 @12:35PM (#9600644)
The Pratt/TDOP scheme is a decentralized or OO way to organize the same idea. I coded them both, at https://github.com/darius/sketchbook/blob/master/parsing/pre... and https://github.com/darius/sketchbook/blob/master/parsing/pra...

(My Pratt is smaller than my precedence-climbing here because I ended up actually using the latter, so it got some extras added.)

Re:Top Down Operator Precedence (1973) by agumonkey on Monday May 25, 2015 @12:03PM (#9600519)
Talking about the shunting yard algorithm, it's funny how often trains and railroads have inspired programming concepts. Parsing, concurrency and recently Scott Wlaschin describe monads through railways http://fsharpforfunandprofit.com/posts/recipe-part2/.

ps: while searching for Wlaschin talk I stumbled upon that https://www.google.com/search?q=monad+railway+equipment #rimshot