https://hackerpaper.kaipfister.de/p/cs_0112018/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=12504588urn:hackerpapers:mention:cs_0112018:12504588Thu, 15 Sep 2016 09:34:01 GMT<p>Minor technical nitpick for the README: You&#x27;re not moving up the Chomsky hierarchy but rather moving sideways ;). PEGs are non-Chomskyan parsing formalisms, in the sense that the family of languages describable by PEGs are not to be found in the Chomsky hierarchy. For example, they are not regular, as they can match patterns such as a^n b^n. On the other hand, they are also not context-free, as they can also match non-context-free patterns such as a^n b^n c^n. Finally, since PEG can be parsed in linear time, there must also be some CFG which cannot be recognized by any PEG - this follows due…</p><p><a href="https://hackerpaper.kaipfister.de/p/cs_0112018/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CLhttps://news.ycombinator.com/item?id=11977311urn:hackerpapers:mention:cs_0112018:11977311Sat, 25 Jun 2016 18:12:49 GMT<p>It is known that any fast CFG parsing algorithm can be turned into a fast boolean matrix multiplication algorithm. So if CFG parsing was n^2, so is boolean matrix multiplication :) See http://arxiv.org/abs/cs/0112018</p><p><a href="https://hackerpaper.kaipfister.de/p/cs_0112018/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.CL