[il-antlr-interest: 23121] Re: [antlr-interest] Lexer doesn't agree with me (gives other tokens than I need)

he parser. Hope that makes sense. If you google around, the BNF grammars for SQL 99, 2003 and 2008 are out there (at least in draft). Alex Alexander Brown Partner | Analytics 8 | Tel +61 2 9299 4430 | Mob +61 424 043 485| abr...@analytics8.com | www.anal

[il-antlr-interest: 23117] Re: [antlr-interest] Lexer doesn't agree with me (gives other tokens than I need)

etail about what you are trying to achieve at the AST level perhaps I could suggest a way to achieve it? Alex Alexander Brown Partner | Analytics 8 | Tel +61 2 9299 4430 | Mob +61 424 043 485| abr...@analytics8.com | www.analytics8.com Hi, I'm creating

[il-antlr-interest: 22974] Re: [antlr-interest] ANTLR Grammar for SELECT statement

base your parser on the SQL2003 spec, you will need about 600 lexer and parser rules to handle what I would consider the core SQL SELECT, INSERT, UPDATE syntax. Alex Alexander Brown Partner | Analytics 8 | Tel +61 2 9299 4430 | Mob +61 424 043 485| abr...@analytics8.com | www.analytics8.com

[il-antlr-interest: 22956] [antlr-interest] Representations of AST

Hi, Perhaps this will sound like a rather stupid question, but I am wondering if there is a better way to approach the problem I am trying to solve. I am interested in parsing SQL. I have developed a grammar based on the (overly complex) SQL2003 specification for my corpus (something like 1G