//line expressions.y:2 package expression import __yyfmt__ "fmt" //line expressions.y:2 import ( "fmt" "github.com/osteele/liquid/evaluator" ) func init() { // This allows adding and removing references to fmt in the rules below, // without having to edit the import statement to avoid erorrs each time. _ = fmt.Sprint("") } //line expressions.y:15 type yySymType struct { yys int name string val interface{} f func(Context) interface{} arglist []func(Context) interface{} loop Loop loopmods loopModifiers filter_params []valueFn } const LITERAL = 57346 const IDENTIFIER = 57347 const KEYWORD = 57348 const PROPERTY = 57349 const ARGLIST = 57350 const ASSIGN = 57351 const LOOP = 57352 const EQ = 57353 const NEQ = 57354 const GE = 57355 const LE = 57356 const IN = 57357 const AND = 57358 const OR = 57359 const CONTAINS = 57360 var yyToknames = [...]string{ "$end", "error", "$unk", "LITERAL", "IDENTIFIER", "KEYWORD", "PROPERTY", "ARGLIST", "ASSIGN", "LOOP", "EQ", "NEQ", "GE", "LE", "IN", "AND", "OR", "CONTAINS", "'.'", "'|'", "'<'", "'>'", "';'", "'='", "','", "'['", "']'", "'('", "')'", } var yyStatenames = [...]string{} const yyEofCode = 1 const yyErrCode = 2 const yyInitialStackSize = 16 //line yacctab:1 var yyExca = [...]int{ -1, 1, 1, -1, -2, 0, } const yyPrivate = 57344 const yyLast = 77 var yyAct = [...]int{ 8, 35, 21, 21, 7, 17, 23, 24, 27, 28, 60, 9, 10, 29, 33, 37, 26, 25, 13, 14, 34, 22, 22, 41, 42, 43, 44, 45, 46, 47, 48, 49, 21, 20, 51, 11, 57, 52, 50, 51, 21, 55, 20, 53, 9, 10, 13, 14, 4, 3, 5, 22, 56, 12, 58, 6, 38, 19, 36, 22, 2, 63, 61, 62, 39, 40, 15, 64, 11, 31, 32, 1, 30, 16, 59, 18, 54, } var yyPact = [...]int{ 40, -1000, 30, 61, 7, 52, -1000, 22, -5, -1000, -1000, 7, -1000, 7, 7, -10, -3, 33, -8, 41, 59, -1000, 7, 7, 7, 7, 7, 7, 7, 7, 2, -1000, -1000, 7, -1000, -1000, 7, -1000, 7, -1000, 7, 25, -4, -4, -4, -4, -4, -4, -4, -1000, 13, -4, 33, 22, -15, -4, -1000, -1000, -1000, 57, 7, -1000, 63, -4, -1000, } var yyPgo = [...]int{ 0, 0, 55, 4, 60, 76, 75, 74, 73, 1, 71, } var yyR1 = [...]int{ 0, 10, 10, 10, 10, 8, 9, 9, 6, 7, 7, 7, 1, 1, 1, 1, 1, 3, 3, 3, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 4, } var yyR2 = [...]int{ 0, 2, 5, 3, 3, 2, 0, 3, 4, 0, 2, 3, 1, 1, 2, 4, 3, 1, 3, 4, 1, 3, 1, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, } var yyChk = [...]int{ -1000, -10, -4, 9, 8, 10, -2, -3, -1, 4, 5, 28, 23, 16, 17, 5, -8, -1, -6, 5, 20, 7, 26, 11, 12, 22, 21, 13, 14, 18, -4, -2, -2, 24, 23, -9, 25, 23, 15, 5, 6, -1, -1, -1, -1, -1, -1, -1, -1, 29, -3, -1, -1, -3, -5, -1, 27, 23, -9, -7, 25, 5, 6, -1, 4, } var yyDef = [...]int{ 0, -2, 0, 0, 0, 0, 30, 22, 17, 12, 13, 0, 1, 0, 0, 0, 0, 6, 0, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 32, 0, 3, 5, 0, 4, 0, 18, 0, 0, 23, 24, 25, 26, 27, 28, 29, 16, 0, 17, 6, 9, 19, 20, 15, 2, 7, 8, 0, 10, 0, 21, 11, } var yyTok1 = [...]int{ 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 28, 29, 3, 3, 25, 3, 19, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 23, 21, 24, 22, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 26, 3, 27, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 20, } var yyTok2 = [...]int{ 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, } var yyTok3 = [...]int{ 0, } var yyErrorMessages = [...]struct { state int token int msg string }{} //line yaccpar:1 /* parser for yacc output */ var ( yyDebug = 0 yyErrorVerbose = false ) type yyLexer interface { Lex(lval *yySymType) int Error(s string) } type yyParser interface { Parse(yyLexer) int Lookahead() int } type yyParserImpl struct { lval yySymType stack [yyInitialStackSize]yySymType char int } func (p *yyParserImpl) Lookahead() int { return p.char } func yyNewParser() yyParser { return &yyParserImpl{} } const yyFlag = -1000 func yyTokname(c int) string { if c >= 1 && c-1 < len(yyToknames) { if yyToknames[c-1] != "" { return yyToknames[c-1] } } return __yyfmt__.Sprintf("tok-%v", c) } func yyStatname(s int) string { if s >= 0 && s < len(yyStatenames) { if yyStatenames[s] != "" { return yyStatenames[s] } } return __yyfmt__.Sprintf("state-%v", s) } func yyErrorMessage(state, lookAhead int) string { const TOKSTART = 4 if !yyErrorVerbose { return "syntax error" } for _, e := range yyErrorMessages { if e.state == state && e.token == lookAhead { return "syntax error: " + e.msg } } res := "syntax error: unexpected " + yyTokname(lookAhead) // To match Bison, suggest at most four expected tokens. expected := make([]int, 0, 4) // Look for shiftable tokens. base := yyPact[state] for tok := TOKSTART; tok-1 < len(yyToknames); tok++ { if n := base + tok; n >= 0 && n < yyLast && yyChk[yyAct[n]] == tok { if len(expected) == cap(expected) { return res } expected = append(expected, tok) } } if yyDef[state] == -2 { i := 0 for yyExca[i] != -1 || yyExca[i+1] != state { i += 2 } // Look for tokens that we accept or reduce. for i += 2; yyExca[i] >= 0; i += 2 { tok := yyExca[i] if tok < TOKSTART || yyExca[i+1] == 0 { continue } if len(expected) == cap(expected) { return res } expected = append(expected, tok) } // If the default action is to accept or reduce, give up. if yyExca[i+1] != 0 { return res } } for i, tok := range expected { if i == 0 { res += ", expecting " } else { res += " or " } res += yyTokname(tok) } return res } func yylex1(lex yyLexer, lval *yySymType) (char, token int) { token = 0 char = lex.Lex(lval) if char <= 0 { token = yyTok1[0] goto out } if char < len(yyTok1) { token = yyTok1[char] goto out } if char >= yyPrivate { if char < yyPrivate+len(yyTok2) { token = yyTok2[char-yyPrivate] goto out } } for i := 0; i < len(yyTok3); i += 2 { token = yyTok3[i+0] if token == char { token = yyTok3[i+1] goto out } } out: if token == 0 { token = yyTok2[1] /* unknown char */ } if yyDebug >= 3 { __yyfmt__.Printf("lex %s(%d)\n", yyTokname(token), uint(char)) } return char, token } func yyParse(yylex yyLexer) int { return yyNewParser().Parse(yylex) } func (yyrcvr *yyParserImpl) Parse(yylex yyLexer) int { var yyn int var yyVAL yySymType var yyDollar []yySymType _ = yyDollar // silence set and not used yyS := yyrcvr.stack[:] Nerrs := 0 /* number of errors */ Errflag := 0 /* error recovery flag */ yystate := 0 yyrcvr.char = -1 yytoken := -1 // yyrcvr.char translated into internal numbering defer func() { // Make sure we report no lookahead when not parsing. yystate = -1 yyrcvr.char = -1 yytoken = -1 }() yyp := -1 goto yystack ret0: return 0 ret1: return 1 yystack: /* put a state and value onto the stack */ if yyDebug >= 4 { __yyfmt__.Printf("char %v in %v\n", yyTokname(yytoken), yyStatname(yystate)) } yyp++ if yyp >= len(yyS) { nyys := make([]yySymType, len(yyS)*2) copy(nyys, yyS) yyS = nyys } yyS[yyp] = yyVAL yyS[yyp].yys = yystate yynewstate: yyn = yyPact[yystate] if yyn <= yyFlag { goto yydefault /* simple state */ } if yyrcvr.char < 0 { yyrcvr.char, yytoken = yylex1(yylex, &yyrcvr.lval) } yyn += yytoken if yyn < 0 || yyn >= yyLast { goto yydefault } yyn = yyAct[yyn] if yyChk[yyn] == yytoken { /* valid shift */ yyrcvr.char = -1 yytoken = -1 yyVAL = yyrcvr.lval yystate = yyn if Errflag > 0 { Errflag-- } goto yystack } yydefault: /* default state action */ yyn = yyDef[yystate] if yyn == -2 { if yyrcvr.char < 0 { yyrcvr.char, yytoken = yylex1(yylex, &yyrcvr.lval) } /* look through exception table */ xi := 0 for { if yyExca[xi+0] == -1 && yyExca[xi+1] == yystate { break } xi += 2 } for xi += 2; ; xi += 2 { yyn = yyExca[xi+0] if yyn < 0 || yyn == yytoken { break } } yyn = yyExca[xi+1] if yyn < 0 { goto ret0 } } if yyn == 0 { /* error ... attempt to resume parsing */ switch Errflag { case 0: /* brand new error */ yylex.Error(yyErrorMessage(yystate, yytoken)) Nerrs++ if yyDebug >= 1 { __yyfmt__.Printf("%s", yyStatname(yystate)) __yyfmt__.Printf(" saw %s\n", yyTokname(yytoken)) } fallthrough case 1, 2: /* incompletely recovered error ... try again */ Errflag = 3 /* find a state where "error" is a legal shift action */ for yyp >= 0 { yyn = yyPact[yyS[yyp].yys] + yyErrCode if yyn >= 0 && yyn < yyLast { yystate = yyAct[yyn] /* simulate a shift of "error" */ if yyChk[yystate] == yyErrCode { goto yystack } } /* the current p has no shift on "error", pop stack */ if yyDebug >= 2 { __yyfmt__.Printf("error recovery pops state %d\n", yyS[yyp].yys) } yyp-- } /* there is no state on the stack with an error shift ... abort */ goto ret1 case 3: /* no shift yet; clobber input char */ if yyDebug >= 2 { __yyfmt__.Printf("error recovery discards %s\n", yyTokname(yytoken)) } if yytoken == yyEofCode { goto ret1 } yyrcvr.char = -1 yytoken = -1 goto yynewstate /* try again in the same state */ } } /* reduction by production yyn */ if yyDebug >= 2 { __yyfmt__.Printf("reduce %v in:\n\t%v\n", yyn, yyStatname(yystate)) } yynt := yyn yypt := yyp _ = yypt // guard against "declared and not used" yyp -= yyR2[yyn] // yyp is now the index of $0. Perform the default action. Iff the // reduced production is ε, $1 is possibly out of range. if yyp+1 >= len(yyS) { nyys := make([]yySymType, len(yyS)*2) copy(nyys, yyS) yyS = nyys } yyVAL = yyS[yyp+1] /* consult goto table to find next state */ yyn = yyR1[yyn] yyg := yyPgo[yyn] yyj := yyg + yyS[yyp].yys + 1 if yyj >= yyLast { yystate = yyAct[yyg] } else { yystate = yyAct[yyj] if yyChk[yystate] != -yyn { yystate = yyAct[yyg] } } // dummy call; replaced with literal code switch yynt { case 1: yyDollar = yyS[yypt-2 : yypt+1] //line expressions.y:37 { yylex.(*lexer).val = yyDollar[1].f } case 2: yyDollar = yyS[yypt-5 : yypt+1] //line expressions.y:38 { yylex.(*lexer).Assignment = Assignment{yyDollar[2].name, &expression{yyDollar[4].f}} } case 3: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:41 { args := yyDollar[2].arglist yylex.(*lexer).val = func(ctx Context) interface{} { result := make([]interface{}, len(args)) for i, fn := range args { result[i] = fn(ctx) } return result } } case 4: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:51 { yylex.(*lexer).Loop = yyDollar[2].loop } case 5: yyDollar = yyS[yypt-2 : yypt+1] //line expressions.y:55 { yyVAL.arglist = append([]func(Context) interface{}{yyDollar[1].f}, yyDollar[2].arglist...) } case 6: yyDollar = yyS[yypt-0 : yypt+1] //line expressions.y:57 { yyVAL.arglist = []func(Context) interface{}{} } case 7: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:58 { yyVAL.arglist = append([]func(Context) interface{}{yyDollar[2].f}, yyDollar[3].arglist...) } case 8: yyDollar = yyS[yypt-4 : yypt+1] //line expressions.y:61 { name, expr, mods := yyDollar[1].name, yyDollar[3].f, yyDollar[4].loopmods yyVAL.loop = Loop{name, &expression{expr}, mods} } case 9: yyDollar = yyS[yypt-0 : yypt+1] //line expressions.y:67 { yyVAL.loopmods = loopModifiers{} } case 10: yyDollar = yyS[yypt-2 : yypt+1] //line expressions.y:68 { switch yyDollar[2].name { case "reversed": yyDollar[1].loopmods.Reversed = true default: panic(ParseError(fmt.Sprintf("undefined loop modifier %q", yyDollar[2].name))) } yyVAL.loopmods = yyDollar[1].loopmods } case 11: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:77 { // TODO can this be a variable? switch yyDollar[2].name { case "limit": limit, ok := yyDollar[3].val.(int) if !ok { panic(ParseError(fmt.Sprintf("loop limit must an integer"))) } yyDollar[1].loopmods.Limit = &limit case "offset": offset, ok := yyDollar[3].val.(int) if !ok { panic(ParseError(fmt.Sprintf("loop offset must an integer"))) } yyDollar[1].loopmods.Offset = offset default: panic(ParseError(fmt.Sprintf("undefined loop modifier %q", yyDollar[2].name))) } yyVAL.loopmods = yyDollar[1].loopmods } case 12: yyDollar = yyS[yypt-1 : yypt+1] //line expressions.y:99 { val := yyDollar[1].val yyVAL.f = func(_ Context) interface{} { return val } } case 13: yyDollar = yyS[yypt-1 : yypt+1] //line expressions.y:100 { name := yyDollar[1].name yyVAL.f = func(ctx Context) interface{} { return ctx.Get(name) } } case 14: yyDollar = yyS[yypt-2 : yypt+1] //line expressions.y:101 { yyVAL.f = makeObjectPropertyExpr(yyDollar[1].f, yyDollar[2].name) } case 15: yyDollar = yyS[yypt-4 : yypt+1] //line expressions.y:102 { yyVAL.f = makeIndexExpr(yyDollar[1].f, yyDollar[3].f) } case 16: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:103 { yyVAL.f = yyDollar[2].f } case 18: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:108 { yyVAL.f = makeFilter(yyDollar[1].f, yyDollar[3].name, nil) } case 19: yyDollar = yyS[yypt-4 : yypt+1] //line expressions.y:109 { yyVAL.f = makeFilter(yyDollar[1].f, yyDollar[3].name, yyDollar[4].filter_params) } case 20: yyDollar = yyS[yypt-1 : yypt+1] //line expressions.y:113 { yyVAL.filter_params = []valueFn{yyDollar[1].f} } case 21: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:115 { yyVAL.filter_params = append(yyDollar[1].filter_params, yyDollar[3].f) } case 23: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:119 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { a, b := fa(ctx), fb(ctx) return evaluator.Equal(a, b) } } case 24: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:126 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { a, b := fa(ctx), fb(ctx) return !evaluator.Equal(a, b) } } case 25: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:133 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { a, b := fa(ctx), fb(ctx) return evaluator.Less(b, a) } } case 26: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:140 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { a, b := fa(ctx), fb(ctx) return evaluator.Less(a, b) } } case 27: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:147 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { a, b := fa(ctx), fb(ctx) return evaluator.Less(b, a) || evaluator.Equal(a, b) } } case 28: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:154 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { a, b := fa(ctx), fb(ctx) return evaluator.Less(a, b) || evaluator.Equal(a, b) } } case 29: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:161 { yyVAL.f = makeContainsExpr(yyDollar[1].f, yyDollar[3].f) } case 31: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:166 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { return evaluator.IsTrue(fa(ctx)) && evaluator.IsTrue(fb(ctx)) } } case 32: yyDollar = yyS[yypt-3 : yypt+1] //line expressions.y:172 { fa, fb := yyDollar[1].f, yyDollar[3].f yyVAL.f = func(ctx Context) interface{} { return evaluator.IsTrue(fa(ctx)) || evaluator.IsTrue(fb(ctx)) } } } goto yystack /* stack new state and value */ }