dt-sql-parser 4.1.2-beta.1 → 4.3.0

package/dist/lib/trino/TrinoSqlVisitor.d.ts

@@ -114,7 +114,10 @@ import { InlineTableContext } from "./TrinoSqlParser.js";
 import { SubqueryContext } from "./TrinoSqlParser.js";
 import { SortItemContext } from "./TrinoSqlParser.js";
 import { QuerySpecificationContext } from "./TrinoSqlParser.js";
+import { WhereClauseContext } from "./TrinoSqlParser.js";
+import { HavingClauseContext } from "./TrinoSqlParser.js";
 import { GroupByContext } from "./TrinoSqlParser.js";
+import { PartitionByContext } from "./TrinoSqlParser.js";
 import { SingleGroupingSetContext } from "./TrinoSqlParser.js";
 import { RollupContext } from "./TrinoSqlParser.js";
 import { CubeContext } from "./TrinoSqlParser.js";
@@ -347,6 +350,7 @@ import { CatalogNameCreateContext } from "./TrinoSqlParser.js";
 import { FunctionNameContext } from "./TrinoSqlParser.js";
 import { FunctionNameCreateContext } from "./TrinoSqlParser.js";
 import { ColumnRefContext } from "./TrinoSqlParser.js";
+import { ColumnNameContext } from "./TrinoSqlParser.js";
 import { ColumnNameCreateContext } from "./TrinoSqlParser.js";
 import { QualifiedNameContext } from "./TrinoSqlParser.js";
 import { QueryPeriodContext } from "./TrinoSqlParser.js";
@@ -1160,12 +1164,30 @@ export declare class TrinoSqlVisitor<Result> extends AbstractParseTreeVisitor<Re
      * @return the visitor result
      */
     visitQuerySpecification?: (ctx: QuerySpecificationContext) => Result;
+    /**
+     * Visit a parse tree produced by `TrinoSqlParser.whereClause`.
+     * @param ctx the parse tree
+     * @return the visitor result
+     */
+    visitWhereClause?: (ctx: WhereClauseContext) => Result;
+    /**
+     * Visit a parse tree produced by `TrinoSqlParser.havingClause`.
+     * @param ctx the parse tree
+     * @return the visitor result
+     */
+    visitHavingClause?: (ctx: HavingClauseContext) => Result;
     /**
      * Visit a parse tree produced by `TrinoSqlParser.groupBy`.
      * @param ctx the parse tree
      * @return the visitor result
      */
     visitGroupBy?: (ctx: GroupByContext) => Result;
+    /**
+     * Visit a parse tree produced by `TrinoSqlParser.partitionBy`.
+     * @param ctx the parse tree
+     * @return the visitor result
+     */
+    visitPartitionBy?: (ctx: PartitionByContext) => Result;
     /**
      * Visit a parse tree produced by the `singleGroupingSet`
      * labeled alternative in `TrinoSqlParser.groupingElement`.
@@ -2705,6 +2727,12 @@ export declare class TrinoSqlVisitor<Result> extends AbstractParseTreeVisitor<Re
      * @return the visitor result
      */
     visitColumnRef?: (ctx: ColumnRefContext) => Result;
+    /**
+     * Visit a parse tree produced by `TrinoSqlParser.columnName`.
+     * @param ctx the parse tree
+     * @return the visitor result
+     */
+    visitColumnName?: (ctx: ColumnNameContext) => Result;
     /**
      * Visit a parse tree produced by `TrinoSqlParser.columnNameCreate`.
      * @param ctx the parse tree

package/dist/parser/common/basicSQL.d.ts

@@ -1,12 +1,14 @@
-import { Lexer, Token, CommonTokenStream, CharStream, ParserRuleContext, ParseTreeListener, ANTLRErrorListener } from 'antlr4ng';
+import { Lexer, Token, CommonTokenStream, CharStream, ParserRuleContext, ParseTreeListener, ANTLRErrorListener, Parser } from 'antlr4ng';
 import { CandidatesCollection } from 'antlr4-c3';
 import { SQLParserBase } from '../../lib/SQLParserBase';
 import { TextSlice } from './textAndWord';
-import { CaretPosition, LOCALE_TYPE, Suggestions } from './types';
+import { CaretPosition, LOCALE_TYPE, SemanticCollectOptions, Suggestions } from './types';
 import { ParseError, ErrorListener } from './parseErrorListener';
 import type { SplitListener } from './splitListener';
 import type { EntityCollector } from './entityCollector';
 import { EntityContext } from './entityCollector';
+import SemanticContextCollector from './semanticContextCollector';
+export declare const SQL_SPLIT_SYMBOL_TEXT = ";";
 /**
  * Basic SQL class, every sql needs extends it.
  */
