Re:Suckless conference 2015
by userbinator on Sunday November 15, 2015 @10:58AM
(#10569930)
The source reminds me of the BSD one... I'm a little surprised that the parser is a plain recursive-descent one instead of operator-precedence/precedence-climbing[1][2] since the latter definitely feels like something the Suckless philosophy would highly agree with: extremely concise and elegant.
[1] https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm
[2] https://news.ycombinator.com/item?id=8558822