30 releases (breaking)

0.22.1 Nov 11, 2024
0.21.0 Sep 17, 2024
0.20.0 Jun 13, 2024
0.17.0 Mar 27, 2024
0.4.0 Mar 30, 2022

#287 in Database interfaces

Download history 22/week @ 2024-08-12 5/week @ 2024-08-19 44/week @ 2024-08-26 21/week @ 2024-09-02 40/week @ 2024-09-09 204/week @ 2024-09-16 96/week @ 2024-09-23 95/week @ 2024-09-30 70/week @ 2024-10-07 15/week @ 2024-10-14 59/week @ 2024-10-21 17/week @ 2024-10-28 8/week @ 2024-11-04 307/week @ 2024-11-11 60/week @ 2024-11-18 41/week @ 2024-11-25

417 downloads per month
Used in 4 crates (2 directly)

Apache-2.0

345KB
9K SLoC

sql-parse

crates.io crates.io License actions-badge

Parse SQL into an AST

This crate provides an lexer and parser that can parse SQL into an Abstract Syntax Tree (AST). Currently primarily focused on MariaDB/Mysql.

Example code:

use sql_parse::{SQLDialect, SQLArguments, ParseOptions, parse_statement, Issues};

let options = ParseOptions::new()
    .dialect(SQLDialect::MariaDB)
    .arguments(SQLArguments::QuestionMark)
    .warn_unquoted_identifiers(true);


let sql = "SELECT `monkey`,
           FROM `t1` LEFT JOIN `t2` ON `t2`.`id` = `t1.two`
           WHERE `t1`.`id` = ?";

let mut issues = Issues::new(sql);
let ast = parse_statement(sql, &mut issues, &options);

println!("Issues: {}", issues);
println!("AST: {:#?}", ast);

Features

  • Good error recovery: The parser implements reasonable error recovery and will continue parsing long expressions if an error is found within.
  • Code span annotations: All AST notes implements Spanned that yields a byte span within the code. This means that errors and warnings generated from the parsing can be precented to the user in a nice ways. Also users of the AST can generate more issues that can also similarly be presented nicely.
  • No dependencies: We use no-std with alloc, and has no other dependencies
  • No unsafe code: We use #![forbid(unsafe_code)] to guarantee no unsafe code.
  • Fast parsing: The parser is a hand written recursive decent parser. To speed up parser expressions are parsed using a O(1) shift reduce mechanism.

No runtime deps