Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix(sqlparser): align operator precedence with PostgreSQL #8174

Merged
merged 7 commits into from
Feb 25, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions e2e_test/batch/basic/precedence.slt.part
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
query I
select 2 + 2 ^ 2; -- power then plus
----
6

query I
select 2 | 3 & 4; -- or then and
----
0

query I
select -3 ^ 2; -- neg then power
----
9

query I
select -3 * 2; -- neg then multiply
----
-6

query T
select pg_typeof(-2147483648 * 1);
----
integer


# query I
# select @ 1 - 2; -- minus then abs
# ----
# 1
148 changes: 90 additions & 58 deletions src/sqlparser/src/parser.rs
Original file line number Diff line number Diff line change
Expand Up @@ -117,6 +117,28 @@ impl std::error::Error for ParserError {}

type ColumnsDefTuple = (Vec<ColumnDef>, Vec<TableConstraint>, Vec<SourceWatermark>);

/// Reference:
/// https://www.postgresql.org/docs/current/sql-syntax-lexical.html#SQL-PRECEDENCE
#[derive(Debug, PartialEq, Eq, PartialOrd, Ord)]
pub enum Precedence {
Zero = 0,
LogicalOr, // 5 in upstream
LogicalXor,
LogicalAnd, // 10 in upstream
UnaryNot, // 15 in upstream
Is, // 17 in upstream
Cmp,
Between,
Other,
PlusMinus, // 30 in upstream
MulDiv, // 40 in upstream
Exp,
UnaryPosNeg,
PostfixFactorial,
Array,
DoubleColon, // 50 in upstream
}

