<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Left Recursion in Parsing Expression Grammars · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1207.0443/</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/1207.0443/feed.xml" rel="self" type="application/rss+xml" /><item><title>Left Recursion in Parsing Expression Grammars — mentioned by ltratt</title><link>https://news.ycombinator.com/item?id=10789927</link><guid isPermaLink="false">urn:hackerpapers:mention:1207.0443:10789927</guid><pubDate>Thu, 24 Dec 2015 23:35:44 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re interested in left-recursion in PEGS then, at the risk of gross immodesty, you may be interested in http://tratt.net/laurie/research/pubs/html/tratt__direct_lef... With less risk of immodesty you may also find http://arxiv.org/pdf/1207.0443.pdf?ref=driverlayer.com/web interesting. There&amp;#x27;s probably more recent work than these two papers, but I&amp;#x27;m a little out of date when it comes to the PEG world.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1207.0443/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.FL</category></item></channel></rss>
