I worked on libpondyparser, it's now at version 0.6.4.6. libpondyparser was a library I started for compiler research. It should eventually use C++ forked processes for parsing stuff. Today I built the L-systems and markov operator systems, basically a system which propagates through an adaptive or AI approach. It can then decide or randomise the pattern of compiling files e.g. you compile (+ 1 2 3 (+ 1 2 3)) in scheme by compiling the nested clause in a separate process then exiting to the compilation process which compiles the first (+ 1 2 3 X). The project site is at http://sf.net/projects/libpondyparser

Then there's my Scheme parser 'schemart' (from scheme heart as far as rogues go :-) I implemented a parse tree with node classes in C++ and a stack and queue for managing the parse tree. Later on I'll add a Scheme implementation which uses the tree. schemeart can be found at https://github.com/cuspy/scheme.compilers

For fun, I payed a license of the game 'Simon the Sorcerer', something from the 90ies, graphics for GNU folks.

Here's a screenshot of what I can display and the buttons down the screen work already (See https://github.com/zork9/john.the.sorcerer for codebase) :

That's it, enjoy!