pub struct Parser {
tokens: Vec<Token>,
/// The index of the first unprocessed token in `self.tokens`
Expand All @@ -133,11 +155,6 @@ pub struct Parser {
}

impl Parser {
const BETWEEN_PREC: u8 = 21;
const PLUS_MINUS_PREC: u8 = 30;
const TIME_ZONE_PREC: u8 = 21;
const UNARY_NOT_PREC: u8 = 15;

/// Parse the specified tokens
pub fn new(tokens: Vec<Token>) -> Self {
Parser {
Expand Down Expand Up @@ -393,11 +410,11 @@ impl Parser {

/// Parse a new expression
pub fn parse_expr(&mut self) -> Result<Expr, ParserError> {
self.parse_subexpr(0)
self.parse_subexpr(Precedence::Zero)
}

/// Parse tokens until the precedence changes
pub fn parse_subexpr(&mut self, precedence: u8) -> Result<Expr, ParserError> {
pub fn parse_subexpr(&mut self, precedence: Precedence) -> Result<Expr, ParserError> {
debug!("parsing expr");
let mut expr = self.parse_prefix()?;
debug!("prefix: {:?}", expr);
Expand Down Expand Up @@ -467,7 +484,7 @@ impl Parser {
Keyword::INTERVAL => self.parse_literal_interval(),
Keyword::NOT => Ok(Expr::UnaryOp {
op: UnaryOperator::Not,
expr: Box::new(self.parse_subexpr(Self::UNARY_NOT_PREC)?),
expr: Box::new(self.parse_subexpr(Precedence::UnaryNot)?),
}),
Keyword::ROW => self.parse_row_expr(),
Keyword::ARRAY => {
Expand Down Expand Up @@ -511,7 +528,7 @@ impl Parser {
} else {
UnaryOperator::Minus
};
let mut sub_expr = self.parse_subexpr(Self::PLUS_MINUS_PREC)?;
let mut sub_expr = self.parse_subexpr(Precedence::UnaryPosNeg)?;
if let Expr::Value(Value::Number(ref mut s)) = sub_expr {
if tok == Token::Minus {
*s = format!("-{}", s);
Expand All @@ -536,9 +553,11 @@ impl Parser {
Token::Tilde => UnaryOperator::PGBitwiseNot,
_ => unreachable!(),
};
// Counter-intuitively, `|/ 4 + 12` means `|/ (4+12)` rather than `(|/4) + 12` in
// PostgreSQL.
Ok(Expr::UnaryOp {
op,
expr: Box::new(self.parse_subexpr(Self::PLUS_MINUS_PREC)?),
expr: Box::new(self.parse_subexpr(Precedence::Other)?),
})
}
Token::Number(_)
Expand Down Expand Up @@ -1089,7 +1108,7 @@ impl Parser {
}

/// Parse an operator following an expression
pub fn parse_infix(&mut self, expr: Expr, precedence: u8) -> Result<Expr, ParserError> {
pub fn parse_infix(&mut self, expr: Expr, precedence: Precedence) -> Result<Expr, ParserError> {
let tok = self.next_token();
let regular_binary_operator = match &tok {
Token::Spaceship => Some(BinaryOperator::Spaceship),
Expand Down Expand Up @@ -1294,9 +1313,9 @@ impl Parser {
pub fn parse_between(&mut self, expr: Expr, negated: bool) -> Result<Expr, ParserError> {
// Stop parsing subexpressions for <low> and <high> on tokens with
// precedence lower than that of `BETWEEN`, such as `AND`, `IS`, etc.
let low = self.parse_subexpr(Self::BETWEEN_PREC)?;
let low = self.parse_subexpr(Precedence::Between)?;
self.expect_keyword(Keyword::AND)?;
let high = self.parse_subexpr(Self::BETWEEN_PREC)?;
let high = self.parse_subexpr(Precedence::Between)?;
Ok(Expr::Between {
expr: Box::new(expr),
negated,
Expand All @@ -1314,64 +1333,77 @@ impl Parser {
}

/// Get the precedence of the next token
pub fn get_next_precedence(&self) -> Result<u8, ParserError> {
pub fn get_next_precedence(&self) -> Result<Precedence, ParserError> {
use Precedence as P;

let token = self.peek_token();
debug!("get_next_precedence() {:?}", token);
match token {
Token::Word(w) if w.keyword == Keyword::OR => Ok(5),
Token::Word(w) if w.keyword == Keyword::AND => Ok(10),
Token::Word(w) if w.keyword == Keyword::XOR => Ok(24),

Token::Word(w) if w.keyword == Keyword::AT => {
match (self.peek_nth_token(1), self.peek_nth_token(2)) {
(Token::Word(w), Token::Word(w2))
if w.keyword == Keyword::TIME && w2.keyword == Keyword::ZONE =>
{
Ok(Self::TIME_ZONE_PREC)
}
_ => Ok(0),
}
}

Token::Word(w) if w.keyword == Keyword::NOT => match self.peek_nth_token(1) {
// The precedence of NOT varies depending on keyword that
// follows it. If it is followed by IN, BETWEEN, or LIKE,
// it takes on the precedence of those tokens. Otherwise it
// is not an infix operator, and therefore has zero
// precedence.
Token::Word(w) if w.keyword == Keyword::IN => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::BETWEEN => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::LIKE => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::ILIKE => Ok(Self::BETWEEN_PREC),
_ => Ok(0),
},
Token::Word(w) if w.keyword == Keyword::IS => Ok(17),
Token::Word(w) if w.keyword == Keyword::IN => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::BETWEEN => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::LIKE => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::ILIKE => Ok(Self::BETWEEN_PREC),
Token::Word(w) if w.keyword == Keyword::OR => Ok(P::LogicalOr),
Token::Word(w) if w.keyword == Keyword::XOR => Ok(P::LogicalXor),
Token::Word(w) if w.keyword == Keyword::AND => Ok(P::LogicalAnd),
Token::Word(w) if w.keyword == Keyword::IS => Ok(P::Is),
Token::Word(w) if w.keyword == Keyword::ISNULL => Ok(P::Is),
Token::Word(w) if w.keyword == Keyword::NOTNULL => Ok(P::Is),
Token::Eq
| Token::Lt
| Token::LtEq
| Token::Neq
| Token::Gt
| Token::GtEq
| Token::DoubleEq
| Token::Tilde
| Token::Spaceship => Ok(P::Cmp),
Token::Word(w) if w.keyword == Keyword::NOT => match self.peek_nth_token(1) {
// The precedence of NOT varies depending on keyword that
// follows it. If it is followed by IN, BETWEEN, or LIKE,
// it takes on the precedence of those tokens. Otherwise it
// is not an infix operator, and therefore has zero
// precedence.
Token::Word(w) if w.keyword == Keyword::BETWEEN => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::IN => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::LIKE => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::ILIKE => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::SIMILAR => Ok(P::Between),
_ => Ok(P::Zero),
},
Token::Word(w) if w.keyword == Keyword::BETWEEN => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::IN => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::LIKE => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::ILIKE => Ok(P::Between),
Token::Word(w) if w.keyword == Keyword::SIMILAR => Ok(P::Between),
Token::Tilde
| Token::TildeAsterisk
| Token::ExclamationMarkTilde
| Token::ExclamationMarkTildeAsterisk
| Token::Spaceship => Ok(20),
Token::Pipe => Ok(21),
Token::Caret | Token::Sharp | Token::ShiftRight | Token::ShiftLeft => Ok(22),
Token::Ampersand => Ok(23),
Token::Arrow | Token::LongArrow | Token::HashArrow | Token::HashLongArrow => Ok(25),
Token::Plus | Token::Minus => Ok(Self::PLUS_MINUS_PREC),
Token::Mul | Token::Div | Token::Mod | Token::Concat => Ok(40),
Token::DoubleColon => Ok(50),
Token::ExclamationMark => Ok(50),
Token::LBracket => Ok(50),
_ => Ok(0),
| Token::Concat
| Token::Arrow
| Token::LongArrow
| Token::HashArrow
| Token::HashLongArrow => Ok(P::Other),
Token::Word(w) if w.keyword == Keyword::AT => {
match (self.peek_nth_token(1), self.peek_nth_token(2)) {
(Token::Word(w), Token::Word(w2))
if w.keyword == Keyword::TIME && w2.keyword == Keyword::ZONE =>
{
Ok(P::Other)
}
_ => Ok(P::Zero),
}
}
// In some languages (incl. rust, c), bitwise operators have precedence:
// or < xor < and < shift
// But in PostgreSQL, they are just left to right. So `2 | 3 & 4` is 0.
Token::Pipe => Ok(P::Other),
Token::Sharp => Ok(P::Other),
Token::Ampersand => Ok(P::Other),
Token::ShiftRight | Token::ShiftLeft => Ok(P::Other),
Token::Plus | Token::Minus => Ok(P::PlusMinus),
Token::Mul | Token::Div | Token::Mod => Ok(P::MulDiv),
Token::Caret => Ok(P::Exp),
Token::ExclamationMark => Ok(P::PostfixFactorial),
Token::LBracket => Ok(P::Array),
Token::DoubleColon => Ok(P::DoubleColon),
_ => Ok(P::Zero),
}
}

Expand Down
24 changes: 24 additions & 0 deletions src/sqlparser/tests/testdata/precedence.yaml
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
- input: select 2 + 2 ^ 2
formatted_sql: SELECT 2 + 2 ^ 2
formatted_ast: |
Query(Query { with: None, body: Select(Select { distinct: All, projection: [UnnamedExpr(BinaryOp { left: Value(Number("2")), op: Plus, right: BinaryOp { left: Value(Number("2")), op: BitwiseXor, right: Value(Number("2")) } })], from: [], lateral_views: [], selection: None, group_by: [], having: None }), order_by: [], limit: None, offset: None, fetch: None })

- input: select 2 | 3 & 4
formatted_sql: SELECT 2 | 3 & 4
formatted_ast: |
Query(Query { with: None, body: Select(Select { distinct: All, projection: [UnnamedExpr(BinaryOp { left: BinaryOp { left: Value(Number("2")), op: BitwiseOr, right: Value(Number("3")) }, op: BitwiseAnd, right: Value(Number("4")) })], from: [], lateral_views: [], selection: None, group_by: [], having: None }), order_by: [], limit: None, offset: None, fetch: None })

- input: select - 3 ^ 2
formatted_sql: SELECT -3 ^ 2
formatted_ast: |
Query(Query { with: None, body: Select(Select { distinct: All, projection: [UnnamedExpr(BinaryOp { left: Value(Number("-3")), op: BitwiseXor, right: Value(Number("2")) })], from: [], lateral_views: [], selection: None, group_by: [], having: None }), order_by: [], limit: None, offset: None, fetch: None })

- input: select - 3 * 2
formatted_sql: SELECT -3 * 2
formatted_ast: |
Query(Query { with: None, body: Select(Select { distinct: All, projection: [UnnamedExpr(BinaryOp { left: Value(Number("-3")), op: Multiply, right: Value(Number("2")) })], from: [], lateral_views: [], selection: None, group_by: [], having: None }), order_by: [], limit: None, offset: None, fetch: None })

- input: select |/ 4 + 12
formatted_sql: SELECT |/ 4 + 12
formatted_ast: |
Query(Query { with: None, body: Select(Select { distinct: All, projection: [UnnamedExpr(UnaryOp { op: PGSquareRoot, expr: BinaryOp { left: Value(Number("4")), op: Plus, right: Value(Number("12")) } })], from: [], lateral_views: [], selection: None, group_by: [], having: None }), order_by: [], limit: None, offset: None, fetch: None })