<?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 for Inadvertent incorrectness</title>
	<atom:link href="http://ken.friislarsen.net/blog/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://ken.friislarsen.net/blog</link>
	<description>... but that doesn&#039;t matter, because I turn it into a sexy dance</description>
	<lastBuildDate>Sun, 08 Nov 2009 14:52:59 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Recursive Descent Parsers in C# by Ken</title>
		<link>http://ken.friislarsen.net/blog/2006/09/08/recursive-descent-parsers-in-c/comment-page-1/#comment-292</link>
		<dc:creator>Ken</dc:creator>
		<pubDate>Sun, 08 Nov 2009 14:52:59 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2006/09/08/recursive-decent-parsers-in-c/#comment-292</guid>
		<description>Great idea.

I&#039;ll put the code on github in the near future.</description>
		<content:encoded><![CDATA[<p>Great idea.</p>
<p>I&#8217;ll put the code on github in the near future.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Recursive Descent Parsers in C# by Shannon Braun</title>
		<link>http://ken.friislarsen.net/blog/2006/09/08/recursive-descent-parsers-in-c/comment-page-1/#comment-287</link>
		<dc:creator>Shannon Braun</dc:creator>
		<pubDate>Fri, 06 Nov 2009 19:10:22 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2006/09/08/recursive-decent-parsers-in-c/#comment-287</guid>
		<description>Thought your notes were great.  Did you ever publish the code as a project that could be downloaded.  I have looked and can&#039;t find it. Thanks.</description>
		<content:encoded><![CDATA[<p>Thought your notes were great.  Did you ever publish the code as a project that could be downloaded.  I have looked and can&#8217;t find it. Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on I Am Going to JAOO 2008 As A F# Expert by Ken</title>
		<link>http://ken.friislarsen.net/blog/2008/09/11/i-am-going-to-jaoo-2008-as-a-f-expert/comment-page-1/#comment-704</link>
		<dc:creator>Ken</dc:creator>
		<pubDate>Fri, 19 Sep 2008 10:46:24 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2008/09/11/i-am-going-to-jaoo-2008-as-a-f-expert/#comment-704</guid>
		<description>Hi Robert.

Yes, I saw in your blog that you&#039;re coming to JAOO. Unfortunately, I&#039;ll miss your talk, because I can only participate on Monday and Tuesday.

Looking forward to see you.

Cheers,

--Ken</description>
		<content:encoded><![CDATA[<p>Hi Robert.</p>
<p>Yes, I saw in your blog that you&#8217;re coming to JAOO. Unfortunately, I&#8217;ll miss your talk, because I can only participate on Monday and Tuesday.</p>
<p>Looking forward to see you.</p>
<p>Cheers,</p>
<p>&#8211;Ken</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on I Am Going to JAOO 2008 As A F# Expert by Robert Pickering</title>
		<link>http://ken.friislarsen.net/blog/2008/09/11/i-am-going-to-jaoo-2008-as-a-f-expert/comment-page-1/#comment-705</link>
		<dc:creator>Robert Pickering</dc:creator>
		<pubDate>Fri, 12 Sep 2008 10:59:57 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2008/09/11/i-am-going-to-jaoo-2008-as-a-f-expert/#comment-705</guid>
		<description>Hey I too will be attending JAOO.dk to talk about F#. Look forward to seeing you there.

Cheers,
Rob</description>
		<content:encoded><![CDATA[<p>Hey I too will be attending JAOO.dk to talk about F#. Look forward to seeing you there.</p>
<p>Cheers,<br />
Rob</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Review: The Inmates are  Running the Asylum by Martin</title>
		<link>http://ken.friislarsen.net/blog/2005/03/23/review-the-inmates-are-running-the-asylum/comment-page-1/#comment-113</link>
		<dc:creator>Martin</dc:creator>
		<pubDate>Sun, 13 Jan 2008 14:57:02 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/?p=32#comment-113</guid>
		<description>@Andre Bar&#039;yudin

By reading your comment I conclude that you especially need to read that book. You obviously didn&#039;t get the point...</description>
		<content:encoded><![CDATA[<p>@Andre Bar&#8217;yudin</p>
<p>By reading your comment I conclude that you especially need to read that book. You obviously didn&#8217;t get the point&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Recursive Descent Parsers in C# by Thomas</title>
		<link>http://ken.friislarsen.net/blog/2006/09/08/recursive-descent-parsers-in-c/comment-page-1/#comment-271</link>
		<dc:creator>Thomas</dc:creator>
		<pubDate>Thu, 10 Jan 2008 16:49:10 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2006/09/08/recursive-decent-parsers-in-c/#comment-271</guid>
		<description>Thank you for your comprehensible yet succinct note.
I am certain it will prove helpful in my upcoming RDP project!</description>
		<content:encoded><![CDATA[<p>Thank you for your comprehensible yet succinct note.<br />
I am certain it will prove helpful in my upcoming RDP project!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Recursive Descent Parsers in C# by Clifton</title>
		<link>http://ken.friislarsen.net/blog/2006/09/08/recursive-descent-parsers-in-c/comment-page-1/#comment-270</link>
		<dc:creator>Clifton</dc:creator>
		<pubDate>Sat, 01 Dec 2007 02:11:40 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2006/09/08/recursive-decent-parsers-in-c/#comment-270</guid>
		<description>I much appreciated your note.  I have been looking for something like this because I&#039;m working on a scripting language for a client&#039;s application, implemented in C#; however, it&#039;s built on a very messy ad-hoc parser and while I&#039;ve fixed some bugs, I expect there are likely more.  I had been defining an EBNF grammar for it, and was planning on converting it to an RDP by hand, but I&#039;ll certainly take a good close look at your work because it would eliminate a big chunk of tedious hand-coding.</description>
		<content:encoded><![CDATA[<p>I much appreciated your note.  I have been looking for something like this because I&#8217;m working on a scripting language for a client&#8217;s application, implemented in C#; however, it&#8217;s built on a very messy ad-hoc parser and while I&#8217;ve fixed some bugs, I expect there are likely more.  I had been defining an EBNF grammar for it, and was planning on converting it to an RDP by hand, but I&#8217;ll certainly take a good close look at your work because it would eliminate a big chunk of tedious hand-coding.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Decoding Morse Code With F# Comprehensions by Don Syme</title>
		<link>http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/comment-page-1/#comment-690</link>
		<dc:creator>Don Syme</dc:creator>
		<pubDate>Fri, 16 Nov 2007 19:50:43 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/#comment-690</guid>
		<description>Hi Ken,

Nice code! I&#039;m glad you spotted the sequence expression optimization: that&#039;s very nice.

With regard to performance: we&#039;ve tracked this as bug 1253 in our internal database. The issue has been resolved and the optimizations will be available in the next release. You should see substantial improvements across the board here.

After the optimziations are made the sample code as written becomes dominated by string allocations, and hence the performance is not really a language issue: it becomes more to do with string representations and allocation rates. For example your use of Unicode strings here will mean you pay extra, and perhaps byte strings should be used instead. But as you know the algorithm has room for improvement because of over-allocation.

With regard to sequence expressions, the ideal implementation is to generate C#-style iterator classes. That is something we expect to do at some point: it means certain very elegant sequence expressions will execute extremely efficiently. However, the current performance profile of sequence expressions is good for most applications.

Kind regards
Don</description>
		<content:encoded><![CDATA[<p>Hi Ken,</p>
<p>Nice code! I&#8217;m glad you spotted the sequence expression optimization: that&#8217;s very nice.</p>
<p>With regard to performance: we&#8217;ve tracked this as bug 1253 in our internal database. The issue has been resolved and the optimizations will be available in the next release. You should see substantial improvements across the board here.</p>
<p>After the optimziations are made the sample code as written becomes dominated by string allocations, and hence the performance is not really a language issue: it becomes more to do with string representations and allocation rates. For example your use of Unicode strings here will mean you pay extra, and perhaps byte strings should be used instead. But as you know the algorithm has room for improvement because of over-allocation.</p>
<p>With regard to sequence expressions, the ideal implementation is to generate C#-style iterator classes. That is something we expect to do at some point: it means certain very elegant sequence expressions will execute extremely efficiently. However, the current performance profile of sequence expressions is good for most applications.</p>
<p>Kind regards<br />
Don</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Decoding Morse Code With F# Comprehensions by Ken</title>
		<link>http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/comment-page-1/#comment-692</link>
		<dc:creator>Ken</dc:creator>
		<pubDate>Mon, 12 Nov 2007 21:45:53 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/#comment-692</guid>
		<description>Hi Robert,

I have added links to the python version and the two F# versions I have used.

Note that, I do know that the algorithm that all versions of the program uses is not optimal.  It would, for instance, be better to generate the solutions backwards.  So that suffixes for strings that starts with &lt;code&gt;A&lt;/code&gt; or &lt;code&gt;ET&lt;/code&gt;, for instance, is only generated once.

Let me know your findings.

Cheers,

--Ken</description>
		<content:encoded><![CDATA[<p>Hi Robert,</p>
<p>I have added links to the python version and the two F# versions I have used.</p>
<p>Note that, I do know that the algorithm that all versions of the program uses is not optimal.  It would, for instance, be better to generate the solutions backwards.  So that suffixes for strings that starts with <code>A</code> or <code>ET</code>, for instance, is only generated once.</p>
<p>Let me know your findings.</p>
<p>Cheers,</p>
<p>&#8211;Ken</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Decoding Morse Code With F# Comprehensions by Robert Pickering</title>
		<link>http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/comment-page-1/#comment-691</link>
		<dc:creator>Robert Pickering</dc:creator>
		<pubDate>Sat, 10 Nov 2007 16:23:17 +0000</pubDate>
		<guid isPermaLink="false">http://ken.friislarsen.net/blog/2007/11/09/decoding-morse-code-with-f-comprehensions/#comment-691</guid>
		<description>Hi Ken,

I&#039;d be interested in having the test data you used, it would be difficult to tune the F# program with out this.

Thanks,
Rob</description>
		<content:encoded><![CDATA[<p>Hi Ken,</p>
<p>I&#8217;d be interested in having the test data you used, it would be difficult to tune the F# program with out this.</p>
<p>Thanks,<br />
Rob</p>
]]></content:encoded>
	</item>
</channel>
</rss>