@@ -38,11 +40,10 @@ export declare abstract class BasicSQL<L extends Lexer = Lexer, PRC extends Pars
     /**
      * Convert candidates to suggestions
      * @param candidates candidate list
-     * @param allTokens all tokens from input
+     * @param allTokens slice all tokens from input by tokenIndexOffset
      * @param caretTokenIndex tokenIndex of caretPosition
-     * @param tokenIndexOffset offset of the tokenIndex in the candidates compared to the tokenIndex in allTokens
      */
-    protected abstract processCandidates(candidates: CandidatesCollection, allTokens: Token[], caretTokenIndex: number, tokenIndexOffset: number): Suggestions<Token>;
+    protected abstract processCandidates(candidates: CandidatesCollection, allTokens: Token[], caretTokenIndex: number): Suggestions<Token>;
     /**
      * Get a new splitListener instance.
      */
@@ -56,6 +57,10 @@ export declare abstract class BasicSQL<L extends Lexer = Lexer, PRC extends Pars
      */
     protected abstract createEntityCollector(input: string, allTokens?: Token[], caretTokenIndex?: number): EntityCollector;
     locale: LOCALE_TYPE;
+    /**
+     * Get a new semanticContextCollector instance.
+     */
+    protected abstract createSemanticContextCollector(input: string, caretPosition: CaretPosition, allTokens: Token[], options?: SemanticCollectOptions): SemanticContextCollector;
     /**
      * Create an antlr4 lexer from input.
      * @param input string
@@ -116,14 +121,35 @@ export declare abstract class BasicSQL<L extends Lexer = Lexer, PRC extends Pars
      */
     splitSQLByStatement(input: string): TextSlice[] | null;
     /**
-     * Get a minimum boundary parser near tokenIndex.
+     * Get the smaller range of input
+     * @param input string
+     * @param allTokens all tokens from input
+     * @param tokenIndexOffset offset of the tokenIndex in the range of input
+     * @param caretTokenIndex tokenIndex of caretPosition
+     * @returns inputSlice: string, caretTokenIndex: number
+     */
+    private splitInputBySymbolText;
+    /**
+     * Get the minimum input string that can be parsed successfully by c3.
+     * @param input source string
+     * @param caretTokenIndex tokenIndex of caretPosition
+     * @param originParseTree origin parseTree
+     * @returns MinimumInputInfo
+     */
+    getMinimumInputInfo(input: string, caretTokenIndex: number, originParseTree: ParserRuleContext | undefined): {
+        input: string;
+        tokenIndexOffset: number;
+        statementCount: number;
+    } | null;
+    /**
+     * Get a minimum boundary parser near caretTokenIndex.
      * @param input source string.
-     * @param tokenIndex start from which index to minimize the boundary.
+     * @param caretTokenIndex start from which index to minimize the boundary.
      * @param originParseTree the parse tree need to be minimized, default value is the result of parsing `input`.
      * @returns minimum parser info
      */
