<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: A partial retraction to my last entry</title>
	<atom:link href="http://blog.reverberate.org/2008/07/29/a-partial-retraction-to-my-last-entry/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.reverberate.org/2008/07/29/a-partial-retraction-to-my-last-entry/</link>
	<description>parsing, performance, minimalism with C99</description>
	<lastBuildDate>Wed, 05 May 2010 20:14:07 -0700</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.6</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Matt Brubeck</title>
		<link>http://blog.reverberate.org/2008/07/29/a-partial-retraction-to-my-last-entry/comment-page-1/#comment-1004</link>
		<dc:creator>Matt Brubeck</dc:creator>
		<pubDate>Tue, 29 Jul 2008 15:41:06 +0000</pubDate>
		<guid isPermaLink="false">http://blog.reverberate.org/2008/07/29/a-partial-retraction-to-my-last-entry/#comment-1004</guid>
		<description>&quot;So although my result isn’t as theoretically significant as I thought, I think that from a practical standpoint I’m still in good shape: I have a terminating algorithm that can handle a very useful set of grammars.&quot;

If you&#039;re after &lt;em&gt;theoretically significant&lt;/em&gt;, all you need to do is come up with a name (&quot;LL(haberman)&quot;) and ideally some proofs or properties for the set of grammars your new algorithm &lt;em&gt;does&lt;/em&gt; recognize.</description>
		<content:encoded><![CDATA[<p>&#8220;So although my result isn’t as theoretically significant as I thought, I think that from a practical standpoint I’m still in good shape: I have a terminating algorithm that can handle a very useful set of grammars.&#8221;</p>
<p>If you&#8217;re after <em>theoretically significant</em>, all you need to do is come up with a name (&#8221;LL(haberman)&#8221;) and ideally some proofs or properties for the set of grammars your new algorithm <em>does</em> recognize.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
