<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Packrat Parsing: Simple, Powerful, Lazy, Linear Time · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0603077/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/cs_0603077/feed.xml" rel="self" type="application/rss+xml" /><item><title>Packrat Parsing: Simple, Powerful, Lazy, Linear Time — mentioned by adev_</title><link>https://news.ycombinator.com/item?id=49208723</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0603077:49208723</guid><pubDate>Fri, 07 Aug 2026 11:22:16 GMT</pubDate><description>&lt;p&gt;&amp;gt; A simple recursive-descent parser is easy to write by hand and runs in linear time. Recursive descenrs parsers are not linear. They are generally O(n^2) and can even can go exponential with some grammars if written naively. It can be pretty easy to do adverserival attacks on most naive descent parser and bring it to its knees. Packrat parser [^1] are linear, but they are by no means &amp;quot;trivial 200 lines&amp;quot; type of parsers. [^1]: https://arxiv.org/abs/cs/0603077&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0603077/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
