Joshua Davis wrote:
Will be interesting to see how that stuff will perform compared to Gavins "top-of-his-head" parser ;)
That's an interesting point actually, and one that I've come across many times. I would guess that the ANTLR based approach might be *slightly* slower, but remember: ANTLR generates recursive descent parsers/lexers, which are very similar to the ones you would write 'by hand'. It does *not* generate table-driven parsers or DFA lexers, which can be slower. I expect that the lex/parse/tree walk time is going not going to be significant when compared with the query execution time.
-- Gavin King JBoss Group +61 410534454 http://hibernate.org
------------------------------------------------------- This SF.net email is sponsored by: SF.net Giveback Program. Does SourceForge.net help you be more productive? Does it help you create better code? SHARE THE LOVE, and help us help YOU! Click Here: http://sourceforge.net/donate/ _______________________________________________ hibernate-devel mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/hibernate-devel
