<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Separating Parsing Expression Grammars using Cell-Probe Lower Bounds · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2608.29592/</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/2608.29592/feed.xml" rel="self" type="application/rss+xml" /><item><title>Separating Parsing Expression Grammars using Cell-Probe Lower Bounds — mentioned by pcfwik</title><link>https://news.ycombinator.com/item?id=49857699</link><guid isPermaLink="false">urn:hackerpapers:mention:2608.29592:49857699</guid><pubDate>Sat, 26 Sep 2026 15:53:03 GMT</pubDate><description>&lt;p&gt;If I understand correctly, one of the recent cool generative AI-assisted results is actually supposed to have closed this problem, complete with a Lean proof! https://arxiv.org/abs/2608.29592&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2608.29592/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item><item><title>Separating Parsing Expression Grammars using Cell-Probe Lower Bounds — HN submission</title><link>https://news.ycombinator.com/item?id=49576789</link><guid isPermaLink="false">urn:hackerpapers:submission:2608.29592:49576789</guid><pubDate>Sat, 05 Sep 2026 14:23:31 GMT</pubDate><description>&lt;p&gt;Separating Parsing Expression Grammars Using Cell-Probe Lower Bounds&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2608.29592/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
