| commit | e863bc041cda7232923d548a5c8e8c43a7274941 | [log] [tgz] |
|---|---|---|
| author | Andy Grove <andygrove73@gmail.com> | Sun Dec 16 13:57:01 2018 -0700 |
| committer | Andy Grove <andygrove73@gmail.com> | Sun Dec 16 13:57:01 2018 -0700 |
| tree | 82a8fc988bc2722e9468f7338788e8af92763e30 | |
| parent | 24af0499308051cdb181f94c071de1ffbc5cd757 [diff] |
cargo fmt, fix compiler warnings
The goal of this project is to build a SQL lexer and parser capable of parsing SQL that conforms with the ANSI SQL:2011 standard but also making it easy to support custom dialects so that this crate can be used as a foundation for vendor-specific parsers.
This parser is currently being used by the DataFusion query engine.
The current code is capable of parsing some trivial SELECT and CREATE TABLE statements.
let sql = "SELECT a, b, 123, myfunc(b) \ FROM table_1 \ WHERE a > b AND b < 100 \ ORDER BY a DESC, b"; let dialect = GenericSqlDialect{}; // or AnsiSqlDialect, or your own dialect ... let ast = Parser::parse_sql(&dialect,sql.to_string()).unwrap(); println!("AST: {:?}", ast);
This outputs
AST: SQLSelect { projection: [SQLIdentifier("a"), SQLIdentifier("b"), SQLLiteralLong(123), SQLFunction { id: "myfunc", args: [SQLIdentifier("b")] }], relation: Some(SQLIdentifier("table_1")), selection: Some(SQLBinaryExpr { left: SQLBinaryExpr { left: SQLIdentifier("a"), op: Gt, right: SQLIdentifier("b") }, op: And, right: SQLBinaryExpr { left: SQLIdentifier("b"), op: Lt, right: SQLLiteralLong(100) } }), order_by: Some([SQLOrderBy { expr: SQLIdentifier("a"), asc: false }, SQLOrderBy { expr: SQLIdentifier("b"), asc: true }]), group_by: None, having: None, limit: None }
This parser is implemented using the Pratt Parser design, which is a top-down operator-precedence parser.
I am a fan of this design pattern over parser generators for the following reasons:
This is a work in progress but I started some notes on writing a custom SQL parser.
Contributors are welcome! Please see the current issues and feel free to file more!