|Compiling pattern matching on XML with Hedge/Tree Automata Burak.Emir@post.rwth-aachen.de (Burak Emir) (2002-12-01)|
|From:||"Burak Emir" <Burak.Emir@post.rwth-aachen.de>|
|Date:||1 Dec 2002 22:38:56 -0500|
|Posted-Date:||01 Dec 2002 22:38:56 EST|
I am working on a system which translates pattern matching constructs
for XML in tree/hedge automata. ( These are similar to tree automata but
allow a node to have arbitrarily many successors, see Murata /
Br"uggemann-Klein / Wood ... BTW, hedges are often called forests, or
I am only aware of Andreas Neumann's fxgrep system ( described in his
doctoral thesis ) where this approach has been taken in practice. It is
implemented in SML and performing quite well.
Does anybody know of other implementations ?
Return to the
Search the comp.compilers archives again.