-    getMinimumParserInfo(input: string, tokenIndex: number, originParseTree?: ParserRuleContext | null): {
-        parser: P;
+    getMinimumParserInfo(input: string, caretTokenIndex: number, originParseTree: ParserRuleContext | undefined): {
+        parser: Parser;
         parseTree: ParserRuleContext;
         tokenIndexOffset: number;
         newTokenIndex: number;
@@ -136,4 +162,12 @@ export declare abstract class BasicSQL<L extends Lexer = Lexer, PRC extends Pars
      */
     getSuggestionAtCaretPosition(input: string, caretPosition: CaretPosition): Suggestions | null;
     getAllEntities(input: string, caretPosition?: CaretPosition): EntityContext[] | null;
+    /**
+     * Get semantic context infos
+     * @param input source string
+     * @param caretPosition caret position, such as cursor position
+     * @param options semantic context options
+     * @returns analyzed semantic context
+     */
+    getSemanticContextAtCaretPosition(input: string, caretPosition: CaretPosition, options?: SemanticCollectOptions): import("./types").SemanticContext;
 }

package/dist/parser/common/basicSQL.js

@@ -3,6 +3,7 @@ import { CodeCompletionCore } from 'antlr4-c3';
 import { findCaretTokenIndex } from './findCaretTokenIndex';
 import { ctxToText, tokenToWord } from './textAndWord';
 import { ErrorStrategy } from './errorStrategy';
+export const SQL_SPLIT_SYMBOL_TEXT = ';';
 /**
  * Basic SQL class, every sql needs extends it.
  */
@@ -155,31 +156,83 @@ export class BasicSQL {
         return res;
     }
     /**
-     * Get a minimum boundary parser near tokenIndex.
-     * @param input source string.
-     * @param tokenIndex start from which index to minimize the boundary.
-     * @param originParseTree the parse tree need to be minimized, default value is the result of parsing `input`.
-     * @returns minimum parser info
+     * Get the smaller range of input
+     * @param input string
+     * @param allTokens all tokens from input
+     * @param tokenIndexOffset offset of the tokenIndex in the range of input
+     * @param caretTokenIndex tokenIndex of caretPosition
+     * @returns inputSlice: string, caretTokenIndex: number
      */
-    getMinimumParserInfo(input, tokenIndex, originParseTree) {
-        var _a, _b, _c, _d, _e, _f, _g, _h, _j;
-        if (arguments.length <= 2) {
-            this.parseWithCache(input);
-            originParseTree = this._parseTree;
+    splitInputBySymbolText(input, allTokens, tokenIndexOffset, caretTokenIndex) {
+        const tokens = allTokens.slice(tokenIndexOffset);
+        /**
+         * Set startToken
+         */
+        let startToken = null;
+        for (let tokenIndex = caretTokenIndex - tokenIndexOffset; tokenIndex >= 0; tokenIndex--) {
+            const token = tokens[tokenIndex];
+            if ((token === null || token === void 0 ? void 0 : token.text) === SQL_SPLIT_SYMBOL_TEXT) {
+                startToken = tokens[tokenIndex + 1];
+                break;
+            }
+        }
+        if (startToken === null) {
+            startToken = tokens[0];
         }
+        /**
+         * Set stopToken
+         */
+        let stopToken = null;
+        for (let tokenIndex = caretTokenIndex - tokenIndexOffset; tokenIndex < tokens.length; tokenIndex++) {
+            const token = tokens[tokenIndex];
+            if ((token === null || token === void 0 ? void 0 : token.text) === SQL_SPLIT_SYMBOL_TEXT) {
+                stopToken = token;
+                break;
+            }
+        }
+        if (stopToken === null) {
+            stopToken = tokens[tokens.length - 1];
+        }
+        const indexOffset = tokens[0].start;
+        let startIndex = startToken.start - indexOffset;
+        let stopIndex = stopToken.stop + 1 - indexOffset;
+        /**
+         * Save offset of the tokenIndex in the range of input
+         * compared to the tokenIndex in the whole input
+         */
+        const _tokenIndexOffset = startToken.tokenIndex;
+        const _caretTokenIndex = caretTokenIndex - _tokenIndexOffset;
+        /**
+         * Get the smaller range of _input
+         */
+        const _input = input.slice(startIndex, stopIndex);
+        return {
+            inputSlice: _input,
+            allTokens: allTokens.slice(_tokenIndexOffset),
+            caretTokenIndex: _caretTokenIndex,
+        };
+    }
+    /**
+     * Get the minimum input string that can be parsed successfully by c3.
+     * @param input source string
+     * @param caretTokenIndex tokenIndex of caretPosition
+     * @param originParseTree origin parseTree
+     * @returns MinimumInputInfo
+     */
+    getMinimumInputInfo(input, caretTokenIndex, originParseTree) {
+        var _a, _b, _c, _d, _e, _f, _g, _h, _j;
         if (!originParseTree || !(input === null || input === void 0 ? void 0 : input.length))
             return null;
-        const splitListener = this.splitListener;
+        let inputSlice = input;
         /**
          * Split sql by statement.
          * Try to collect candidates in as small a range as possible.
          */
+        const splitListener = this.splitListener;
         this.listen(splitListener, originParseTree);
         const statementCount = (_a = splitListener.statementsContext) === null || _a === void 0 ? void 0 : _a.length;
         const statementsContext = splitListener.statementsContext;
         let tokenIndexOffset = 0;
-        let sqlParserIns = this._parser;
-        let parseTree = originParseTree;
         // If there are multiple statements.
         if (statementCount > 1) {
             /**
@@ -200,12 +253,12 @@ export class BasicSQL {
                  */
                 const isPrevCtxValid = index === 0 || !((_b = statementsContext[index - 1]) === null || _b === void 0 ? void 0 : _b.exception);
                 const isNextCtxValid = index === statementCount - 1 || !((_c = statementsContext[index + 1]) === null || _c === void 0 ? void 0 : _c.exception);
-                if (ctx.stop && ctx.stop.tokenIndex < tokenIndex && isPrevCtxValid) {
+                if (ctx.stop && ctx.stop.tokenIndex < caretTokenIndex && isPrevCtxValid) {
                     startStatement = ctx;
                 }
                 if (ctx.start &&
                     !stopStatement &&
-                    ctx.start.tokenIndex > tokenIndex &&
+                    ctx.start.tokenIndex > caretTokenIndex &&
                     isNextCtxValid) {
                     stopStatement = ctx;
                     break;
@@ -213,35 +266,50 @@ export class BasicSQL {
             }
             // A boundary consisting of the index of the input.
             const startIndex = (_e = (_d = startStatement === null || startStatement === void 0 ? void 0 : startStatement.start) === null || _d === void 0 ? void 0 : _d.start) !== null && _e !== void 0 ? _e : 0;
-            const stopIndex = (_g = (_f = stopStatement === null || stopStatement === void 0 ? void 0 : stopStatement.stop) === null || _f === void 0 ? void 0 : _f.stop) !== null && _g !== void 0 ? _g : input.length - 1;
+            const stopIndex = (_g = (_f = stopStatement === null || stopStatement === void 0 ? void 0 : stopStatement.stop) === null || _f === void 0 ? void 0 : _f.stop) !== null && _g !== void 0 ? _g : inputSlice.length - 1;
             /**
              * Save offset of the tokenIndex in the range of input
              * compared to the tokenIndex in the whole input
              */
             tokenIndexOffset = (_j = (_h = startStatement === null || startStatement === void 0 ? void 0 : startStatement.start) === null || _h === void 0 ? void 0 : _h.tokenIndex) !== null && _j !== void 0 ? _j : 0;
-            tokenIndex = tokenIndex - tokenIndexOffset;
-            /**
-             * Reparse the input fragment，
-             * and c3 will collect candidates in the newly generated parseTree.
-             */
-            const inputSlice = input.slice(startIndex, stopIndex);
-            const lexer = this.createLexer(inputSlice);
-            lexer.removeErrorListeners();
-            const tokenStream = new CommonTokenStream(lexer);
-            tokenStream.fill();
-            const parser = this.createParserFromTokenStream(tokenStream);
-            parser.interpreter.predictionMode = PredictionMode.SLL;
-            parser.removeErrorListeners();
-            parser.buildParseTrees = true;
-            parser.errorHandler = new ErrorStrategy();
-            sqlParserIns = parser;
-            parseTree = parser.program();
+            inputSlice = inputSlice.slice(startIndex, stopIndex);
+        }
+        return {
+            input: inputSlice,
+            tokenIndexOffset,
+            statementCount,
+        };
+    }
+    /**
+     * Get a minimum boundary parser near caretTokenIndex.
+     * @param input source string.
+     * @param caretTokenIndex start from which index to minimize the boundary.
+     * @param originParseTree the parse tree need to be minimized, default value is the result of parsing `input`.
+     * @returns minimum parser info
+     */
+    getMinimumParserInfo(input, caretTokenIndex, originParseTree) {
+        if (!originParseTree || !(input === null || input === void 0 ? void 0 : input.length))
+            return null;
+        const inputInfo = this.getMinimumInputInfo(input, caretTokenIndex, originParseTree);
+        if (!inputInfo)
+            return null;
+        const { input: inputSlice, tokenIndexOffset } = inputInfo;
+        caretTokenIndex = caretTokenIndex - tokenIndexOffset;
+        let sqlParserIns = this._parser;
+        let parseTree = originParseTree;
+        /**
+         * Reparse the input fragment,
+         * and c3 will collect candidates in the newly generated parseTree when input changed.
+         */
+        if (inputSlice !== input) {
+            sqlParserIns = this.createParser(inputSlice);
+            parseTree = sqlParserIns.program();
         }
         return {
             parser: sqlParserIns,
             parseTree,
             tokenIndexOffset,
-            newTokenIndex: tokenIndex,
+            newTokenIndex: caretTokenIndex,
         };
     }
     /**
@@ -254,18 +322,43 @@ export class BasicSQL {
         this.parseWithCache(input);
         if (!this._parseTree)
             return null;
-        const allTokens = this.getAllTokens(input);
+        let allTokens = this.getAllTokens(input);
         let caretTokenIndex = findCaretTokenIndex(caretPosition, allTokens);
         if (!caretTokenIndex && caretTokenIndex !== 0)
             return null;
-        const minimumParser = this.getMinimumParserInfo(input, caretTokenIndex);
-        if (!minimumParser)
+        const inputInfo = this.getMinimumInputInfo(input, caretTokenIndex, this._parseTree);
+        if (!inputInfo)
             return null;
-        const { parser: sqlParserIns, tokenIndexOffset, newTokenIndex, parseTree: c3Context, } = minimumParser;
+        const { input: _input, tokenIndexOffset, statementCount } = inputInfo;
+        let inputSlice = _input;
+        /**
+         * Split the inputSlice by separator to get the smaller range of inputSlice.
+         */
+        if (inputSlice.includes(SQL_SPLIT_SYMBOL_TEXT)) {
+            const { inputSlice: _inputSlice, allTokens: _allTokens, caretTokenIndex: _caretTokenIndex, } = this.splitInputBySymbolText(inputSlice, allTokens, tokenIndexOffset, caretTokenIndex);
+            allTokens = _allTokens;
+            caretTokenIndex = _caretTokenIndex;
+            inputSlice = _inputSlice;
+        }
+        else {
+            if (statementCount > 1) {
+                caretTokenIndex = caretTokenIndex - tokenIndexOffset;
+            }
+        }
+        let sqlParserIns = this._parser;
+        let parseTree = this._parseTree;
+        /**
+         * Reparse the input fragment,
+         * and c3 will collect candidates in the newly generated parseTree when input changed.
+         */
+        if (inputSlice !== input) {
+            sqlParserIns = this.createParser(inputSlice);
+            parseTree = sqlParserIns.program();
+        }
         const core = new CodeCompletionCore(sqlParserIns);
         core.preferredRules = this.preferredRules;
-        const candidates = core.collectCandidates(newTokenIndex, c3Context);
-        const originalSuggestions = this.processCandidates(candidates, allTokens, newTokenIndex, tokenIndexOffset);
+        const candidates = core.collectCandidates(caretTokenIndex, parseTree);
+        const originalSuggestions = this.processCandidates(candidates, allTokens, caretTokenIndex);
         const syntaxSuggestions = originalSuggestions.syntax.map((syntaxCtx) => {
             const wordRanges = syntaxCtx.wordRanges.map((token) => {
                 return tokenToWord(token, this._parsedInput);
@@ -300,4 +393,18 @@ export class BasicSQL {
         // parser.entityCollecting = false;
         return collectListener.getEntities();
     }
+    /**
+     * Get semantic context infos
+     * @param input source string
+     * @param caretPosition caret position, such as cursor position
+     * @param options semantic context options
+     * @returns analyzed semantic context
+     */
+    getSemanticContextAtCaretPosition(input, caretPosition, options) {
+        const allTokens = this.getAllTokens(input);
+        const parseTree = this.parseWithCache(input);
+        const statementContextListener = this.createSemanticContextCollector(input, caretPosition, allTokens, options);
+        this.listen(statementContextListener, parseTree);
+        return statementContextListener.semanticContext;
+    }
 }

package/dist/parser/common/semanticContextCollector.d.ts

@@ -0,0 +1,50 @@
+import { ErrorNode, ParserRuleContext, TerminalNode, Token } from 'antlr4ng';
+import { CaretPosition, SemanticCollectOptions, SemanticContext } from '../common/types';
+declare abstract class SemanticContextCollector {
+    constructor(_input: string, caretPosition: CaretPosition, allTokens: Token[], options?: SemanticCollectOptions);
+    readonly options: SemanticCollectOptions;
+    private _tokenIndex;
+    private _allTokens;
+    /**
+     * If current caret position is in a beginning of statement semantics, it needs to follow some cases:
+     * @case1 there is no statement node with an error before the current statement in the parse tree;
+     *
+     * @case2 if it is an uncomplete keyword, it will be parsed as an `ErrorNode`
+     * and need be a direct child node of `program`;
+     *
+     * @case3 if it is a complete keyword, the parsed TerminalNode or ErrorNode should be
+     * the first leaf node of current statement rule;
+     *
+     * @case4 if it is whiteSpace in caret position, we can't visit it in antlr4 listener,
+     * so we find the first unhidden token before the whiteSpace token, and the unhidden token
+     * should be the last leaf node of statement its belongs to;
+     *
+     * @case5 if the previous token is split symbol like `;`, ignore case1 and forcefully judged as beginning of statement.
+     */
+    private _isStatementBeginning;
+    /**
+     * Prev tokenIndex that not white space before current tokenIndex or caret position
+     */
+    private _prevTokenIndex;
+    get semanticContext(): SemanticContext;
+    abstract getWhiteSpaceRuleType(): number;
+    abstract getStatementRuleType(): number;
+    private prevStatementHasError;
+    /**
+     * Most root rule is `program`.
+     */
+    private isRootRule;
+    /**
+     * link to @case4
+     * It should be called in each language's own `enterStatement`.
+     */
+    protected visitStatement(ctx: ParserRuleContext): void;
+    /**
+     * Uncomplete keyword will be error node
+     */
+    visitErrorNode(node: ErrorNode): void;
+    visitTerminal(node: TerminalNode): void;
+    enterEveryRule(_node: ParserRuleContext): void;
+    exitEveryRule(_node: ParserRuleContext): void;
+}
+export default SemanticContextCollector;

package/dist/parser/common/semanticContextCollector.js

@@ -0,0 +1,202 @@
+import { ErrorNode, ParserRuleContext, Token } from 'antlr4ng';
+import { findCaretTokenIndex } from '../common/findCaretTokenIndex';
+import { SqlSplitStrategy, } from '../common/types';
+import { SQL_SPLIT_SYMBOL_TEXT } from './basicSQL';
+class SemanticContextCollector {
+    constructor(_input, caretPosition, allTokens, options) {
+        this.options = {
+            sqlSplitStrategy: SqlSplitStrategy.STRICT,
+        };
+        this._allTokens = [];
+        /**
+         * If current caret position is in a beginning of statement semantics, it needs to follow some cases:
+         * @case1 there is no statement node with an error before the current statement in the parse tree;
+         *
+         * @case2 if it is an uncomplete keyword, it will be parsed as an `ErrorNode`
+         * and need be a direct child node of `program`;
+         *
+         * @case3 if it is a complete keyword, the parsed TerminalNode or ErrorNode should be
+         * the first leaf node of current statement rule;
+         *
+         * @case4 if it is whiteSpace in caret position, we can't visit it in antlr4 listener,
+         * so we find the first unhidden token before the whiteSpace token, and the unhidden token
+         * should be the last leaf node of statement its belongs to;
+         *
+         * @case5 if the previous token is split symbol like `;`, ignore case1 and forcefully judged as beginning of statement.
+         */
+        this._isStatementBeginning = false;
+        // If caretPosition token is whiteSpace, tokenIndex may be undefined.
+        const tokenIndex = findCaretTokenIndex(caretPosition, allTokens);
+        if (tokenIndex !== undefined) {
+            this._tokenIndex = tokenIndex;
+        }
+        this._allTokens = allTokens;
+        this.options = Object.assign(Object.assign({}, this.options), options);
+        if (allTokens === null || allTokens === void 0 ? void 0 : allTokens.length) {
+            let i = tokenIndex ? tokenIndex - 1 : allTokens.length - 1;
+            /**
+             * Link to @case4 and @case5
+             * Find the previous unhidden token.
+             * If can't find tokenIndex or current token is whiteSpace at caretPosition,
+             * prevTokenIndex is useful to help us determine if it is beginning of statement.
+             */
+            while (i >= 0) {
+                if (allTokens[i].channel !== Token.HIDDEN_CHANNEL &&
+                    (allTokens[i].line < caretPosition.lineNumber ||
+                        (allTokens[i].line === caretPosition.lineNumber &&
+                            allTokens[i].column < caretPosition.column))) {
+                    this._prevTokenIndex = allTokens[i].tokenIndex;
+                    break;
+                }
+                i--;
+            }
+            /**
+             * We can directly conclude beginning of statement semantics when current token is
+             * the first token of tokenStream or the previous token is semicolon
+             */
+            if (tokenIndex === 0 ||
+                i === -1 ||
+                (this._prevTokenIndex &&
+                    this._allTokens[this._prevTokenIndex].text === SQL_SPLIT_SYMBOL_TEXT)) {
+                this._isStatementBeginning = true;
+            }
+        }
+    }
+    get semanticContext() {
+        return {
+            isStatementBeginning: this._isStatementBeginning,
+        };
+    }
+    prevStatementHasError(node) {
+        let parent = node.parent;
+        if (!parent)
+            return false;
+        const currentNodeIndex = parent.children.findIndex((child) => child === node);
+        if (currentNodeIndex <= 0)
+            return false;
+        for (let i = currentNodeIndex - 1; i >= 0; i--) {
+            const prevNode = parent.children[i];
+            if (prevNode instanceof ErrorNode ||
+                (prevNode instanceof ParserRuleContext && prevNode.exception !== null))
+                return true;
+        }
+        return false;
+    }
+    /**
+     * Most root rule is `program`.
+     */
+    isRootRule(node) {
+        return node instanceof ParserRuleContext && (node === null || node === void 0 ? void 0 : node.parent) === null;
+    }
+    /**
+     * link to @case4
+     * It should be called in each language's own `enterStatement`.
+     */
+    visitStatement(ctx) {
+        var _a, _b, _c;
+        if (this.options.sqlSplitStrategy === SqlSplitStrategy.STRICT)
+            return;
+        const isWhiteSpaceToken = this._tokenIndex === undefined ||
+            ((_a = this._allTokens[this._tokenIndex]) === null || _a === void 0 ? void 0 : _a.type) === this.getWhiteSpaceRuleType() ||
+            // PostgreSQL whiteSpace not inlcudes '\n' symbol
+            ((_b = this._allTokens[this._tokenIndex]) === null || _b === void 0 ? void 0 : _b.text) === '\n';
+        const isPrevTokenEndOfStatement = this._prevTokenIndex && ((_c = ctx.stop) === null || _c === void 0 ? void 0 : _c.tokenIndex) === this._prevTokenIndex;
+        if (isWhiteSpaceToken && isPrevTokenEndOfStatement && ctx.exception === null) {
+            this._isStatementBeginning = !this.prevStatementHasError(ctx)
+                ? true
+                : this._isStatementBeginning;
+        }
+    }
+    /**
+     * Uncomplete keyword will be error node
+     */
+    visitErrorNode(node) {
+        var _a, _b, _c, _d;
+        if (node.symbol.tokenIndex !== this._tokenIndex ||
+            this._isStatementBeginning ||
+            this.options.sqlSplitStrategy === SqlSplitStrategy.STRICT)
+            return;
+        let parent = node.parent;
+        let currentNode = node;
+        /**
+         * Link to @case2
+         * The error node is a direct child node of the program node
+         */
+        if (this.isRootRule(parent)) {
+            this._isStatementBeginning = !this.prevStatementHasError(currentNode);
+            return;
+        }
+        /**
+         * Link to @case3
+         * Error node must be the first leaf node of the statement parse tree.
+         **/
+        while (parent !== null && parent.ruleIndex !== this.getStatementRuleType()) {
+            if (((_a = parent.children) === null || _a === void 0 ? void 0 : _a[0]) !== currentNode) {
+                this._isStatementBeginning = false;
+                return;
+            }
+            currentNode = parent;
+            parent = currentNode.parent;
+        }
+        let isStatementBeginning = true;
+        /**
+         * Link to @case1
+         * Previous statement must have no exception
+         */
+        if ((parent === null || parent === void 0 ? void 0 : parent.ruleIndex) === this.getStatementRuleType()) {
+            const programRule = parent.parent;
+            const currentStatementRuleIndex = ((_b = programRule === null || programRule === void 0 ? void 0 : programRule.children) === null || _b === void 0 ? void 0 : _b.findIndex((node) => node === parent)) || -1;
+            if (currentStatementRuleIndex > 0) {
+                /**
+                 * When you typed a keyword and doesn't match any rule, you will get a EOF error,
+                 * For example, just typed 'CREATE', 'INSERT'.
+                 */
+                const isStatementEOF = ((_d = (_c = parent.exception) === null || _c === void 0 ? void 0 : _c.offendingToken) === null || _d === void 0 ? void 0 : _d.text) === '<EOF>';
+                isStatementBeginning =
+                    this.prevStatementHasError(parent) && !isStatementEOF
+                        ? false
+                        : isStatementBeginning;
+            }
+        }
+        this._isStatementBeginning = isStatementBeginning;
+    }
+    visitTerminal(node) {
+        var _a, _b;
+        if (node.symbol.tokenIndex !== this._tokenIndex ||
+            this._isStatementBeginning ||
+            this.options.sqlSplitStrategy === SqlSplitStrategy.STRICT)
+            return;
+        let currentNode = node;
+        let parent = node.parent;
+        /**
+         * Link to @case3
+         * Current terminal node must be the first leaf node of the statement parse tree.
+         **/
+        while (parent !== null && parent.ruleIndex !== this.getStatementRuleType()) {
+            if (((_a = parent.children) === null || _a === void 0 ? void 0 : _a[0]) !== currentNode) {
+                this._isStatementBeginning = false;
+                return;
+            }
+            currentNode = parent;
+            parent = currentNode.parent;
+        }
+        let isStatementBeginning = true;
+        /**
+         * Link to @case1
+         * Previous statement must have no exception
+         */
+        if ((parent === null || parent === void 0 ? void 0 : parent.ruleIndex) === this.getStatementRuleType()) {
+            const programRule = parent.parent;
+            const currentStatementRuleIndex = ((_b = programRule === null || programRule === void 0 ? void 0 : programRule.children) === null || _b === void 0 ? void 0 : _b.findIndex((node) => node === parent)) || -1;
+            if (currentStatementRuleIndex > 0) {
+                isStatementBeginning = this.prevStatementHasError(parent)
+                    ? false
+                    : isStatementBeginning;
+            }
+        }
+        this._isStatementBeginning = isStatementBeginning;
+    }
+    enterEveryRule(_node) { }
+    exitEveryRule(_node) { }
+}
+export default SemanticContextCollector;