Hacker News: polymipisexphttps://news.ycombinator.com/user?id=polymipisexpHacker News RSShttps://hnrss.org/hnrss v2.1.1Tue, 07 Jul 2026 04:27:52 +0000<![CDATA[New comment by polymipisexp in "Single header Parser Combinators for C"]]>It seems like it would be easy to create such a parser for PEGs, but the semantics here don’t seem like a good fit for context-free grammars where alternation is completely symmetrical.

]]>Wed, 01 Jul 2026 13:20:03 +0000https://news.ycombinator.com/item?id=48746297polymipisexphttps://news.ycombinator.com/item?id=48746297https://news.ycombinator.com/item?id=48746297<![CDATA[New comment by polymipisexp in "KickC is a C-compiler for 6502-based platforms creating readable assembler code"]]>The PDP-11 postincrement thing is very often repeated, and I'm sure there are good reasons to suspect it, but here is one bit of evidence to the contrary I find convincing

https://yarchive.net/comp/c.html

]]>Mon, 10 Jun 2024 08:16:32 +0000https://news.ycombinator.com/item?id=40631326polymipisexphttps://news.ycombinator.com/item?id=40631326https://news.ycombinator.com/item?id=40631326<![CDATA[New comment by polymipisexp in "2023 ACM Turing Prize awarded to Avi Wigderson"]]>Nisan and Wigderson prove many different corollaries of their construction in their seminal 'Hardness vs Randomness' paper but their requirement for general derandomization (P = BPP) is that there's some function f computable in time 2^O(n) such that for some e > 0 for all circuits of size 2^en the correlation between f and the output of the circuit is sufficiently low (if I understand correctly).

]]>Wed, 10 Apr 2024 19:56:31 +0000https://news.ycombinator.com/item?id=39995080polymipisexphttps://news.ycombinator.com/item?id=39995080https://news.ycombinator.com/item?id=39995080