neilotoole/sq
1
1
Fork 0
mirror of https://github.com/neilotoole/sq.git synced 2024-12-19 22:21:56 +03:00
Code Issues Actions Packages Projects Releases Wiki Activity
3f6157c4c4
sq/libsq/ast/internal/slq/slq_parser.go
Neil O'Toole 8d47ef806d
go1.20 upgrade; lots of linting (#172)
2023-04-01 02:38:32 -06:00

4725 lines
107 KiB
Go
Raw Blame History

// Code generated from SLQ.g4 by ANTLR 4.12.0. DO NOT EDIT.
package slq // SLQ
import (
"fmt"
"strconv"
"sync"
"github.com/antlr/antlr4/runtime/Go/antlr/v4"
)
// Suppress unused import errors
var _ = fmt.Printf
var _ = strconv.Itoa
var _ = sync.Once{}
type SLQParser struct {
*antlr.BaseParser
}
var slqParserStaticData struct {
once sync.Once
serializedATN []int32
literalNames []string
symbolicNames []string
ruleNames []string
predictionContextCache *antlr.PredictionContextCache
atn *antlr.ATN
decisionToDFA []*antlr.DFA
}
func slqParserInit() {
staticData := &slqParserStaticData
staticData.literalNames = []string{
"", "';'", "'*'", "'join'", "'unique'", "'count'", "'.['", "'||'", "'/'",
"'%'", "'<<'", "'>>'", "'&'", "'&&'", "'~'", "'!'", "'group_by'", "'+'",
"'-'", "", "", "", "", "", "'('", "')'", "'['", "']'", "','", "'|'",
"':'", "", "", "", "'<='", "'<'", "'>='", "'>'", "'!='", "'=='",
}
staticData.symbolicNames = []string{
"", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "GROUP_BY",
"ORDER_ASC", "ORDER_DESC", "ORDER_BY", "ALIAS_RESERVED", "ARG", "ID",
"WS", "LPAR", "RPAR", "LBRA", "RBRA", "COMMA", "PIPE", "COLON", "NULL",
"NN", "NUMBER", "LT_EQ", "LT", "GT_EQ", "GT", "NEQ", "EQ", "NAME", "HANDLE",
"STRING", "LINECOMMENT",
}
staticData.ruleNames = []string{
"stmtList", "query", "segment", "element", "cmpr", "funcElement", "func",
"funcName", "join", "joinConstraint", "uniqueFunc", "countFunc", "groupByTerm",
"groupBy", "orderByTerm", "orderBy", "selector", "selectorElement",
"alias", "handleTable", "handle", "rowRange", "expr", "literal", "unaryOperator",
}
staticData.predictionContextCache = antlr.NewPredictionContextCache()
staticData.serializedATN = []int32{
4, 1, 43, 258, 2, 0, 7, 0, 2, 1, 7, 1, 2, 2, 7, 2, 2, 3, 7, 3, 2, 4, 7,
4, 2, 5, 7, 5, 2, 6, 7, 6, 2, 7, 7, 7, 2, 8, 7, 8, 2, 9, 7, 9, 2, 10, 7,
10, 2, 11, 7, 11, 2, 12, 7, 12, 2, 13, 7, 13, 2, 14, 7, 14, 2, 15, 7, 15,
2, 16, 7, 16, 2, 17, 7, 17, 2, 18, 7, 18, 2, 19, 7, 19, 2, 20, 7, 20, 2,
21, 7, 21, 2, 22, 7, 22, 2, 23, 7, 23, 2, 24, 7, 24, 1, 0, 5, 0, 52, 8,
0, 10, 0, 12, 0, 55, 9, 0, 1, 0, 1, 0, 4, 0, 59, 8, 0, 11, 0, 12, 0, 60,
1, 0, 5, 0, 64, 8, 0, 10, 0, 12, 0, 67, 9, 0, 1, 0, 5, 0, 70, 8, 0, 10,
0, 12, 0, 73, 9, 0, 1, 1, 1, 1, 1, 1, 5, 1, 78, 8, 1, 10, 1, 12, 1, 81,
9, 1, 1, 2, 1, 2, 1, 2, 5, 2, 86, 8, 2, 10, 2, 12, 2, 89, 9, 2, 1, 3, 1,
3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 3, 3, 102, 8,
3, 1, 4, 1, 4, 1, 5, 1, 5, 3, 5, 108, 8, 5, 1, 6, 1, 6, 1, 6, 1, 6, 1,
6, 5, 6, 115, 8, 6, 10, 6, 12, 6, 118, 9, 6, 1, 6, 3, 6, 121, 8, 6, 1,
6, 1, 6, 1, 7, 1, 7, 1, 8, 1, 8, 1, 8, 1, 8, 1, 8, 1, 9, 1, 9, 1, 9, 1,
9, 1, 9, 3, 9, 137, 8, 9, 1, 10, 1, 10, 1, 11, 1, 11, 1, 11, 3, 11, 144,
8, 11, 1, 11, 3, 11, 147, 8, 11, 1, 11, 3, 11, 150, 8, 11, 1, 12, 1, 12,
3, 12, 154, 8, 12, 1, 13, 1, 13, 1, 13, 1, 13, 1, 13, 5, 13, 161, 8, 13,
10, 13, 12, 13, 164, 9, 13, 1, 13, 1, 13, 1, 14, 1, 14, 3, 14, 170, 8,
14, 1, 15, 1, 15, 1, 15, 1, 15, 1, 15, 5, 15, 177, 8, 15, 10, 15, 12, 15,
180, 9, 15, 1, 15, 1, 15, 1, 16, 1, 16, 3, 16, 186, 8, 16, 1, 17, 1, 17,
3, 17, 190, 8, 17, 1, 18, 1, 18, 1, 18, 3, 18, 195, 8, 18, 1, 19, 1, 19,
1, 19, 1, 20, 1, 20, 1, 21, 1, 21, 1, 21, 1, 21, 1, 21, 1, 21, 1, 21, 1,
21, 1, 21, 3, 21, 211, 8, 21, 1, 21, 1, 21, 1, 22, 1, 22, 1, 22, 1, 22,
1, 22, 1, 22, 1, 22, 3, 22, 222, 8, 22, 1, 22, 1, 22, 1, 22, 1, 22, 1,
22, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22, 1, 22,
1, 22, 1, 22, 1, 22, 1, 22, 3, 22, 243, 8, 22, 1, 22, 1, 22, 1, 22, 1,
22, 5, 22, 249, 8, 22, 10, 22, 12, 22, 252, 9, 22, 1, 23, 1, 23, 1, 24,
1, 24, 1, 24, 0, 1, 44, 25, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22,
24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 0, 8, 1, 0, 34, 39,
1, 0, 17, 18, 1, 0, 21, 22, 2, 0, 2, 2, 8, 9, 1, 0, 10, 12, 1, 0, 34, 37,
2, 0, 31, 33, 42, 42, 2, 0, 14, 15, 17, 18, 279, 0, 53, 1, 0, 0, 0, 2,
74, 1, 0, 0, 0, 4, 82, 1, 0, 0, 0, 6, 101, 1, 0, 0, 0, 8, 103, 1, 0, 0,
0, 10, 105, 1, 0, 0, 0, 12, 109, 1, 0, 0, 0, 14, 124, 1, 0, 0, 0, 16, 126,
1, 0, 0, 0, 18, 136, 1, 0, 0, 0, 20, 138, 1, 0, 0, 0, 22, 140, 1, 0, 0,
0, 24, 153, 1, 0, 0, 0, 26, 155, 1, 0, 0, 0, 28, 167, 1, 0, 0, 0, 30, 171,
1, 0, 0, 0, 32, 183, 1, 0, 0, 0, 34, 187, 1, 0, 0, 0, 36, 194, 1, 0, 0,
0, 38, 196, 1, 0, 0, 0, 40, 199, 1, 0, 0, 0, 42, 201, 1, 0, 0, 0, 44, 221,
1, 0, 0, 0, 46, 253, 1, 0, 0, 0, 48, 255, 1, 0, 0, 0, 50, 52, 5, 1, 0,
0, 51, 50, 1, 0, 0, 0, 52, 55, 1, 0, 0, 0, 53, 51, 1, 0, 0, 0, 53, 54,
1, 0, 0, 0, 54, 56, 1, 0, 0, 0, 55, 53, 1, 0, 0, 0, 56, 65, 3, 2, 1, 0,
57, 59, 5, 1, 0, 0, 58, 57, 1, 0, 0, 0, 59, 60, 1, 0, 0, 0, 60, 58, 1,
0, 0, 0, 60, 61, 1, 0, 0, 0, 61, 62, 1, 0, 0, 0, 62, 64, 3, 2, 1, 0, 63,
58, 1, 0, 0, 0, 64, 67, 1, 0, 0, 0, 65, 63, 1, 0, 0, 0, 65, 66, 1, 0, 0,
0, 66, 71, 1, 0, 0, 0, 67, 65, 1, 0, 0, 0, 68, 70, 5, 1, 0, 0, 69, 68,
1, 0, 0, 0, 70, 73, 1, 0, 0, 0, 71, 69, 1, 0, 0, 0, 71, 72, 1, 0, 0, 0,
72, 1, 1, 0, 0, 0, 73, 71, 1, 0, 0, 0, 74, 79, 3, 4, 2, 0, 75, 76, 5, 29,
0, 0, 76, 78, 3, 4, 2, 0, 77, 75, 1, 0, 0, 0, 78, 81, 1, 0, 0, 0, 79, 77,
1, 0, 0, 0, 79, 80, 1, 0, 0, 0, 80, 3, 1, 0, 0, 0, 81, 79, 1, 0, 0, 0,
82, 87, 3, 6, 3, 0, 83, 84, 5, 28, 0, 0, 84, 86, 3, 6, 3, 0, 85, 83, 1,
0, 0, 0, 86, 89, 1, 0, 0, 0, 87, 85, 1, 0, 0, 0, 87, 88, 1, 0, 0, 0, 88,
5, 1, 0, 0, 0, 89, 87, 1, 0, 0, 0, 90, 102, 3, 38, 19, 0, 91, 102, 3, 40,
20, 0, 92, 102, 3, 34, 17, 0, 93, 102, 3, 16, 8, 0, 94, 102, 3, 26, 13,
0, 95, 102, 3, 30, 15, 0, 96, 102, 3, 42, 21, 0, 97, 102, 3, 20, 10, 0,
98, 102, 3, 22, 11, 0, 99, 102, 3, 10, 5, 0, 100, 102, 3, 44, 22, 0, 101,
90, 1, 0, 0, 0, 101, 91, 1, 0, 0, 0, 101, 92, 1, 0, 0, 0, 101, 93, 1, 0,
0, 0, 101, 94, 1, 0, 0, 0, 101, 95, 1, 0, 0, 0, 101, 96, 1, 0, 0, 0, 101,
97, 1, 0, 0, 0, 101, 98, 1, 0, 0, 0, 101, 99, 1, 0, 0, 0, 101, 100, 1,
0, 0, 0, 102, 7, 1, 0, 0, 0, 103, 104, 7, 0, 0, 0, 104, 9, 1, 0, 0, 0,
105, 107, 3, 12, 6, 0, 106, 108, 3, 36, 18, 0, 107, 106, 1, 0, 0, 0, 107,
108, 1, 0, 0, 0, 108, 11, 1, 0, 0, 0, 109, 110, 3, 14, 7, 0, 110, 120,
5, 24, 0, 0, 111, 116, 3, 44, 22, 0, 112, 113, 5, 28, 0, 0, 113, 115, 3,
44, 22, 0, 114, 112, 1, 0, 0, 0, 115, 118, 1, 0, 0, 0, 116, 114, 1, 0,
0, 0, 116, 117, 1, 0, 0, 0, 117, 121, 1, 0, 0, 0, 118, 116, 1, 0, 0, 0,
119, 121, 5, 2, 0, 0, 120, 111, 1, 0, 0, 0, 120, 119, 1, 0, 0, 0, 120,
121, 1, 0, 0, 0, 121, 122, 1, 0, 0, 0, 122, 123, 5, 25, 0, 0, 123, 13,
1, 0, 0, 0, 124, 125, 5, 22, 0, 0, 125, 15, 1, 0, 0, 0, 126, 127, 5, 3,
0, 0, 127, 128, 5, 24, 0, 0, 128, 129, 3, 18, 9, 0, 129, 130, 5, 25, 0,
0, 130, 17, 1, 0, 0, 0, 131, 132, 3, 32, 16, 0, 132, 133, 3, 8, 4, 0, 133,
134, 3, 32, 16, 0, 134, 137, 1, 0, 0, 0, 135, 137, 3, 32, 16, 0, 136, 131,
1, 0, 0, 0, 136, 135, 1, 0, 0, 0, 137, 19, 1, 0, 0, 0, 138, 139, 5, 4,
0, 0, 139, 21, 1, 0, 0, 0, 140, 146, 5, 5, 0, 0, 141, 143, 5, 24, 0, 0,
142, 144, 3, 32, 16, 0, 143, 142, 1, 0, 0, 0, 143, 144, 1, 0, 0, 0, 144,
145, 1, 0, 0, 0, 145, 147, 5, 25, 0, 0, 146, 141, 1, 0, 0, 0, 146, 147,
1, 0, 0, 0, 147, 149, 1, 0, 0, 0, 148, 150, 3, 36, 18, 0, 149, 148, 1,
0, 0, 0, 149, 150, 1, 0, 0, 0, 150, 23, 1, 0, 0, 0, 151, 154, 3, 32, 16,
0, 152, 154, 3, 12, 6, 0, 153, 151, 1, 0, 0, 0, 153, 152, 1, 0, 0, 0, 154,
25, 1, 0, 0, 0, 155, 156, 5, 16, 0, 0, 156, 157, 5, 24, 0, 0, 157, 162,
3, 24, 12, 0, 158, 159, 5, 28, 0, 0, 159, 161, 3, 24, 12, 0, 160, 158,
1, 0, 0, 0, 161, 164, 1, 0, 0, 0, 162, 160, 1, 0, 0, 0, 162, 163, 1, 0,
0, 0, 163, 165, 1, 0, 0, 0, 164, 162, 1, 0, 0, 0, 165, 166, 5, 25, 0, 0,
166, 27, 1, 0, 0, 0, 167, 169, 3, 32, 16, 0, 168, 170, 7, 1, 0, 0, 169,
168, 1, 0, 0, 0, 169, 170, 1, 0, 0, 0, 170, 29, 1, 0, 0, 0, 171, 172, 5,
19, 0, 0, 172, 173, 5, 24, 0, 0, 173, 178, 3, 28, 14, 0, 174, 175, 5, 28,
0, 0, 175, 177, 3, 28, 14, 0, 176, 174, 1, 0, 0, 0, 177, 180, 1, 0, 0,
0, 178, 176, 1, 0, 0, 0, 178, 179, 1, 0, 0, 0, 179, 181, 1, 0, 0, 0, 180,
178, 1, 0, 0, 0, 181, 182, 5, 25, 0, 0, 182, 31, 1, 0, 0, 0, 183, 185,
5, 40, 0, 0, 184, 186, 5, 40, 0, 0, 185, 184, 1, 0, 0, 0, 185, 186, 1,
0, 0, 0, 186, 33, 1, 0, 0, 0, 187, 189, 3, 32, 16, 0, 188, 190, 3, 36,
18, 0, 189, 188, 1, 0, 0, 0, 189, 190, 1, 0, 0, 0, 190, 35, 1, 0, 0, 0,
191, 195, 5, 20, 0, 0, 192, 193, 5, 30, 0, 0, 193, 195, 7, 2, 0, 0, 194,
191, 1, 0, 0, 0, 194, 192, 1, 0, 0, 0, 195, 37, 1, 0, 0, 0, 196, 197, 5,
41, 0, 0, 197, 198, 5, 40, 0, 0, 198, 39, 1, 0, 0, 0, 199, 200, 5, 41,
0, 0, 200, 41, 1, 0, 0, 0, 201, 210, 5, 6, 0, 0, 202, 203, 5, 32, 0, 0,
203, 204, 5, 30, 0, 0, 204, 211, 5, 32, 0, 0, 205, 206, 5, 32, 0, 0, 206,
211, 5, 30, 0, 0, 207, 208, 5, 30, 0, 0, 208, 211, 5, 32, 0, 0, 209, 211,
5, 32, 0, 0, 210, 202, 1, 0, 0, 0, 210, 205, 1, 0, 0, 0, 210, 207, 1, 0,
0, 0, 210, 209, 1, 0, 0, 0, 210, 211, 1, 0, 0, 0, 211, 212, 1, 0, 0, 0,
212, 213, 5, 27, 0, 0, 213, 43, 1, 0, 0, 0, 214, 215, 6, 22, -1, 0, 215,
222, 3, 32, 16, 0, 216, 222, 3, 46, 23, 0, 217, 218, 3, 48, 24, 0, 218,
219, 3, 44, 22, 9, 219, 222, 1, 0, 0, 0, 220, 222, 3, 12, 6, 0, 221, 214,
1, 0, 0, 0, 221, 216, 1, 0, 0, 0, 221, 217, 1, 0, 0, 0, 221, 220, 1, 0,
0, 0, 222, 250, 1, 0, 0, 0, 223, 224, 10, 8, 0, 0, 224, 225, 5, 7, 0, 0,
225, 249, 3, 44, 22, 9, 226, 227, 10, 7, 0, 0, 227, 228, 7, 3, 0, 0, 228,
249, 3, 44, 22, 8, 229, 230, 10, 6, 0, 0, 230, 231, 7, 1, 0, 0, 231, 249,
3, 44, 22, 7, 232, 233, 10, 5, 0, 0, 233, 234, 7, 4, 0, 0, 234, 249, 3,
44, 22, 6, 235, 236, 10, 4, 0, 0, 236, 237, 7, 5, 0, 0, 237, 249, 3, 44,
22, 5, 238, 242, 10, 3, 0, 0, 239, 243, 5, 39, 0, 0, 240, 243, 5, 38, 0,
0, 241, 243, 1, 0, 0, 0, 242, 239, 1, 0, 0, 0, 242, 240, 1, 0, 0, 0, 242,
241, 1, 0, 0, 0, 243, 244, 1, 0, 0, 0, 244, 249, 3, 44, 22, 4, 245, 246,
10, 2, 0, 0, 246, 247, 5, 13, 0, 0, 247, 249, 3, 44, 22, 3, 248, 223, 1,
0, 0, 0, 248, 226, 1, 0, 0, 0, 248, 229, 1, 0, 0, 0, 248, 232, 1, 0, 0,
0, 248, 235, 1, 0, 0, 0, 248, 238, 1, 0, 0, 0, 248, 245, 1, 0, 0, 0, 249,
252, 1, 0, 0, 0, 250, 248, 1, 0, 0, 0, 250, 251, 1, 0, 0, 0, 251, 45, 1,
0, 0, 0, 252, 250, 1, 0, 0, 0, 253, 254, 7, 6, 0, 0, 254, 47, 1, 0, 0,
0, 255, 256, 7, 7, 0, 0, 256, 49, 1, 0, 0, 0, 26, 53, 60, 65, 71, 79, 87,
101, 107, 116, 120, 136, 143, 146, 149, 153, 162, 169, 178, 185, 189, 194,
210, 221, 242, 248, 250,
}
deserializer := antlr.NewATNDeserializer(nil)
staticData.atn = deserializer.Deserialize(staticData.serializedATN)
atn := staticData.atn
staticData.decisionToDFA = make([]*antlr.DFA, len(atn.DecisionToState))
decisionToDFA := staticData.decisionToDFA
for index, state := range atn.DecisionToState {
decisionToDFA[index] = antlr.NewDFA(state, index)
}
}
// SLQParserInit initializes any static state used to implement SLQParser. By default the
// static state used to implement the parser is lazily initialized during the first call to
// NewSLQParser(). You can call this function if you wish to initialize the static state ahead
// of time.
func SLQParserInit() {
staticData := &slqParserStaticData
staticData.once.Do(slqParserInit)
}
// NewSLQParser produces a new parser instance for the optional input antlr.TokenStream.
func NewSLQParser(input antlr.TokenStream) *SLQParser {
SLQParserInit()
this := new(SLQParser)
this.BaseParser = antlr.NewBaseParser(input)
staticData := &slqParserStaticData
this.Interpreter = antlr.NewParserATNSimulator(this, staticData.atn, staticData.decisionToDFA, staticData.predictionContextCache)
this.RuleNames = staticData.ruleNames
this.LiteralNames = staticData.literalNames
this.SymbolicNames = staticData.symbolicNames
this.GrammarFileName = "SLQ.g4"
return this
}
// SLQParser tokens.
const (
SLQParserEOF = antlr.TokenEOF
SLQParserT__0 = 1
SLQParserT__1 = 2
SLQParserT__2 = 3
SLQParserT__3 = 4
SLQParserT__4 = 5
SLQParserT__5 = 6
SLQParserT__6 = 7
SLQParserT__7 = 8
SLQParserT__8 = 9
SLQParserT__9 = 10
SLQParserT__10 = 11
SLQParserT__11 = 12
SLQParserT__12 = 13
SLQParserT__13 = 14
SLQParserT__14 = 15
SLQParserGROUP_BY = 16
SLQParserORDER_ASC = 17
SLQParserORDER_DESC = 18
SLQParserORDER_BY = 19
SLQParserALIAS_RESERVED = 20
SLQParserARG = 21
SLQParserID = 22
SLQParserWS = 23
SLQParserLPAR = 24
SLQParserRPAR = 25
SLQParserLBRA = 26
SLQParserRBRA = 27
SLQParserCOMMA = 28
SLQParserPIPE = 29
SLQParserCOLON = 30
SLQParserNULL = 31
SLQParserNN = 32
SLQParserNUMBER = 33
SLQParserLT_EQ = 34
SLQParserLT = 35
SLQParserGT_EQ = 36
SLQParserGT = 37
SLQParserNEQ = 38
SLQParserEQ = 39
SLQParserNAME = 40
SLQParserHANDLE = 41
SLQParserSTRING = 42
SLQParserLINECOMMENT = 43
)
// SLQParser rules.
const (
SLQParserRULE_stmtList = 0
SLQParserRULE_query = 1
SLQParserRULE_segment = 2
SLQParserRULE_element = 3
SLQParserRULE_cmpr = 4
SLQParserRULE_funcElement = 5
SLQParserRULE_func = 6
SLQParserRULE_funcName = 7
SLQParserRULE_join = 8
SLQParserRULE_joinConstraint = 9
SLQParserRULE_uniqueFunc = 10
SLQParserRULE_countFunc = 11
SLQParserRULE_groupByTerm = 12
SLQParserRULE_groupBy = 13
SLQParserRULE_orderByTerm = 14
SLQParserRULE_orderBy = 15
SLQParserRULE_selector = 16
SLQParserRULE_selectorElement = 17
SLQParserRULE_alias = 18
SLQParserRULE_handleTable = 19
SLQParserRULE_handle = 20
SLQParserRULE_rowRange = 21
SLQParserRULE_expr = 22
SLQParserRULE_literal = 23
SLQParserRULE_unaryOperator = 24
)
// IStmtListContext is an interface to support dynamic dispatch.
type IStmtListContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
AllQuery() []IQueryContext
Query(i int) IQueryContext
// IsStmtListContext differentiates from other interfaces.
IsStmtListContext()
}
type StmtListContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyStmtListContext() *StmtListContext {
var p = new(StmtListContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_stmtList
return p
}
func (*StmtListContext) IsStmtListContext() {}
func NewStmtListContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *StmtListContext {
var p = new(StmtListContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_stmtList
return p
}
func (s *StmtListContext) GetParser() antlr.Parser { return s.parser }
func (s *StmtListContext) AllQuery() []IQueryContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(IQueryContext); ok {
len++
}
}
tst := make([]IQueryContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(IQueryContext); ok {
tst[i] = t.(IQueryContext)
i++
}
}
return tst
}
func (s *StmtListContext) Query(i int) IQueryContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IQueryContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(IQueryContext)
}
func (s *StmtListContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *StmtListContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *StmtListContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterStmtList(s)
}
}
func (s *StmtListContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitStmtList(s)
}
}
func (s *StmtListContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitStmtList(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) StmtList() (localctx IStmtListContext) {
this := p
_ = this
localctx = NewStmtListContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 0, SLQParserRULE_stmtList)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
var _alt int
p.EnterOuterAlt(localctx, 1)
p.SetState(53)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserT__0 {
{
p.SetState(50)
p.Match(SLQParserT__0)
}
p.SetState(55)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
{
p.SetState(56)
p.Query()
}
p.SetState(65)
p.GetErrorHandler().Sync(p)
_alt = p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 2, p.GetParserRuleContext())
for _alt != 2 && _alt != antlr.ATNInvalidAltNumber {
if _alt == 1 {
p.SetState(58)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for ok := true; ok; ok = _la == SLQParserT__0 {
{
p.SetState(57)
p.Match(SLQParserT__0)
}
p.SetState(60)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
{
p.SetState(62)
p.Query()
}
}
p.SetState(67)
p.GetErrorHandler().Sync(p)
_alt = p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 2, p.GetParserRuleContext())
}
p.SetState(71)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserT__0 {
{
p.SetState(68)
p.Match(SLQParserT__0)
}
p.SetState(73)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
return localctx
}
// IQueryContext is an interface to support dynamic dispatch.
type IQueryContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
AllSegment() []ISegmentContext
Segment(i int) ISegmentContext
AllPIPE() []antlr.TerminalNode
PIPE(i int) antlr.TerminalNode
// IsQueryContext differentiates from other interfaces.
IsQueryContext()
}
type QueryContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyQueryContext() *QueryContext {
var p = new(QueryContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_query
return p
}
func (*QueryContext) IsQueryContext() {}
func NewQueryContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *QueryContext {
var p = new(QueryContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_query
return p
}
func (s *QueryContext) GetParser() antlr.Parser { return s.parser }
func (s *QueryContext) AllSegment() []ISegmentContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(ISegmentContext); ok {
len++
}
}
tst := make([]ISegmentContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(ISegmentContext); ok {
tst[i] = t.(ISegmentContext)
i++
}
}
return tst
}
func (s *QueryContext) Segment(i int) ISegmentContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISegmentContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(ISegmentContext)
}
func (s *QueryContext) AllPIPE() []antlr.TerminalNode {
return s.GetTokens(SLQParserPIPE)
}
func (s *QueryContext) PIPE(i int) antlr.TerminalNode {
return s.GetToken(SLQParserPIPE, i)
}
func (s *QueryContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *QueryContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *QueryContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterQuery(s)
}
}
func (s *QueryContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitQuery(s)
}
}
func (s *QueryContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitQuery(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Query() (localctx IQueryContext) {
this := p
_ = this
localctx = NewQueryContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 2, SLQParserRULE_query)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(74)
p.Segment()
}
p.SetState(79)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserPIPE {
{
p.SetState(75)
p.Match(SLQParserPIPE)
}
{
p.SetState(76)
p.Segment()
}
p.SetState(81)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
return localctx
}
// ISegmentContext is an interface to support dynamic dispatch.
type ISegmentContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
AllElement() []IElementContext
Element(i int) IElementContext
AllCOMMA() []antlr.TerminalNode
COMMA(i int) antlr.TerminalNode
// IsSegmentContext differentiates from other interfaces.
IsSegmentContext()
}
type SegmentContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptySegmentContext() *SegmentContext {
var p = new(SegmentContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_segment
return p
}
func (*SegmentContext) IsSegmentContext() {}
func NewSegmentContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *SegmentContext {
var p = new(SegmentContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_segment
return p
}
func (s *SegmentContext) GetParser() antlr.Parser { return s.parser }
func (s *SegmentContext) AllElement() []IElementContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(IElementContext); ok {
len++
}
}
tst := make([]IElementContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(IElementContext); ok {
tst[i] = t.(IElementContext)
i++
}
}
return tst
}
func (s *SegmentContext) Element(i int) IElementContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IElementContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(IElementContext)
}
func (s *SegmentContext) AllCOMMA() []antlr.TerminalNode {
return s.GetTokens(SLQParserCOMMA)
}
func (s *SegmentContext) COMMA(i int) antlr.TerminalNode {
return s.GetToken(SLQParserCOMMA, i)
}
func (s *SegmentContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *SegmentContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *SegmentContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterSegment(s)
}
}
func (s *SegmentContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitSegment(s)
}
}
func (s *SegmentContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitSegment(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Segment() (localctx ISegmentContext) {
this := p
_ = this
localctx = NewSegmentContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 4, SLQParserRULE_segment)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(82)
p.Element()
}
p.SetState(87)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserCOMMA {
{
p.SetState(83)
p.Match(SLQParserCOMMA)
}
{
p.SetState(84)
p.Element()
}
p.SetState(89)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
return localctx
}
// IElementContext is an interface to support dynamic dispatch.
type IElementContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
HandleTable() IHandleTableContext
Handle() IHandleContext
SelectorElement() ISelectorElementContext
Join() IJoinContext
GroupBy() IGroupByContext
OrderBy() IOrderByContext
RowRange() IRowRangeContext
UniqueFunc() IUniqueFuncContext
CountFunc() ICountFuncContext
FuncElement() IFuncElementContext
Expr() IExprContext
// IsElementContext differentiates from other interfaces.
IsElementContext()
}
type ElementContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyElementContext() *ElementContext {
var p = new(ElementContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_element
return p
}
func (*ElementContext) IsElementContext() {}
func NewElementContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *ElementContext {
var p = new(ElementContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_element
return p
}
func (s *ElementContext) GetParser() antlr.Parser { return s.parser }
func (s *ElementContext) HandleTable() IHandleTableContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IHandleTableContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IHandleTableContext)
}
func (s *ElementContext) Handle() IHandleContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IHandleContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IHandleContext)
}
func (s *ElementContext) SelectorElement() ISelectorElementContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorElementContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ISelectorElementContext)
}
func (s *ElementContext) Join() IJoinContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IJoinContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IJoinContext)
}
func (s *ElementContext) GroupBy() IGroupByContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IGroupByContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IGroupByContext)
}
func (s *ElementContext) OrderBy() IOrderByContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IOrderByContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IOrderByContext)
}
func (s *ElementContext) RowRange() IRowRangeContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IRowRangeContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IRowRangeContext)
}
func (s *ElementContext) UniqueFunc() IUniqueFuncContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IUniqueFuncContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IUniqueFuncContext)
}
func (s *ElementContext) CountFunc() ICountFuncContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ICountFuncContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ICountFuncContext)
}
func (s *ElementContext) FuncElement() IFuncElementContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IFuncElementContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IFuncElementContext)
}
func (s *ElementContext) Expr() IExprContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IExprContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IExprContext)
}
func (s *ElementContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *ElementContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *ElementContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterElement(s)
}
}
func (s *ElementContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitElement(s)
}
}
func (s *ElementContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitElement(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Element() (localctx IElementContext) {
this := p
_ = this
localctx = NewElementContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 6, SLQParserRULE_element)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.SetState(101)
p.GetErrorHandler().Sync(p)
switch p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 6, p.GetParserRuleContext()) {
case 1:
p.EnterOuterAlt(localctx, 1)
{
p.SetState(90)
p.HandleTable()
}
case 2:
p.EnterOuterAlt(localctx, 2)
{
p.SetState(91)
p.Handle()
}
case 3:
p.EnterOuterAlt(localctx, 3)
{
p.SetState(92)
p.SelectorElement()
}
case 4:
p.EnterOuterAlt(localctx, 4)
{
p.SetState(93)
p.Join()
}
case 5:
p.EnterOuterAlt(localctx, 5)
{
p.SetState(94)
p.GroupBy()
}
case 6:
p.EnterOuterAlt(localctx, 6)
{
p.SetState(95)
p.OrderBy()
}
case 7:
p.EnterOuterAlt(localctx, 7)
{
p.SetState(96)
p.RowRange()
}
case 8:
p.EnterOuterAlt(localctx, 8)
{
p.SetState(97)
p.UniqueFunc()
}
case 9:
p.EnterOuterAlt(localctx, 9)
{
p.SetState(98)
p.CountFunc()
}
case 10:
p.EnterOuterAlt(localctx, 10)
{
p.SetState(99)
p.FuncElement()
}
case 11:
p.EnterOuterAlt(localctx, 11)
{
p.SetState(100)
p.expr(0)
}
}
return localctx
}
// ICmprContext is an interface to support dynamic dispatch.
type ICmprContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
LT_EQ() antlr.TerminalNode
LT() antlr.TerminalNode
GT_EQ() antlr.TerminalNode
GT() antlr.TerminalNode
EQ() antlr.TerminalNode
NEQ() antlr.TerminalNode
// IsCmprContext differentiates from other interfaces.
IsCmprContext()
}
type CmprContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyCmprContext() *CmprContext {
var p = new(CmprContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_cmpr
return p
}
func (*CmprContext) IsCmprContext() {}
func NewCmprContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *CmprContext {
var p = new(CmprContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_cmpr
return p
}
func (s *CmprContext) GetParser() antlr.Parser { return s.parser }
func (s *CmprContext) LT_EQ() antlr.TerminalNode {
return s.GetToken(SLQParserLT_EQ, 0)
}
func (s *CmprContext) LT() antlr.TerminalNode {
return s.GetToken(SLQParserLT, 0)
}
func (s *CmprContext) GT_EQ() antlr.TerminalNode {
return s.GetToken(SLQParserGT_EQ, 0)
}
func (s *CmprContext) GT() antlr.TerminalNode {
return s.GetToken(SLQParserGT, 0)
}
func (s *CmprContext) EQ() antlr.TerminalNode {
return s.GetToken(SLQParserEQ, 0)
}
func (s *CmprContext) NEQ() antlr.TerminalNode {
return s.GetToken(SLQParserNEQ, 0)
}
func (s *CmprContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *CmprContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *CmprContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterCmpr(s)
}
}
func (s *CmprContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitCmpr(s)
}
}
func (s *CmprContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitCmpr(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Cmpr() (localctx ICmprContext) {
this := p
_ = this
localctx = NewCmprContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 8, SLQParserRULE_cmpr)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(103)
_la = p.GetTokenStream().LA(1)
if !((int64(_la) & ^0x3f) == 0 && ((int64(1)<<_la)&1082331758592) != 0) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
return localctx
}
// IFuncElementContext is an interface to support dynamic dispatch.
type IFuncElementContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
Func_() IFuncContext
Alias() IAliasContext
// IsFuncElementContext differentiates from other interfaces.
IsFuncElementContext()
}
type FuncElementContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyFuncElementContext() *FuncElementContext {
var p = new(FuncElementContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_funcElement
return p
}
func (*FuncElementContext) IsFuncElementContext() {}
func NewFuncElementContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *FuncElementContext {
var p = new(FuncElementContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_funcElement
return p
}
func (s *FuncElementContext) GetParser() antlr.Parser { return s.parser }
func (s *FuncElementContext) Func_() IFuncContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IFuncContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IFuncContext)
}
func (s *FuncElementContext) Alias() IAliasContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IAliasContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IAliasContext)
}
func (s *FuncElementContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *FuncElementContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *FuncElementContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterFuncElement(s)
}
}
func (s *FuncElementContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitFuncElement(s)
}
}
func (s *FuncElementContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitFuncElement(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) FuncElement() (localctx IFuncElementContext) {
this := p
_ = this
localctx = NewFuncElementContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 10, SLQParserRULE_funcElement)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(105)
p.Func_()
}
p.SetState(107)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
if _la == SLQParserALIAS_RESERVED || _la == SLQParserCOLON {
{
p.SetState(106)
p.Alias()
}
}
return localctx
}
// IFuncContext is an interface to support dynamic dispatch.
type IFuncContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
FuncName() IFuncNameContext
LPAR() antlr.TerminalNode
RPAR() antlr.TerminalNode
AllExpr() []IExprContext
Expr(i int) IExprContext
AllCOMMA() []antlr.TerminalNode
COMMA(i int) antlr.TerminalNode
// IsFuncContext differentiates from other interfaces.
IsFuncContext()
}
type FuncContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyFuncContext() *FuncContext {
var p = new(FuncContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_func
return p
}
func (*FuncContext) IsFuncContext() {}
func NewFuncContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *FuncContext {
var p = new(FuncContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_func
return p
}
func (s *FuncContext) GetParser() antlr.Parser { return s.parser }
func (s *FuncContext) FuncName() IFuncNameContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IFuncNameContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IFuncNameContext)
}
func (s *FuncContext) LPAR() antlr.TerminalNode {
return s.GetToken(SLQParserLPAR, 0)
}
func (s *FuncContext) RPAR() antlr.TerminalNode {
return s.GetToken(SLQParserRPAR, 0)
}
func (s *FuncContext) AllExpr() []IExprContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(IExprContext); ok {
len++
}
}
tst := make([]IExprContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(IExprContext); ok {
tst[i] = t.(IExprContext)
i++
}
}
return tst
}
func (s *FuncContext) Expr(i int) IExprContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IExprContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(IExprContext)
}
func (s *FuncContext) AllCOMMA() []antlr.TerminalNode {
return s.GetTokens(SLQParserCOMMA)
}
func (s *FuncContext) COMMA(i int) antlr.TerminalNode {
return s.GetToken(SLQParserCOMMA, i)
}
func (s *FuncContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *FuncContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *FuncContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterFunc(s)
}
}
func (s *FuncContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitFunc(s)
}
}
func (s *FuncContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitFunc(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Func_() (localctx IFuncContext) {
this := p
_ = this
localctx = NewFuncContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 12, SLQParserRULE_func)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(109)
p.FuncName()
}
{
p.SetState(110)
p.Match(SLQParserLPAR)
}
p.SetState(120)
p.GetErrorHandler().Sync(p)
switch p.GetTokenStream().LA(1) {
case SLQParserT__13, SLQParserT__14, SLQParserORDER_ASC, SLQParserORDER_DESC, SLQParserID, SLQParserNULL, SLQParserNN, SLQParserNUMBER, SLQParserNAME, SLQParserSTRING:
{
p.SetState(111)
p.expr(0)
}
p.SetState(116)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserCOMMA {
{
p.SetState(112)
p.Match(SLQParserCOMMA)
}
{
p.SetState(113)
p.expr(0)
}
p.SetState(118)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
case SLQParserT__1:
{
p.SetState(119)
p.Match(SLQParserT__1)
}
case SLQParserRPAR:
default:
}
{
p.SetState(122)
p.Match(SLQParserRPAR)
}
return localctx
}
// IFuncNameContext is an interface to support dynamic dispatch.
type IFuncNameContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
ID() antlr.TerminalNode
// IsFuncNameContext differentiates from other interfaces.
IsFuncNameContext()
}
type FuncNameContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyFuncNameContext() *FuncNameContext {
var p = new(FuncNameContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_funcName
return p
}
func (*FuncNameContext) IsFuncNameContext() {}
func NewFuncNameContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *FuncNameContext {
var p = new(FuncNameContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_funcName
return p
}
func (s *FuncNameContext) GetParser() antlr.Parser { return s.parser }
func (s *FuncNameContext) ID() antlr.TerminalNode {
return s.GetToken(SLQParserID, 0)
}
func (s *FuncNameContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *FuncNameContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *FuncNameContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterFuncName(s)
}
}
func (s *FuncNameContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitFuncName(s)
}
}
func (s *FuncNameContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitFuncName(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) FuncName() (localctx IFuncNameContext) {
this := p
_ = this
localctx = NewFuncNameContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 14, SLQParserRULE_funcName)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(124)
p.Match(SLQParserID)
}
return localctx
}
// IJoinContext is an interface to support dynamic dispatch.
type IJoinContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
LPAR() antlr.TerminalNode
JoinConstraint() IJoinConstraintContext
RPAR() antlr.TerminalNode
// IsJoinContext differentiates from other interfaces.
IsJoinContext()
}
type JoinContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyJoinContext() *JoinContext {
var p = new(JoinContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_join
return p
}
func (*JoinContext) IsJoinContext() {}
func NewJoinContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *JoinContext {
var p = new(JoinContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_join
return p
}
func (s *JoinContext) GetParser() antlr.Parser { return s.parser }
func (s *JoinContext) LPAR() antlr.TerminalNode {
return s.GetToken(SLQParserLPAR, 0)
}
func (s *JoinContext) JoinConstraint() IJoinConstraintContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IJoinConstraintContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IJoinConstraintContext)
}
func (s *JoinContext) RPAR() antlr.TerminalNode {
return s.GetToken(SLQParserRPAR, 0)
}
func (s *JoinContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *JoinContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *JoinContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterJoin(s)
}
}
func (s *JoinContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitJoin(s)
}
}
func (s *JoinContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitJoin(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Join() (localctx IJoinContext) {
this := p
_ = this
localctx = NewJoinContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 16, SLQParserRULE_join)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(126)
p.Match(SLQParserT__2)
}
{
p.SetState(127)
p.Match(SLQParserLPAR)
}
{
p.SetState(128)
p.JoinConstraint()
}
{
p.SetState(129)
p.Match(SLQParserRPAR)
}
return localctx
}
// IJoinConstraintContext is an interface to support dynamic dispatch.
type IJoinConstraintContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
AllSelector() []ISelectorContext
Selector(i int) ISelectorContext
Cmpr() ICmprContext
// IsJoinConstraintContext differentiates from other interfaces.
IsJoinConstraintContext()
}
type JoinConstraintContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyJoinConstraintContext() *JoinConstraintContext {
var p = new(JoinConstraintContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_joinConstraint
return p
}
func (*JoinConstraintContext) IsJoinConstraintContext() {}
func NewJoinConstraintContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *JoinConstraintContext {
var p = new(JoinConstraintContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_joinConstraint
return p
}
func (s *JoinConstraintContext) GetParser() antlr.Parser { return s.parser }
func (s *JoinConstraintContext) AllSelector() []ISelectorContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(ISelectorContext); ok {
len++
}
}
tst := make([]ISelectorContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(ISelectorContext); ok {
tst[i] = t.(ISelectorContext)
i++
}
}
return tst
}
func (s *JoinConstraintContext) Selector(i int) ISelectorContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(ISelectorContext)
}
func (s *JoinConstraintContext) Cmpr() ICmprContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ICmprContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ICmprContext)
}
func (s *JoinConstraintContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *JoinConstraintContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *JoinConstraintContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterJoinConstraint(s)
}
}
func (s *JoinConstraintContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitJoinConstraint(s)
}
}
func (s *JoinConstraintContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitJoinConstraint(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) JoinConstraint() (localctx IJoinConstraintContext) {
this := p
_ = this
localctx = NewJoinConstraintContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 18, SLQParserRULE_joinConstraint)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.SetState(136)
p.GetErrorHandler().Sync(p)
switch p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 10, p.GetParserRuleContext()) {
case 1:
p.EnterOuterAlt(localctx, 1)
{
p.SetState(131)
p.Selector()
}
{
p.SetState(132)
p.Cmpr()
}
{
p.SetState(133)
p.Selector()
}
case 2:
p.EnterOuterAlt(localctx, 2)
{
p.SetState(135)
p.Selector()
}
}
return localctx
}
// IUniqueFuncContext is an interface to support dynamic dispatch.
type IUniqueFuncContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// IsUniqueFuncContext differentiates from other interfaces.
IsUniqueFuncContext()
}
type UniqueFuncContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyUniqueFuncContext() *UniqueFuncContext {
var p = new(UniqueFuncContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_uniqueFunc
return p
}
func (*UniqueFuncContext) IsUniqueFuncContext() {}
func NewUniqueFuncContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *UniqueFuncContext {
var p = new(UniqueFuncContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_uniqueFunc
return p
}
func (s *UniqueFuncContext) GetParser() antlr.Parser { return s.parser }
func (s *UniqueFuncContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *UniqueFuncContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *UniqueFuncContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterUniqueFunc(s)
}
}
func (s *UniqueFuncContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitUniqueFunc(s)
}
}
func (s *UniqueFuncContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitUniqueFunc(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) UniqueFunc() (localctx IUniqueFuncContext) {
this := p
_ = this
localctx = NewUniqueFuncContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 20, SLQParserRULE_uniqueFunc)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(138)
p.Match(SLQParserT__3)
}
return localctx
}
// ICountFuncContext is an interface to support dynamic dispatch.
type ICountFuncContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
LPAR() antlr.TerminalNode
RPAR() antlr.TerminalNode
Alias() IAliasContext
Selector() ISelectorContext
// IsCountFuncContext differentiates from other interfaces.
IsCountFuncContext()
}
type CountFuncContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyCountFuncContext() *CountFuncContext {
var p = new(CountFuncContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_countFunc
return p
}
func (*CountFuncContext) IsCountFuncContext() {}
func NewCountFuncContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *CountFuncContext {
var p = new(CountFuncContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_countFunc
return p
}
func (s *CountFuncContext) GetParser() antlr.Parser { return s.parser }
func (s *CountFuncContext) LPAR() antlr.TerminalNode {
return s.GetToken(SLQParserLPAR, 0)
}
func (s *CountFuncContext) RPAR() antlr.TerminalNode {
return s.GetToken(SLQParserRPAR, 0)
}
func (s *CountFuncContext) Alias() IAliasContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IAliasContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IAliasContext)
}
func (s *CountFuncContext) Selector() ISelectorContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ISelectorContext)
}
func (s *CountFuncContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *CountFuncContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *CountFuncContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterCountFunc(s)
}
}
func (s *CountFuncContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitCountFunc(s)
}
}
func (s *CountFuncContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitCountFunc(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) CountFunc() (localctx ICountFuncContext) {
this := p
_ = this
localctx = NewCountFuncContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 22, SLQParserRULE_countFunc)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(140)
p.Match(SLQParserT__4)
}
p.SetState(146)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
if _la == SLQParserLPAR {
{
p.SetState(141)
p.Match(SLQParserLPAR)
}
p.SetState(143)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
if _la == SLQParserNAME {
{
p.SetState(142)
p.Selector()
}
}
{
p.SetState(145)
p.Match(SLQParserRPAR)
}
}
p.SetState(149)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
if _la == SLQParserALIAS_RESERVED || _la == SLQParserCOLON {
{
p.SetState(148)
p.Alias()
}
}
return localctx
}
// IGroupByTermContext is an interface to support dynamic dispatch.
type IGroupByTermContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
Selector() ISelectorContext
Func_() IFuncContext
// IsGroupByTermContext differentiates from other interfaces.
IsGroupByTermContext()
}
type GroupByTermContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyGroupByTermContext() *GroupByTermContext {
var p = new(GroupByTermContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_groupByTerm
return p
}
func (*GroupByTermContext) IsGroupByTermContext() {}
func NewGroupByTermContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *GroupByTermContext {
var p = new(GroupByTermContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_groupByTerm
return p
}
func (s *GroupByTermContext) GetParser() antlr.Parser { return s.parser }
func (s *GroupByTermContext) Selector() ISelectorContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ISelectorContext)
}
func (s *GroupByTermContext) Func_() IFuncContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IFuncContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IFuncContext)
}
func (s *GroupByTermContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *GroupByTermContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *GroupByTermContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterGroupByTerm(s)
}
}
func (s *GroupByTermContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitGroupByTerm(s)
}
}
func (s *GroupByTermContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitGroupByTerm(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) GroupByTerm() (localctx IGroupByTermContext) {
this := p
_ = this
localctx = NewGroupByTermContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 24, SLQParserRULE_groupByTerm)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.SetState(153)
p.GetErrorHandler().Sync(p)
switch p.GetTokenStream().LA(1) {
case SLQParserNAME:
p.EnterOuterAlt(localctx, 1)
{
p.SetState(151)
p.Selector()
}
case SLQParserID:
p.EnterOuterAlt(localctx, 2)
{
p.SetState(152)
p.Func_()
}
default:
panic(antlr.NewNoViableAltException(p, nil, nil, nil, nil, nil))
}
return localctx
}
// IGroupByContext is an interface to support dynamic dispatch.
type IGroupByContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
GROUP_BY() antlr.TerminalNode
LPAR() antlr.TerminalNode
AllGroupByTerm() []IGroupByTermContext
GroupByTerm(i int) IGroupByTermContext
RPAR() antlr.TerminalNode
AllCOMMA() []antlr.TerminalNode
COMMA(i int) antlr.TerminalNode
// IsGroupByContext differentiates from other interfaces.
IsGroupByContext()
}
type GroupByContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyGroupByContext() *GroupByContext {
var p = new(GroupByContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_groupBy
return p
}
func (*GroupByContext) IsGroupByContext() {}
func NewGroupByContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *GroupByContext {
var p = new(GroupByContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_groupBy
return p
}
func (s *GroupByContext) GetParser() antlr.Parser { return s.parser }
func (s *GroupByContext) GROUP_BY() antlr.TerminalNode {
return s.GetToken(SLQParserGROUP_BY, 0)
}
func (s *GroupByContext) LPAR() antlr.TerminalNode {
return s.GetToken(SLQParserLPAR, 0)
}
func (s *GroupByContext) AllGroupByTerm() []IGroupByTermContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(IGroupByTermContext); ok {
len++
}
}
tst := make([]IGroupByTermContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(IGroupByTermContext); ok {
tst[i] = t.(IGroupByTermContext)
i++
}
}
return tst
}
func (s *GroupByContext) GroupByTerm(i int) IGroupByTermContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IGroupByTermContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(IGroupByTermContext)
}
func (s *GroupByContext) RPAR() antlr.TerminalNode {
return s.GetToken(SLQParserRPAR, 0)
}
func (s *GroupByContext) AllCOMMA() []antlr.TerminalNode {
return s.GetTokens(SLQParserCOMMA)
}
func (s *GroupByContext) COMMA(i int) antlr.TerminalNode {
return s.GetToken(SLQParserCOMMA, i)
}
func (s *GroupByContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *GroupByContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *GroupByContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterGroupBy(s)
}
}
func (s *GroupByContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitGroupBy(s)
}
}
func (s *GroupByContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitGroupBy(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) GroupBy() (localctx IGroupByContext) {
this := p
_ = this
localctx = NewGroupByContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 26, SLQParserRULE_groupBy)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(155)
p.Match(SLQParserGROUP_BY)
}
{
p.SetState(156)
p.Match(SLQParserLPAR)
}
{
p.SetState(157)
p.GroupByTerm()
}
p.SetState(162)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserCOMMA {
{
p.SetState(158)
p.Match(SLQParserCOMMA)
}
{
p.SetState(159)
p.GroupByTerm()
}
p.SetState(164)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
{
p.SetState(165)
p.Match(SLQParserRPAR)
}
return localctx
}
// IOrderByTermContext is an interface to support dynamic dispatch.
type IOrderByTermContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
Selector() ISelectorContext
ORDER_ASC() antlr.TerminalNode
ORDER_DESC() antlr.TerminalNode
// IsOrderByTermContext differentiates from other interfaces.
IsOrderByTermContext()
}
type OrderByTermContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyOrderByTermContext() *OrderByTermContext {
var p = new(OrderByTermContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_orderByTerm
return p
}
func (*OrderByTermContext) IsOrderByTermContext() {}
func NewOrderByTermContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *OrderByTermContext {
var p = new(OrderByTermContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_orderByTerm
return p
}
func (s *OrderByTermContext) GetParser() antlr.Parser { return s.parser }
func (s *OrderByTermContext) Selector() ISelectorContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ISelectorContext)
}
func (s *OrderByTermContext) ORDER_ASC() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_ASC, 0)
}
func (s *OrderByTermContext) ORDER_DESC() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_DESC, 0)
}
func (s *OrderByTermContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *OrderByTermContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *OrderByTermContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterOrderByTerm(s)
}
}
func (s *OrderByTermContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitOrderByTerm(s)
}
}
func (s *OrderByTermContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitOrderByTerm(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) OrderByTerm() (localctx IOrderByTermContext) {
this := p
_ = this
localctx = NewOrderByTermContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 28, SLQParserRULE_orderByTerm)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(167)
p.Selector()
}
p.SetState(169)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
if _la == SLQParserORDER_ASC || _la == SLQParserORDER_DESC {
{
p.SetState(168)
_la = p.GetTokenStream().LA(1)
if !(_la == SLQParserORDER_ASC || _la == SLQParserORDER_DESC) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
}
return localctx
}
// IOrderByContext is an interface to support dynamic dispatch.
type IOrderByContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
ORDER_BY() antlr.TerminalNode
LPAR() antlr.TerminalNode
AllOrderByTerm() []IOrderByTermContext
OrderByTerm(i int) IOrderByTermContext
RPAR() antlr.TerminalNode
AllCOMMA() []antlr.TerminalNode
COMMA(i int) antlr.TerminalNode
// IsOrderByContext differentiates from other interfaces.
IsOrderByContext()
}
type OrderByContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyOrderByContext() *OrderByContext {
var p = new(OrderByContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_orderBy
return p
}
func (*OrderByContext) IsOrderByContext() {}
func NewOrderByContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *OrderByContext {
var p = new(OrderByContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_orderBy
return p
}
func (s *OrderByContext) GetParser() antlr.Parser { return s.parser }
func (s *OrderByContext) ORDER_BY() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_BY, 0)
}
func (s *OrderByContext) LPAR() antlr.TerminalNode {
return s.GetToken(SLQParserLPAR, 0)
}
func (s *OrderByContext) AllOrderByTerm() []IOrderByTermContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(IOrderByTermContext); ok {
len++
}
}
tst := make([]IOrderByTermContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(IOrderByTermContext); ok {
tst[i] = t.(IOrderByTermContext)
i++
}
}
return tst
}
func (s *OrderByContext) OrderByTerm(i int) IOrderByTermContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IOrderByTermContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(IOrderByTermContext)
}
func (s *OrderByContext) RPAR() antlr.TerminalNode {
return s.GetToken(SLQParserRPAR, 0)
}
func (s *OrderByContext) AllCOMMA() []antlr.TerminalNode {
return s.GetTokens(SLQParserCOMMA)
}
func (s *OrderByContext) COMMA(i int) antlr.TerminalNode {
return s.GetToken(SLQParserCOMMA, i)
}
func (s *OrderByContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *OrderByContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *OrderByContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterOrderBy(s)
}
}
func (s *OrderByContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitOrderBy(s)
}
}
func (s *OrderByContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitOrderBy(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) OrderBy() (localctx IOrderByContext) {
this := p
_ = this
localctx = NewOrderByContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 30, SLQParserRULE_orderBy)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(171)
p.Match(SLQParserORDER_BY)
}
{
p.SetState(172)
p.Match(SLQParserLPAR)
}
{
p.SetState(173)
p.OrderByTerm()
}
p.SetState(178)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
for _la == SLQParserCOMMA {
{
p.SetState(174)
p.Match(SLQParserCOMMA)
}
{
p.SetState(175)
p.OrderByTerm()
}
p.SetState(180)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
}
{
p.SetState(181)
p.Match(SLQParserRPAR)
}
return localctx
}
// ISelectorContext is an interface to support dynamic dispatch.
type ISelectorContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
AllNAME() []antlr.TerminalNode
NAME(i int) antlr.TerminalNode
// IsSelectorContext differentiates from other interfaces.
IsSelectorContext()
}
type SelectorContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptySelectorContext() *SelectorContext {
var p = new(SelectorContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_selector
return p
}
func (*SelectorContext) IsSelectorContext() {}
func NewSelectorContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *SelectorContext {
var p = new(SelectorContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_selector
return p
}
func (s *SelectorContext) GetParser() antlr.Parser { return s.parser }
func (s *SelectorContext) AllNAME() []antlr.TerminalNode {
return s.GetTokens(SLQParserNAME)
}
func (s *SelectorContext) NAME(i int) antlr.TerminalNode {
return s.GetToken(SLQParserNAME, i)
}
func (s *SelectorContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *SelectorContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *SelectorContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterSelector(s)
}
}
func (s *SelectorContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitSelector(s)
}
}
func (s *SelectorContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitSelector(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Selector() (localctx ISelectorContext) {
this := p
_ = this
localctx = NewSelectorContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 32, SLQParserRULE_selector)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(183)
p.Match(SLQParserNAME)
}
p.SetState(185)
p.GetErrorHandler().Sync(p)
if p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 18, p.GetParserRuleContext()) == 1 {
{
p.SetState(184)
p.Match(SLQParserNAME)
}
}
return localctx
}
// ISelectorElementContext is an interface to support dynamic dispatch.
type ISelectorElementContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
Selector() ISelectorContext
Alias() IAliasContext
// IsSelectorElementContext differentiates from other interfaces.
IsSelectorElementContext()
}
type SelectorElementContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptySelectorElementContext() *SelectorElementContext {
var p = new(SelectorElementContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_selectorElement
return p
}
func (*SelectorElementContext) IsSelectorElementContext() {}
func NewSelectorElementContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *SelectorElementContext {
var p = new(SelectorElementContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_selectorElement
return p
}
func (s *SelectorElementContext) GetParser() antlr.Parser { return s.parser }
func (s *SelectorElementContext) Selector() ISelectorContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ISelectorContext)
}
func (s *SelectorElementContext) Alias() IAliasContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IAliasContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IAliasContext)
}
func (s *SelectorElementContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *SelectorElementContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *SelectorElementContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterSelectorElement(s)
}
}
func (s *SelectorElementContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitSelectorElement(s)
}
}
func (s *SelectorElementContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitSelectorElement(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) SelectorElement() (localctx ISelectorElementContext) {
this := p
_ = this
localctx = NewSelectorElementContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 34, SLQParserRULE_selectorElement)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(187)
p.Selector()
}
p.SetState(189)
p.GetErrorHandler().Sync(p)
_la = p.GetTokenStream().LA(1)
if _la == SLQParserALIAS_RESERVED || _la == SLQParserCOLON {
{
p.SetState(188)
p.Alias()
}
}
return localctx
}
// IAliasContext is an interface to support dynamic dispatch.
type IAliasContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
ALIAS_RESERVED() antlr.TerminalNode
COLON() antlr.TerminalNode
ARG() antlr.TerminalNode
ID() antlr.TerminalNode
// IsAliasContext differentiates from other interfaces.
IsAliasContext()
}
type AliasContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyAliasContext() *AliasContext {
var p = new(AliasContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_alias
return p
}
func (*AliasContext) IsAliasContext() {}
func NewAliasContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *AliasContext {
var p = new(AliasContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_alias
return p
}
func (s *AliasContext) GetParser() antlr.Parser { return s.parser }
func (s *AliasContext) ALIAS_RESERVED() antlr.TerminalNode {
return s.GetToken(SLQParserALIAS_RESERVED, 0)
}
func (s *AliasContext) COLON() antlr.TerminalNode {
return s.GetToken(SLQParserCOLON, 0)
}
func (s *AliasContext) ARG() antlr.TerminalNode {
return s.GetToken(SLQParserARG, 0)
}
func (s *AliasContext) ID() antlr.TerminalNode {
return s.GetToken(SLQParserID, 0)
}
func (s *AliasContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *AliasContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *AliasContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterAlias(s)
}
}
func (s *AliasContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitAlias(s)
}
}
func (s *AliasContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitAlias(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Alias() (localctx IAliasContext) {
this := p
_ = this
localctx = NewAliasContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 36, SLQParserRULE_alias)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.SetState(194)
p.GetErrorHandler().Sync(p)
switch p.GetTokenStream().LA(1) {
case SLQParserALIAS_RESERVED:
p.EnterOuterAlt(localctx, 1)
{
p.SetState(191)
p.Match(SLQParserALIAS_RESERVED)
}
case SLQParserCOLON:
p.EnterOuterAlt(localctx, 2)
{
p.SetState(192)
p.Match(SLQParserCOLON)
}
{
p.SetState(193)
_la = p.GetTokenStream().LA(1)
if !(_la == SLQParserARG || _la == SLQParserID) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
default:
panic(antlr.NewNoViableAltException(p, nil, nil, nil, nil, nil))
}
return localctx
}
// IHandleTableContext is an interface to support dynamic dispatch.
type IHandleTableContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
HANDLE() antlr.TerminalNode
NAME() antlr.TerminalNode
// IsHandleTableContext differentiates from other interfaces.
IsHandleTableContext()
}
type HandleTableContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyHandleTableContext() *HandleTableContext {
var p = new(HandleTableContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_handleTable
return p
}
func (*HandleTableContext) IsHandleTableContext() {}
func NewHandleTableContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *HandleTableContext {
var p = new(HandleTableContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_handleTable
return p
}
func (s *HandleTableContext) GetParser() antlr.Parser { return s.parser }
func (s *HandleTableContext) HANDLE() antlr.TerminalNode {
return s.GetToken(SLQParserHANDLE, 0)
}
func (s *HandleTableContext) NAME() antlr.TerminalNode {
return s.GetToken(SLQParserNAME, 0)
}
func (s *HandleTableContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *HandleTableContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *HandleTableContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterHandleTable(s)
}
}
func (s *HandleTableContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitHandleTable(s)
}
}
func (s *HandleTableContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitHandleTable(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) HandleTable() (localctx IHandleTableContext) {
this := p
_ = this
localctx = NewHandleTableContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 38, SLQParserRULE_handleTable)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(196)
p.Match(SLQParserHANDLE)
}
{
p.SetState(197)
p.Match(SLQParserNAME)
}
return localctx
}
// IHandleContext is an interface to support dynamic dispatch.
type IHandleContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
HANDLE() antlr.TerminalNode
// IsHandleContext differentiates from other interfaces.
IsHandleContext()
}
type HandleContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyHandleContext() *HandleContext {
var p = new(HandleContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_handle
return p
}
func (*HandleContext) IsHandleContext() {}
func NewHandleContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *HandleContext {
var p = new(HandleContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_handle
return p
}
func (s *HandleContext) GetParser() antlr.Parser { return s.parser }
func (s *HandleContext) HANDLE() antlr.TerminalNode {
return s.GetToken(SLQParserHANDLE, 0)
}
func (s *HandleContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *HandleContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *HandleContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterHandle(s)
}
}
func (s *HandleContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitHandle(s)
}
}
func (s *HandleContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitHandle(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Handle() (localctx IHandleContext) {
this := p
_ = this
localctx = NewHandleContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 40, SLQParserRULE_handle)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(199)
p.Match(SLQParserHANDLE)
}
return localctx
}
// IRowRangeContext is an interface to support dynamic dispatch.
type IRowRangeContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
RBRA() antlr.TerminalNode
AllNN() []antlr.TerminalNode
NN(i int) antlr.TerminalNode
COLON() antlr.TerminalNode
// IsRowRangeContext differentiates from other interfaces.
IsRowRangeContext()
}
type RowRangeContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyRowRangeContext() *RowRangeContext {
var p = new(RowRangeContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_rowRange
return p
}
func (*RowRangeContext) IsRowRangeContext() {}
func NewRowRangeContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *RowRangeContext {
var p = new(RowRangeContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_rowRange
return p
}
func (s *RowRangeContext) GetParser() antlr.Parser { return s.parser }
func (s *RowRangeContext) RBRA() antlr.TerminalNode {
return s.GetToken(SLQParserRBRA, 0)
}
func (s *RowRangeContext) AllNN() []antlr.TerminalNode {
return s.GetTokens(SLQParserNN)
}
func (s *RowRangeContext) NN(i int) antlr.TerminalNode {
return s.GetToken(SLQParserNN, i)
}
func (s *RowRangeContext) COLON() antlr.TerminalNode {
return s.GetToken(SLQParserCOLON, 0)
}
func (s *RowRangeContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *RowRangeContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *RowRangeContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterRowRange(s)
}
}
func (s *RowRangeContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitRowRange(s)
}
}
func (s *RowRangeContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitRowRange(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) RowRange() (localctx IRowRangeContext) {
this := p
_ = this
localctx = NewRowRangeContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 42, SLQParserRULE_rowRange)
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(201)
p.Match(SLQParserT__5)
}
p.SetState(210)
p.GetErrorHandler().Sync(p)
if p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 21, p.GetParserRuleContext()) == 1 {
{
p.SetState(202)
p.Match(SLQParserNN)
}
{
p.SetState(203)
p.Match(SLQParserCOLON)
}
{
p.SetState(204)
p.Match(SLQParserNN)
}
} else if p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 21, p.GetParserRuleContext()) == 2 {
{
p.SetState(205)
p.Match(SLQParserNN)
}
{
p.SetState(206)
p.Match(SLQParserCOLON)
}
} else if p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 21, p.GetParserRuleContext()) == 3 {
{
p.SetState(207)
p.Match(SLQParserCOLON)
}
{
p.SetState(208)
p.Match(SLQParserNN)
}
} else if p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 21, p.GetParserRuleContext()) == 4 {
{
p.SetState(209)
p.Match(SLQParserNN)
}
}
{
p.SetState(212)
p.Match(SLQParserRBRA)
}
return localctx
}
// IExprContext is an interface to support dynamic dispatch.
type IExprContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
Selector() ISelectorContext
Literal() ILiteralContext
UnaryOperator() IUnaryOperatorContext
AllExpr() []IExprContext
Expr(i int) IExprContext
Func_() IFuncContext
ORDER_ASC() antlr.TerminalNode
ORDER_DESC() antlr.TerminalNode
LT() antlr.TerminalNode
LT_EQ() antlr.TerminalNode
GT() antlr.TerminalNode
GT_EQ() antlr.TerminalNode
EQ() antlr.TerminalNode
NEQ() antlr.TerminalNode
// IsExprContext differentiates from other interfaces.
IsExprContext()
}
type ExprContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyExprContext() *ExprContext {
var p = new(ExprContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_expr
return p
}
func (*ExprContext) IsExprContext() {}
func NewExprContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *ExprContext {
var p = new(ExprContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_expr
return p
}
func (s *ExprContext) GetParser() antlr.Parser { return s.parser }
func (s *ExprContext) Selector() ISelectorContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ISelectorContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ISelectorContext)
}
func (s *ExprContext) Literal() ILiteralContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(ILiteralContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(ILiteralContext)
}
func (s *ExprContext) UnaryOperator() IUnaryOperatorContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IUnaryOperatorContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IUnaryOperatorContext)
}
func (s *ExprContext) AllExpr() []IExprContext {
children := s.GetChildren()
len := 0
for _, ctx := range children {
if _, ok := ctx.(IExprContext); ok {
len++
}
}
tst := make([]IExprContext, len)
i := 0
for _, ctx := range children {
if t, ok := ctx.(IExprContext); ok {
tst[i] = t.(IExprContext)
i++
}
}
return tst
}
func (s *ExprContext) Expr(i int) IExprContext {
var t antlr.RuleContext
j := 0
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IExprContext); ok {
if j == i {
t = ctx.(antlr.RuleContext)
break
}
j++
}
}
if t == nil {
return nil
}
return t.(IExprContext)
}
func (s *ExprContext) Func_() IFuncContext {
var t antlr.RuleContext
for _, ctx := range s.GetChildren() {
if _, ok := ctx.(IFuncContext); ok {
t = ctx.(antlr.RuleContext)
break
}
}
if t == nil {
return nil
}
return t.(IFuncContext)
}
func (s *ExprContext) ORDER_ASC() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_ASC, 0)
}
func (s *ExprContext) ORDER_DESC() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_DESC, 0)
}
func (s *ExprContext) LT() antlr.TerminalNode {
return s.GetToken(SLQParserLT, 0)
}
func (s *ExprContext) LT_EQ() antlr.TerminalNode {
return s.GetToken(SLQParserLT_EQ, 0)
}
func (s *ExprContext) GT() antlr.TerminalNode {
return s.GetToken(SLQParserGT, 0)
}
func (s *ExprContext) GT_EQ() antlr.TerminalNode {
return s.GetToken(SLQParserGT_EQ, 0)
}
func (s *ExprContext) EQ() antlr.TerminalNode {
return s.GetToken(SLQParserEQ, 0)
}
func (s *ExprContext) NEQ() antlr.TerminalNode {
return s.GetToken(SLQParserNEQ, 0)
}
func (s *ExprContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *ExprContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *ExprContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterExpr(s)
}
}
func (s *ExprContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitExpr(s)
}
}
func (s *ExprContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitExpr(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Expr() (localctx IExprContext) {
return p.expr(0)
}
func (p *SLQParser) expr(_p int) (localctx IExprContext) {
this := p
_ = this
var _parentctx antlr.ParserRuleContext = p.GetParserRuleContext()
_parentState := p.GetState()
localctx = NewExprContext(p, p.GetParserRuleContext(), _parentState)
var _prevctx IExprContext = localctx
var _ antlr.ParserRuleContext = _prevctx // TODO: To prevent unused variable warning.
_startState := 44
p.EnterRecursionRule(localctx, 44, SLQParserRULE_expr, _p)
var _la int
defer func() {
p.UnrollRecursionContexts(_parentctx)
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
var _alt int
p.EnterOuterAlt(localctx, 1)
p.SetState(221)
p.GetErrorHandler().Sync(p)
switch p.GetTokenStream().LA(1) {
case SLQParserNAME:
{
p.SetState(215)
p.Selector()
}
case SLQParserNULL, SLQParserNN, SLQParserNUMBER, SLQParserSTRING:
{
p.SetState(216)
p.Literal()
}
case SLQParserT__13, SLQParserT__14, SLQParserORDER_ASC, SLQParserORDER_DESC:
{
p.SetState(217)
p.UnaryOperator()
}
{
p.SetState(218)
p.expr(9)
}
case SLQParserID:
{
p.SetState(220)
p.Func_()
}
default:
panic(antlr.NewNoViableAltException(p, nil, nil, nil, nil, nil))
}
p.GetParserRuleContext().SetStop(p.GetTokenStream().LT(-1))
p.SetState(250)
p.GetErrorHandler().Sync(p)
_alt = p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 25, p.GetParserRuleContext())
for _alt != 2 && _alt != antlr.ATNInvalidAltNumber {
if _alt == 1 {
if p.GetParseListeners() != nil {
p.TriggerExitRuleEvent()
}
_prevctx = localctx
p.SetState(248)
p.GetErrorHandler().Sync(p)
switch p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 24, p.GetParserRuleContext()) {
case 1:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(223)
if !(p.Precpred(p.GetParserRuleContext(), 8)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 8)", ""))
}
{
p.SetState(224)
p.Match(SLQParserT__6)
}
{
p.SetState(225)
p.expr(9)
}
case 2:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(226)
if !(p.Precpred(p.GetParserRuleContext(), 7)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 7)", ""))
}
{
p.SetState(227)
_la = p.GetTokenStream().LA(1)
if !((int64(_la) & ^0x3f) == 0 && ((int64(1)<<_la)&772) != 0) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
{
p.SetState(228)
p.expr(8)
}
case 3:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(229)
if !(p.Precpred(p.GetParserRuleContext(), 6)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 6)", ""))
}
{
p.SetState(230)
_la = p.GetTokenStream().LA(1)
if !(_la == SLQParserORDER_ASC || _la == SLQParserORDER_DESC) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
{
p.SetState(231)
p.expr(7)
}
case 4:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(232)
if !(p.Precpred(p.GetParserRuleContext(), 5)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 5)", ""))
}
{
p.SetState(233)
_la = p.GetTokenStream().LA(1)
if !((int64(_la) & ^0x3f) == 0 && ((int64(1)<<_la)&7168) != 0) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
{
p.SetState(234)
p.expr(6)
}
case 5:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(235)
if !(p.Precpred(p.GetParserRuleContext(), 4)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 4)", ""))
}
{
p.SetState(236)
_la = p.GetTokenStream().LA(1)
if !((int64(_la) & ^0x3f) == 0 && ((int64(1)<<_la)&257698037760) != 0) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
{
p.SetState(237)
p.expr(5)
}
case 6:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(238)
if !(p.Precpred(p.GetParserRuleContext(), 3)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 3)", ""))
}
p.SetState(242)
p.GetErrorHandler().Sync(p)
switch p.GetTokenStream().LA(1) {
case SLQParserEQ:
{
p.SetState(239)
p.Match(SLQParserEQ)
}
case SLQParserNEQ:
{
p.SetState(240)
p.Match(SLQParserNEQ)
}
case SLQParserT__13, SLQParserT__14, SLQParserORDER_ASC, SLQParserORDER_DESC, SLQParserID, SLQParserNULL, SLQParserNN, SLQParserNUMBER, SLQParserNAME, SLQParserSTRING:
default:
panic(antlr.NewNoViableAltException(p, nil, nil, nil, nil, nil))
}
{
p.SetState(244)
p.expr(4)
}
case 7:
localctx = NewExprContext(p, _parentctx, _parentState)
p.PushNewRecursionContext(localctx, _startState, SLQParserRULE_expr)
p.SetState(245)
if !(p.Precpred(p.GetParserRuleContext(), 2)) {
panic(antlr.NewFailedPredicateException(p, "p.Precpred(p.GetParserRuleContext(), 2)", ""))
}
{
p.SetState(246)
p.Match(SLQParserT__12)
}
{
p.SetState(247)
p.expr(3)
}
}
}
p.SetState(252)
p.GetErrorHandler().Sync(p)
_alt = p.GetInterpreter().AdaptivePredict(p.GetTokenStream(), 25, p.GetParserRuleContext())
}
return localctx
}
// ILiteralContext is an interface to support dynamic dispatch.
type ILiteralContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
NN() antlr.TerminalNode
NUMBER() antlr.TerminalNode
STRING() antlr.TerminalNode
NULL() antlr.TerminalNode
// IsLiteralContext differentiates from other interfaces.
IsLiteralContext()
}
type LiteralContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyLiteralContext() *LiteralContext {
var p = new(LiteralContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_literal
return p
}
func (*LiteralContext) IsLiteralContext() {}
func NewLiteralContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *LiteralContext {
var p = new(LiteralContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_literal
return p
}
func (s *LiteralContext) GetParser() antlr.Parser { return s.parser }
func (s *LiteralContext) NN() antlr.TerminalNode {
return s.GetToken(SLQParserNN, 0)
}
func (s *LiteralContext) NUMBER() antlr.TerminalNode {
return s.GetToken(SLQParserNUMBER, 0)
}
func (s *LiteralContext) STRING() antlr.TerminalNode {
return s.GetToken(SLQParserSTRING, 0)
}
func (s *LiteralContext) NULL() antlr.TerminalNode {
return s.GetToken(SLQParserNULL, 0)
}
func (s *LiteralContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *LiteralContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *LiteralContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterLiteral(s)
}
}
func (s *LiteralContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitLiteral(s)
}
}
func (s *LiteralContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitLiteral(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) Literal() (localctx ILiteralContext) {
this := p
_ = this
localctx = NewLiteralContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 46, SLQParserRULE_literal)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(253)
_la = p.GetTokenStream().LA(1)
if !((int64(_la) & ^0x3f) == 0 && ((int64(1)<<_la)&4413078896640) != 0) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
return localctx
}
// IUnaryOperatorContext is an interface to support dynamic dispatch.
type IUnaryOperatorContext interface {
antlr.ParserRuleContext
// GetParser returns the parser.
GetParser() antlr.Parser
// Getter signatures
ORDER_DESC() antlr.TerminalNode
ORDER_ASC() antlr.TerminalNode
// IsUnaryOperatorContext differentiates from other interfaces.
IsUnaryOperatorContext()
}
type UnaryOperatorContext struct {
*antlr.BaseParserRuleContext
parser antlr.Parser
}
func NewEmptyUnaryOperatorContext() *UnaryOperatorContext {
var p = new(UnaryOperatorContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(nil, -1)
p.RuleIndex = SLQParserRULE_unaryOperator
return p
}
func (*UnaryOperatorContext) IsUnaryOperatorContext() {}
func NewUnaryOperatorContext(parser antlr.Parser, parent antlr.ParserRuleContext, invokingState int) *UnaryOperatorContext {
var p = new(UnaryOperatorContext)
p.BaseParserRuleContext = antlr.NewBaseParserRuleContext(parent, invokingState)
p.parser = parser
p.RuleIndex = SLQParserRULE_unaryOperator
return p
}
func (s *UnaryOperatorContext) GetParser() antlr.Parser { return s.parser }
func (s *UnaryOperatorContext) ORDER_DESC() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_DESC, 0)
}
func (s *UnaryOperatorContext) ORDER_ASC() antlr.TerminalNode {
return s.GetToken(SLQParserORDER_ASC, 0)
}
func (s *UnaryOperatorContext) GetRuleContext() antlr.RuleContext {
return s
}
func (s *UnaryOperatorContext) ToStringTree(ruleNames []string, recog antlr.Recognizer) string {
return antlr.TreesStringTree(s, ruleNames, recog)
}
func (s *UnaryOperatorContext) EnterRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.EnterUnaryOperator(s)
}
}
func (s *UnaryOperatorContext) ExitRule(listener antlr.ParseTreeListener) {
if listenerT, ok := listener.(SLQListener); ok {
listenerT.ExitUnaryOperator(s)
}
}
func (s *UnaryOperatorContext) Accept(visitor antlr.ParseTreeVisitor) interface{} {
switch t := visitor.(type) {
case SLQVisitor:
return t.VisitUnaryOperator(s)
default:
return t.VisitChildren(s)
}
}
func (p *SLQParser) UnaryOperator() (localctx IUnaryOperatorContext) {
this := p
_ = this
localctx = NewUnaryOperatorContext(p, p.GetParserRuleContext(), p.GetState())
p.EnterRule(localctx, 48, SLQParserRULE_unaryOperator)
var _la int
defer func() {
p.ExitRule()
}()
defer func() {
if err := recover(); err != nil {
if v, ok := err.(antlr.RecognitionException); ok {
localctx.SetException(v)
p.GetErrorHandler().ReportError(p, v)
p.GetErrorHandler().Recover(p, v)
} else {
panic(err)
}
}
}()
p.EnterOuterAlt(localctx, 1)
{
p.SetState(255)
_la = p.GetTokenStream().LA(1)
if !((int64(_la) & ^0x3f) == 0 && ((int64(1)<<_la)&442368) != 0) {
p.GetErrorHandler().RecoverInline(p)
} else {
p.GetErrorHandler().ReportMatch(p)
p.Consume()
}
}
return localctx
}
func (p *SLQParser) Sempred(localctx antlr.RuleContext, ruleIndex, predIndex int) bool {
switch ruleIndex {
case 22:
var t *ExprContext = nil
if localctx != nil {
t = localctx.(*ExprContext)
}
return p.Expr_Sempred(t, predIndex)
default:
panic("No predicate with index: " + fmt.Sprint(ruleIndex))
}
}
func (p *SLQParser) Expr_Sempred(localctx antlr.RuleContext, predIndex int) bool {
this := p
_ = this
switch predIndex {
case 0:
return p.Precpred(p.GetParserRuleContext(), 8)
case 1:
return p.Precpred(p.GetParserRuleContext(), 7)
case 2:
return p.Precpred(p.GetParserRuleContext(), 6)
case 3:
return p.Precpred(p.GetParserRuleContext(), 5)
case 4:
return p.Precpred(p.GetParserRuleContext(), 4)
case 5:
return p.Precpred(p.GetParserRuleContext(), 3)
case 6:
return p.Precpred(p.GetParserRuleContext(), 2)
default:
panic("No predicate with index: " + fmt.Sprint(predIndex))
}
}
Reference in New Issue View Git Blame Copy Permalink