Paul Findlay
25 July 2007
JSON: State Machine
Well I had fun making this (4 deterministic finite state machines that are joined together as a pushdown automaton to parse JSON). It has something like 75 73 74 states. I’m sure I could cut that number down if I made it less deterministic, but I can’t be bothered.
Just got to find some use for it..
If you can’t understand what I am on about, I’m sorry for you 
Paul at 10:20 pm
20 July 2007
XML: Impossible to be original
I write a comment, then follow a couple of links to find that what I have imagined in my comment is already in production (and probably better): Simple XML Compiler.
I will have to one up it somehow.. the dream inside my head for several months has been a trie like system where you add a whole bunch of XPath’s to it (preferably doable on the fly) and by dint of acting like a trie, the common beginnings of the XPaths are bundled up so as to save space/states and to result in longest-prefix matching.. anyways the combination of these XPath expressions get applied like a giant state-machine/trie to the incoming XML events in something approximating log(n) time, so large numbers of XML streams can be handled efficiently.. probably sounds like Drools (trigger rules which are based on XPath expressions) even though I had never heard of it.
How am I supposed to get an interesting job unless I study, but how am I supposed to study when I keep trying to flesh out my interesting ideas.. but then how can I consider my ideas interesting when they are already taken 
Paul at 9:11 am
4 July 2007
XML: Parser
Creating an XML parser that works like StaX out of a FSM that can process partial chunks of the document as it asynchronously arrives is kinda hard. Especially when you are trying to do it without any heap activity..
Paul at 3:47 pm