<?xml version="1.0"?>
<rss version="2.0">
  <channel>
    <title>Advogato blog for shapr</title>
    <link>http://www.advogato.org/person/shapr/</link>
    <description>Advogato blog for shapr</description>
    <language>en-us</language>
    <generator>mod_virgule</generator>
    <pubDate>Sun, 26 May 2013 04:32:37 GMT</pubDate>
    <item>
      <pubDate>Fri, 21 May 2004 02:14:33 GMT</pubDate>
      <title>21 May 2004</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=23</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=23</guid>
      <description>So it's been nearly four years since I posted here.
I've lost interest in Python, but it is how I make my living. I haven't lost so much interest that I'd like to go back to writing Java.

&lt;p&gt; I really like Haskell, it's what I use to write all my fun code. Check it out if you get the urge to learn something new.</description>
    </item>
    <item>
      <pubDate>Tue, 3 Oct 2000 10:59:16 GMT</pubDate>
      <title>3 Oct 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=22</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=22</guid>
      <description>ok, so the tree searching module has two basic bits working.
It can search for an exact bit of code, as well as searching
for question mark style variables. It still needs lots of
work before it'll be finished, but it has two finished unit
tests and that's good.

&lt;p&gt; I've figured out that the conditions can be written at the
same time as the tree transformer, so if you get the urge to
write one, go for it :)

&lt;p&gt; I'll put up a list of Conditions to be written soon. I may
even post Unit Tests for them.</description>
    </item>
    <item>
      <pubDate>Sun, 30 Jul 2000 20:48:47 GMT</pubDate>
      <title>30 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=21</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=21</guid>
      <description>I had a sudden inspiration on how to turn an abstract syntax
tree into a finite state machine.... now I wonder if I can
get the whole thing done tonite...</description>
    </item>
    <item>
      <pubDate>Thu, 27 Jul 2000 22:05:48 GMT</pubDate>
      <title>27 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=20</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=20</guid>
      <description>The Linux version of Railroad Tycoon II showed up today!
YAY!
I wouldn't think I'll get much coding done in the next week
or so :)

&lt;p&gt; Ah, so much to learn, so little time. Bea is whipping my
butt in RT2, but that's to be expected, she's been whipping
the computer's butt for more than a year.</description>
    </item>
    <item>
      <pubDate>Tue, 25 Jul 2000 23:27:19 GMT</pubDate>
      <title>25 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=19</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=19</guid>
      <description>Much spiffiness! &lt;a
href="http://www.advogato.org/person/jhylton/" &gt;Jeremy
Hylton&lt;/a&gt; wrote up a demonstration module to clarify his
visitor code and sent it to me. Visitors are cool, but not
always simple.

&lt;p&gt; It looks like it would be more efficient to rewrite genpy.py
as a visitor using Jeremy's framework.

&lt;p&gt; Hmm. I think I'll work on the tree transformation module
more first.</description>
    </item>
    <item>
      <pubDate>Wed, 19 Jul 2000 12:36:31 GMT</pubDate>
      <title>19 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=18</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=18</guid>
      <description>I can pull out the comments, and I can contsruct Comment
nodes, I just can't figure out how to use the visitor.py by
Jeremy Hylton to walk the tree and get the line numbers of
all the other nodes. Hm.</description>
    </item>
    <item>
      <pubDate>Mon, 17 Jul 2000 23:01:38 GMT</pubDate>
      <title>17 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=17</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=17</guid>
      <description>Found that I hadn't committed the 16 Jun 2000 genpy.py
changes to CVS yet. wups. It's in there now.
I also finished putting contributions from Moshe into CVS.

&lt;p&gt; I think I now know enough to be able to get most of the tree
transformer done.  Wheee!
Once the tree transformer is done, the hardest thing left
will be run-time instrumentation to prove the IsExclusive()
condition.
The tree transformer is definitely the midpoint of this
effort.

&lt;p&gt; In other news, a few days ago I made a bunch of changes to a
Python front end to mpg123. It's called &lt;a
href="http://pimp3.sourceforge.net/"&gt;Pimp3&lt;/a&gt; and it's very
hackable. It associates a rating with each mp3 you have. If
you hit "next" during a song, its rating goes down one, if
the song plays through, its rating goes up one. It's a
spiffy idea. I've always wanted to play with a Python front
end to mpg123....  Now if only I can figure out how to stick
it into the gnome-panel......

&lt;p&gt; I wonder if it's time for me to try out the window manager
written in Python....  Hmmmmm.</description>
    </item>
    <item>
      <pubDate>Mon, 17 Jul 2000 15:53:18 GMT</pubDate>
      <title>17 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=16</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=16</guid>
      <description>Yay! &lt;a href="http://www.advogato.org/person/moshez/" &gt;Moshe
Zadka&lt;/a&gt; is contributing to Bicycle Repair Man! Much
cheerfulness!

&lt;p&gt; He mentioned that tree transformation in BRM seems to him to
be similar in spirit to the Python XML Validator written by
Lars Marius Garshol. I've been perusing Lars' code for about
an hour or so. It's definitely sparked some ideas.

&lt;p&gt; At this point I'm considering subclassing the Node classes
in Python2C's ast.py and adding getParent and getSiblings
methods to them. I think I could write a fast tree search
that just looked in a dictionary for nodes and then asked
those node personal questions about their relatives. I'm not
sure how difficult it would be to implement those methods
though. I'll know soon enough.</description>
    </item>
    <item>
      <pubDate>Wed, 12 Jul 2000 18:37:17 GMT</pubDate>
      <title>12 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=15</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=15</guid>
      <description>I got a job writing Java for JDK 1.1.4
yay. I've been doing the self-employed thing for months.
Means little money, but lots of time. Now I that I am soon
to start a real job again, I'll be able to buy hardware, but
probly won't have time to play with it. This seems to be the
continual trade-off. Ah well, I hope my lack of time doesn't
completely kill Bicycle Repair Man.

&lt;p&gt; Minor progress has been made on the tree transformer.

&lt;p&gt; Also, Bicycle Repair Man is soon to appear on the
&lt;a href="http://www.refactoring.com/" 
&gt;http://www.refactoring.com&lt;/a&gt; website. I hope that will
increase developer interest in the project.

&lt;p&gt; Nice to see that &lt;a
href="http://www.advogato.org/person/moshez/"&gt; Moshe Zadka
&lt;/a&gt; is on advogato now.</description>
    </item>
    <item>
      <pubDate>Thu, 6 Jul 2000 11:33:01 GMT</pubDate>
      <title>6 Jul 2000</title>
      <link>http://www.advogato.org/person/shapr/diary.html?start=14</link>
      <guid>http://www.advogato.org/person/shapr/diary.html?start=14</guid>
      <description>not much motivation lately to work on BRM :(

&lt;p&gt; I wish I could collaborate with someone for awhile.</description>
    </item>
  </channel>
</rss>
