sqlparser-rs VS tree-sitter-sql

sqlparser to parse SQL queries and detect variable bindings

So to start with this, I looked into SQL parsing and found this library https://github.com/sqlparser-rs/sqlparser-rs

We switched to an open source alternative, the rust-based sqlparser-rs library, contributing a few updates for the BigQuery dialect.

I have experience with sqlparser-rs (for my sqlpage project), but it does not track the source code location of the parsed data structures (yet).

It uses https://github.com/sqlparser-rs/sqlparser-rs as the parser and lexer. The binder, planner, optimizer and executor are in Python. The optimizer stage only works on the logical plan and the rules are heuristic only.

That code could be copied directly from some real-world examples - sqlparser-rs code looks pretty much exactly the same.

https://github.com/sqlparser-rs/sqlparser-rs

Also neat to find the SQL parser library they use.

Which grammar are you using? https://github.com/DerekStride/tree-sitter-sql supports backticks. This is the one that is used by nvim-treesitter.

A complete grammar of the SQL language is rather large, as can be seen by this grammar https://github.com/DerekStride/tree-sitter-sql/blob/main/grammar.js that is 2000 lines of code.

Alternatively, you could use a tree-sitter parser, such as https://github.com/DerekStride/tree-sitter-sql , which would provide fast incremental parses (but may result in a less detailed AST).