The source reminds me of the BSD one... I&#x27;m a little surprised that the parser is a plain recursive-descent one instead of operator-precedence&#x2F;precedence-climbing[1][2] since the latter definitely feels like something the Suckless philosophy would highly agree with: extremely concise and elegant.<p>[1] <a href="https:&#x2F;&#x2F;www.engr.mun.ca&#x2F;~theo&#x2F;Misc&#x2F;exp_parsing.htm" rel="nofollow">https:&#x2F;&#x2F;www.engr.mun.ca&#x2F;~theo&#x2F;Misc&#x2F;exp_parsing.htm</a><p>[2] <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=8558822" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=8558822</a>