Anthony Steele - 2002-12-27

Well, its been a while, but I am now living in London England now and doing some coding on this pet project of mine.

I have checked some source into CVS (in the jcf2 directory) that is a whitespace-preserving recursive-descent parser towards as version 2 of the Jedi Code Format. I dont know when it will reach the level of the existing jcf, but as it takes a better approach to parsing the source, it will eventually surpass it.

You'll need the DUnit testing framework to compile it. SO far there is only a test project. The parser works with everything I can throw at it.

The work now is to rewrite all transformations to work with the parse tree (the visitor pattern may soon make an appearance).

The goal will be to have as much as possible of the state (e.g. bracket nesting level, indent level etc.)  be derived from inspecting the tree, ie walking up from leaf to root node. This will mean that any transformation that manipulates the tree will have it's changes reflected there for the next transformation.