[
Lists Home |
Date Index |
Thread Index
]
* Kevin Jones <kjouk@yahoo.co.uk> [2005-01-15 08:18]:
> On Saturday 15 January 2005 11:57, Alan Gutierrez wrote:
> >
> > I'm thinking something like creating a language that is richer
> > that STXPath, and using it to compile a DFA that matches against
> > a SAX stream, and triggering events when a pattern matches.
> You might also find xmltk.sourceforge.net an interesting
> read if you have not come across the work of Dan Suciu
> before.
I hadn't. Thank you.
Also, looking at Tom and Scala as implementation langauges. Tom
because it is a pattern matching language, Scala for the fancy
case statement, both because they are JVM targeted, and that's
where I'm working these days.
http://tom.loria.fr/
http://lampwww.epfl.ch/scala/
Also, I'm interested in seeing what Terrence Parr is up to over
at ANTLR. He's working on generating DFA as bytecode.
http://www.antlr.org/blog/antlr3/codegen.tml
This is apart from a discussion of the XPattern language, which
ought to get going in a separate thread.
I'll probably start out by doing some simple matching, as a
proof of concept, so that I'll know what I'm up against as the
language is specified. Any other input on DFA implementations is
welcome.
--
Alan Gutierrez - alan@engrm.com
|
