https://hackerpaper.kaipfister.de/p/2309.08717/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=40583671urn:hackerpapers:mention:2309.08717:40583671Wed, 05 Jun 2024 11:31:30 GMT<p>&gt; The ordered choice operator should try all choices, not stop earlier. PEGs made this choice to ensure linear-time parsing. Another example of what I would consider a failure is the PEG grammar: Keyword = &quot;else&quot; / &quot;elseif&quot; This will only match &quot;else&quot;, it will never match &quot;elseif&quot; as the ordered choice will refuse to turn the successful match of &quot;else&quot; into a failure to try the &quot;elseif&quot;. &gt; So I insist, you are using an incorrect parsing tool. I agree that PEG is an incorrect formalization for parsing, as it has highly unintuitive and surprising behaviors like this one. However, I have to…</p><p><a href="https://hackerpaper.kaipfister.de/p/2309.08717/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.FL