polymipisexp

3 ms·

1. 1.▲
   by polymipisexp 3mo ago

   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.
2. 2.▲
   by polymipisexp 2y ago

   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
3. 3.▲
   by polymipisexp 2y ago

   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