Behdad Esfahbod's daily notes on GNOME, Pango, Fedora, Persian Computing, Bob Dylan, and Dan Bern!

My Photo
Location: Toronto, Ontario, Canada

Ask Google.

Contact info
Hacker Emblem Become a Friend of GNOME I Power Blogger
follow me on Twitter
July 2003
August 2003
October 2003
November 2003
December 2003
March 2004
April 2004
May 2004
July 2004
August 2004
September 2004
November 2004
March 2005
April 2005
May 2005
June 2005
July 2005
August 2005
September 2005
October 2005
November 2005
December 2005
January 2006
February 2006
March 2006
April 2006
May 2006
June 2006
July 2006
August 2006
September 2006
October 2006
November 2006
December 2006
January 2007
February 2007
March 2007
April 2007
May 2007
June 2007
July 2007
August 2007
September 2007
October 2007
November 2007
December 2007
January 2008
February 2008
March 2008
April 2008
May 2008
June 2008
July 2008
August 2008
October 2008
November 2008
December 2008
January 2009
March 2009
April 2009
May 2009
June 2009
July 2009
August 2009
November 2009
December 2009
March 2010
April 2010
May 2010
June 2010
July 2010
October 2010
November 2010
April 2011
May 2011
August 2011
September 2011
October 2011
November 2011
November 2012
June 2013
January 2014
May 2015
Current Posts
McEs, A Hacker Life
Monday, March 06, 2006
 Misc Points

It's on slashdot now: Toronto to become one huge hotspot. Yay!

I'm happy to see people feeling that GNOME 2.14 is faster. Means that weeks of our optimization work is worth more than "you rock!" comments. (-:

I think Calum has a point about the C++ template thing. He's absolutely right, the C++ compiler cannot determine whether a C++ source code can be compiled in a finite time or will loop forever... That's indeed an obvious result of being Turing-complete. The C preprocessor on the other hand, has been designed carefully enough to not let such a thing in. It's at best a pushdown automata (whose states being the defined macros and their values that can take a finite different values, and the #include stack.) As a result, you can write a C preprocessor that will either process the input, or decide that it will loop forever without putting an arbitrary limit on the recursion depth. At that point you may do what Python does and refuse to get into the infinite recursion and continue. That's not how most of preprocessors are implemented though.

Wait... You mean the C pre-processor was _designed_?! Wow!
Unrelated comment

Hello Behdad

I am curious to know whether or not you read my email, and if you did...are you interested / not interested / still thinking about it ?


Post a Comment

Links to this post:

Create a Link

<< Archive
<< Home