rusackas commented on code in PR #41803: URL: https://github.com/apache/superset/pull/41803#discussion_r3693927680
########## superset/sql/dialects/trino.py: ########## @@ -0,0 +1,338 @@ +# Licensed to the Apache Software Foundation (ASF) under one +# or more contributor license agreements. See the NOTICE file +# distributed with this work for additional information +# regarding copyright ownership. The ASF licenses this file +# to you under the Apache License, Version 2.0 (the +# "License"); you may not use this file except in compliance +# with the License. You may obtain a copy of the License at +# +# http://www.apache.org/licenses/LICENSE-2.0 +# +# Unless required by applicable law or agreed to in writing, +# software distributed under the License is distributed on an +# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY +# KIND, either express or implied. See the License for the +# specific language governing permissions and limitations +# under the License. + +from __future__ import annotations + +import typing as t + +from sqlglot import exp +from sqlglot.dialects.trino import Trino as SqlglotTrino +from sqlglot.tokens import Token, TokenType + +# Keywords that open a block terminated by ``END`` in Trino SQL routines +# (https://trino.io/docs/current/udf/sql.html). ``CASE`` is included because +# both the ``CASE`` statement and the ``CASE`` expression are terminated by +# ``END``, so counting them keeps the depth balanced either way. +BLOCK_OPENERS: set[str] = {"BEGIN", "CASE", "IF", "LOOP", "REPEAT", "WHILE"} + +# Keywords that are also scalar functions in Trino (e.g. ``IF(a, b, c)`` and +# ``REPEAT('a', 3)``). When immediately followed by ``(`` they are function +# calls, not block openers, unless the token stream shows otherwise (see +# ``_is_paren_condition_block``). +AMBIGUOUS_OPENERS: set[str] = {"IF", "REPEAT"} + +BODY_KEYWORDS: tuple[str, str] = ("RETURN", "BEGIN") + + +def _is_paren_condition_block(tokens: t.Sequence[Token], paren_index: int) -> bool: + """ + Determine whether the parenthesized group starting at ``tokens[paren_index]`` + (an ``L_PAREN``) is a procedural block condition, e.g. ``IF (a > b) THEN``, + as opposed to a scalar function call argument list, e.g. ``IF(a, b, c)``. + + Only ``IF`` has this ambiguity: a parenthesized condition is followed by + ``THEN``, while a scalar function call's closing paren never is. + """ + depth = 0 + for i in range(paren_index, len(tokens)): + token_type = tokens[i].token_type + if token_type == TokenType.L_PAREN: + depth += 1 + elif token_type == TokenType.R_PAREN: + depth -= 1 + if depth == 0: + next_token = tokens[i + 1] if i + 1 < len(tokens) else None + return ( + next_token is not None and next_token.token_type == TokenType.THEN + ) + return False + + +class InlineUDF(exp.CTE): + """ + An inline SQL user-defined function declared in a ``WITH`` clause. + + Trino supports declaring UDFs inline as part of a query:: + + WITH FUNCTION meaning_of_life() + RETURNS tinyint + BEGIN + DECLARE a tinyint DEFAULT CAST(6 AS tinyint); + DECLARE b tinyint DEFAULT CAST(7 AS tinyint); + RETURN a * b; + END + SELECT meaning_of_life() + + The function definition is stored verbatim as an opaque string (wrapped + in an ``exp.Var`` so that AST traversal helpers see an expression), since + sqlglot has no representation for SQL routine bodies. Trino does not + allow queries inside SQL UDF bodies, so no table references are hidden + by the opaque representation. + + This subclasses ``exp.CTE`` because ``sqlglot.parser.Parser._parse_with`` + only collects ``exp.CTE`` instances into the ``WITH`` clause. + """ + + arg_types = {"this": True} + + +class Trino(SqlglotTrino): + """ + Custom Trino dialect with support for inline SQL UDFs. + + sqlglot cannot parse Trino SQL routine syntax; see + https://github.com/tobymao/sqlglot/issues/5178. There are two separate + problems: + + 1. The parser splits statements on every semicolon, including the ones + inside a ``BEGIN ... END`` routine body. + 2. The ``FUNCTION`` specification in a ``WITH`` clause is not valid CTE + syntax. + + This dialect keeps routine bodies intact when splitting statements, and + parses inline function specifications into opaque `InlineUDF` nodes that + regenerate verbatim. + + Note that sqlglot's ``Dialect`` metaclass registers subclasses by class + name, so once this module is imported this class also replaces the + built-in dialect for string-based lookups (``dialect="trino"``). This is + intentional, and consistent with how other Superset dialects (e.g. + ``Dremio``) shadow their sqlglot counterparts: the extensions are purely + additive, only activating on syntax that fails to parse upstream. + """ + + class Parser(SqlglotTrino.Parser): + @staticmethod + def _block_depth_delta( + tokens: list[Token], + index: int, + prev_text: str, + ) -> int: + """ + Compute the block nesting change contributed by the routine token + at ``tokens[index]``. + """ + text = tokens[index].text.upper() Review Comment: Good catch, fixed. Depth tracking now checks token type, not just text, so BEGIN/CASE/END only bump the count when they're the actual keyword, not a string literal or quoted identifier spelling the same word. Added a regression test with `'END'` and `"case"` in the body. ########## superset/sql/dialects/trino.py: ########## @@ -0,0 +1,338 @@ +# Licensed to the Apache Software Foundation (ASF) under one +# or more contributor license agreements. See the NOTICE file +# distributed with this work for additional information +# regarding copyright ownership. The ASF licenses this file +# to you under the Apache License, Version 2.0 (the +# "License"); you may not use this file except in compliance +# with the License. You may obtain a copy of the License at +# +# http://www.apache.org/licenses/LICENSE-2.0 +# +# Unless required by applicable law or agreed to in writing, +# software distributed under the License is distributed on an +# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY +# KIND, either express or implied. See the License for the +# specific language governing permissions and limitations +# under the License. + +from __future__ import annotations + +import typing as t + +from sqlglot import exp +from sqlglot.dialects.trino import Trino as SqlglotTrino +from sqlglot.tokens import Token, TokenType + +# Keywords that open a block terminated by ``END`` in Trino SQL routines +# (https://trino.io/docs/current/udf/sql.html). ``CASE`` is included because +# both the ``CASE`` statement and the ``CASE`` expression are terminated by +# ``END``, so counting them keeps the depth balanced either way. +BLOCK_OPENERS: set[str] = {"BEGIN", "CASE", "IF", "LOOP", "REPEAT", "WHILE"} + +# Keywords that are also scalar functions in Trino (e.g. ``IF(a, b, c)`` and +# ``REPEAT('a', 3)``). When immediately followed by ``(`` they are function +# calls, not block openers, unless the token stream shows otherwise (see +# ``_is_paren_condition_block``). +AMBIGUOUS_OPENERS: set[str] = {"IF", "REPEAT"} + +BODY_KEYWORDS: tuple[str, str] = ("RETURN", "BEGIN") + + +def _is_paren_condition_block(tokens: t.Sequence[Token], paren_index: int) -> bool: + """ + Determine whether the parenthesized group starting at ``tokens[paren_index]`` + (an ``L_PAREN``) is a procedural block condition, e.g. ``IF (a > b) THEN``, + as opposed to a scalar function call argument list, e.g. ``IF(a, b, c)``. + + Only ``IF`` has this ambiguity: a parenthesized condition is followed by + ``THEN``, while a scalar function call's closing paren never is. + """ + depth = 0 + for i in range(paren_index, len(tokens)): + token_type = tokens[i].token_type + if token_type == TokenType.L_PAREN: + depth += 1 + elif token_type == TokenType.R_PAREN: + depth -= 1 + if depth == 0: + next_token = tokens[i + 1] if i + 1 < len(tokens) else None + return ( + next_token is not None and next_token.token_type == TokenType.THEN + ) + return False + + +class InlineUDF(exp.CTE): + """ + An inline SQL user-defined function declared in a ``WITH`` clause. + + Trino supports declaring UDFs inline as part of a query:: + + WITH FUNCTION meaning_of_life() + RETURNS tinyint + BEGIN + DECLARE a tinyint DEFAULT CAST(6 AS tinyint); + DECLARE b tinyint DEFAULT CAST(7 AS tinyint); + RETURN a * b; + END + SELECT meaning_of_life() + + The function definition is stored verbatim as an opaque string (wrapped + in an ``exp.Var`` so that AST traversal helpers see an expression), since + sqlglot has no representation for SQL routine bodies. Trino does not + allow queries inside SQL UDF bodies, so no table references are hidden + by the opaque representation. + + This subclasses ``exp.CTE`` because ``sqlglot.parser.Parser._parse_with`` + only collects ``exp.CTE`` instances into the ``WITH`` clause. + """ + + arg_types = {"this": True} + + +class Trino(SqlglotTrino): + """ + Custom Trino dialect with support for inline SQL UDFs. + + sqlglot cannot parse Trino SQL routine syntax; see + https://github.com/tobymao/sqlglot/issues/5178. There are two separate + problems: + + 1. The parser splits statements on every semicolon, including the ones + inside a ``BEGIN ... END`` routine body. + 2. The ``FUNCTION`` specification in a ``WITH`` clause is not valid CTE + syntax. + + This dialect keeps routine bodies intact when splitting statements, and + parses inline function specifications into opaque `InlineUDF` nodes that + regenerate verbatim. + + Note that sqlglot's ``Dialect`` metaclass registers subclasses by class + name, so once this module is imported this class also replaces the + built-in dialect for string-based lookups (``dialect="trino"``). This is + intentional, and consistent with how other Superset dialects (e.g. + ``Dremio``) shadow their sqlglot counterparts: the extensions are purely + additive, only activating on syntax that fails to parse upstream. + """ + + class Parser(SqlglotTrino.Parser): + @staticmethod + def _block_depth_delta( + tokens: list[Token], + index: int, + prev_text: str, + ) -> int: + """ + Compute the block nesting change contributed by the routine token + at ``tokens[index]``. + """ + text = tokens[index].text.upper() + if text in BLOCK_OPENERS: + if prev_text == "END": + return 0 # block terminator, e.g. `END IF`, `END CASE` + next_token = tokens[index + 1] if index + 1 < len(tokens) else None + if ( + text in AMBIGUOUS_OPENERS + and next_token + and next_token.token_type == TokenType.L_PAREN + ): + if text == "IF" and _is_paren_condition_block(tokens, index + 1): + return 1 # procedural `IF (...) THEN`, not a call + return 0 # scalar function call, e.g. `IF(a, b, c)` + return 1 + if text == "END": + return -1 + return 0 + + @staticmethod + def _starts_routine( + heads: list[TokenType], + paren_depth: int, + ) -> bool: + """ + Determine whether a ``FUNCTION`` token at the end of ``heads`` + (excluded from the list) begins a new routine specification: + ``CREATE FUNCTION``, ``CREATE OR REPLACE FUNCTION``, or an entry + in a ``WITH`` list, either right after ``WITH`` itself or after a + top-level comma separating it from a preceding CTE, e.g. + ``WITH cte AS (...), FUNCTION f() ...``. + """ + if heads[:1] == [TokenType.CREATE]: + return heads in ( + [TokenType.CREATE], + [TokenType.CREATE, TokenType.OR, TokenType.REPLACE], Review Comment: Added a `CREATE OR REPLACE FUNCTION` case with an inner semicolon, parses as the routine plus the following statement. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
