//line lang.y:6
package lang

import __yyfmt__ "fmt"

//line lang.y:6
import (
	"github.com/hashicorp/terraform/config/lang/ast"
)

//line lang.y:14
type parserSymType struct {
	yys      int
	node     ast.Node
	nodeList []ast.Node
	str      string
	token    *parserToken
}

const PROGRAM_BRACKET_LEFT = 57346
const PROGRAM_BRACKET_RIGHT = 57347
const PROGRAM_STRING_START = 57348
const PROGRAM_STRING_END = 57349
const PAREN_LEFT = 57350
const PAREN_RIGHT = 57351
const COMMA = 57352
const IDENTIFIER = 57353
const INTEGER = 57354
const FLOAT = 57355
const STRING = 57356

var parserToknames = []string{
	"PROGRAM_BRACKET_LEFT",
	"PROGRAM_BRACKET_RIGHT",
	"PROGRAM_STRING_START",
	"PROGRAM_STRING_END",
	"PAREN_LEFT",
	"PAREN_RIGHT",
	"COMMA",
	"IDENTIFIER",
	"INTEGER",
	"FLOAT",
	"STRING",
}
var parserStatenames = []string{}

const parserEofCode = 1
const parserErrCode = 2
const parserMaxDepth = 200

//line lang.y:151

//line yacctab:1
var parserExca = []int{
	-1, 1,
	1, -1,
	-2, 0,
}

const parserNprod = 17
const parserPrivate = 57344

var parserTokenNames []string
var parserStates []string

const parserLast = 23

var parserAct = []int{

	9, 7, 7, 3, 18, 19, 8, 15, 13, 11,
	12, 6, 6, 14, 8, 1, 17, 10, 2, 16,
	20, 4, 5,
}
var parserPact = []int{

	-2, -1000, -2, -1000, -1000, -1000, -1000, -3, -1000, 8,
	-2, -1000, -1000, -1, -1000, -3, -5, -1000, -1000, -3,
	-1000,
}
var parserPgo = []int{

	0, 0, 22, 21, 17, 3, 19, 15,
}
var parserR1 = []int{

	0, 7, 7, 4, 4, 5, 5, 2, 1, 1,
	1, 1, 1, 6, 6, 6, 3,
}
var parserR2 = []int{

	0, 0, 1, 1, 2, 1, 1, 3, 1, 1,
	1, 1, 4, 0, 3, 1, 1,
}
var parserChk = []int{

	-1000, -7, -4, -5, -3, -2, 14, 4, -5, -1,
	-4, 12, 13, 11, 5, 8, -6, -1, 9, 10,
	-1,
}
var parserDef = []int{

	1, -2, 2, 3, 5, 6, 16, 0, 4, 0,
	8, 9, 10, 11, 7, 13, 0, 15, 12, 0,
	14,
}
var parserTok1 = []int{

	1,
}
var parserTok2 = []int{

	2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
	12, 13, 14,
}
var parserTok3 = []int{
	0,
}

//line yaccpar:1

/*	parser for yacc output	*/

var parserDebug = 0

type parserLexer interface {
	Lex(lval *parserSymType) int
	Error(s string)
}

const parserFlag = -1000

func parserTokname(c int) string {
	// 4 is TOKSTART above
	if c >= 4 && c-4 < len(parserToknames) {
		if parserToknames[c-4] != "" {
			return parserToknames[c-4]
		}
	}
	return __yyfmt__.Sprintf("tok-%v", c)
}

func parserStatname(s int) string {
	if s >= 0 && s < len(parserStatenames) {
		if parserStatenames[s] != "" {
			return parserStatenames[s]
		}
	}
	return __yyfmt__.Sprintf("state-%v", s)
}

func parserlex1(lex parserLexer, lval *parserSymType) int {
	c := 0
	char := lex.Lex(lval)
	if char <= 0 {
		c = parserTok1[0]
		goto out
	}
	if char < len(parserTok1) {
		c = parserTok1[char]
		goto out
	}
	if char >= parserPrivate {
		if char < parserPrivate+len(parserTok2) {
			c = parserTok2[char-parserPrivate]
			goto out
		}
	}
	for i := 0; i < len(parserTok3); i += 2 {
		c = parserTok3[i+0]
		if c == char {
			c = parserTok3[i+1]
			goto out
		}
	}

out:
	if c == 0 {
		c = parserTok2[1] /* unknown char */
	}
	if parserDebug >= 3 {
		__yyfmt__.Printf("lex %s(%d)\n", parserTokname(c), uint(char))
	}
	return c
}

func parserParse(parserlex parserLexer) int {
	var parsern int
	var parserlval parserSymType
	var parserVAL parserSymType
	parserS := make([]parserSymType, parserMaxDepth)

	Nerrs := 0   /* number of errors */
	Errflag := 0 /* error recovery flag */
	parserstate := 0
	parserchar := -1
	parserp := -1
	goto parserstack

ret0:
	return 0

ret1:
	return 1

parserstack:
	/* put a state and value onto the stack */
	if parserDebug >= 4 {
		__yyfmt__.Printf("char %v in %v\n", parserTokname(parserchar), parserStatname(parserstate))
	}

	parserp++
	if parserp >= len(parserS) {
		nyys := make([]parserSymType, len(parserS)*2)
		copy(nyys, parserS)
		parserS = nyys
	}
	parserS[parserp] = parserVAL
	parserS[parserp].yys = parserstate

parsernewstate:
	parsern = parserPact[parserstate]
	if parsern <= parserFlag {
		goto parserdefault /* simple state */
	}
	if parserchar < 0 {
		parserchar = parserlex1(parserlex, &parserlval)
	}
	parsern += parserchar
	if parsern < 0 || parsern >= parserLast {
		goto parserdefault
	}
	parsern = parserAct[parsern]
	if parserChk[parsern] == parserchar { /* valid shift */
		parserchar = -1
		parserVAL = parserlval
		parserstate = parsern
		if Errflag > 0 {
			Errflag--
		}
		goto parserstack
	}

parserdefault:
	/* default state action */
	parsern = parserDef[parserstate]
	if parsern == -2 {
		if parserchar < 0 {
			parserchar = parserlex1(parserlex, &parserlval)
		}

		/* look through exception table */
		xi := 0
		for {
			if parserExca[xi+0] == -1 && parserExca[xi+1] == parserstate {
				break
			}
			xi += 2
		}
		for xi += 2; ; xi += 2 {
			parsern = parserExca[xi+0]
			if parsern < 0 || parsern == parserchar {
				break
			}
		}
		parsern = parserExca[xi+1]
		if parsern < 0 {
			goto ret0
		}
	}
	if parsern == 0 {
		/* error ... attempt to resume parsing */
		switch Errflag {
		case 0: /* brand new error */
			parserlex.Error("syntax error")
			Nerrs++
			if parserDebug >= 1 {
				__yyfmt__.Printf("%s", parserStatname(parserstate))
				__yyfmt__.Printf(" saw %s\n", parserTokname(parserchar))
			}
			fallthrough

		case 1, 2: /* incompletely recovered error ... try again */
			Errflag = 3

			/* find a state where "error" is a legal shift action */
			for parserp >= 0 {
				parsern = parserPact[parserS[parserp].yys] + parserErrCode
				if parsern >= 0 && parsern < parserLast {
					parserstate = parserAct[parsern] /* simulate a shift of "error" */
					if parserChk[parserstate] == parserErrCode {
						goto parserstack
					}
				}

				/* the current p has no shift on "error", pop stack */
				if parserDebug >= 2 {
					__yyfmt__.Printf("error recovery pops state %d\n", parserS[parserp].yys)
				}
				parserp--
			}
			/* there is no state on the stack with an error shift ... abort */
			goto ret1

		case 3: /* no shift yet; clobber input char */
			if parserDebug >= 2 {
				__yyfmt__.Printf("error recovery discards %s\n", parserTokname(parserchar))
			}
			if parserchar == parserEofCode {
				goto ret1
			}
			parserchar = -1
			goto parsernewstate /* try again in the same state */
		}
	}

	/* reduction by production parsern */
	if parserDebug >= 2 {
		__yyfmt__.Printf("reduce %v in:\n\t%v\n", parsern, parserStatname(parserstate))
	}

	parsernt := parsern
	parserpt := parserp
	_ = parserpt // guard against "declared and not used"

	parserp -= parserR2[parsern]
	parserVAL = parserS[parserp+1]

	/* consult goto table to find next state */
	parsern = parserR1[parsern]
	parserg := parserPgo[parsern]
	parserj := parserg + parserS[parserp].yys + 1

	if parserj >= parserLast {
		parserstate = parserAct[parserg]
	} else {
		parserstate = parserAct[parserj]
		if parserChk[parserstate] != -parsern {
			parserstate = parserAct[parserg]
		}
	}
	// dummy call; replaced with literal code
	switch parsernt {

	case 1:
		//line lang.y:33
		{
			parserResult = &ast.LiteralNode{
				Value: "",
				Typex: ast.TypeString,
				Posx:  ast.Pos{Column: 1, Line: 1},
			}
		}
	case 2:
		//line lang.y:41
		{
			parserResult = parserS[parserpt-0].node

			// We want to make sure that the top value is always a Concat
			// so that the return value is always a string type from an
			// interpolation.
			//
			// The logic for checking for a LiteralNode is a little annoying
			// because functionally the AST is the same, but we do that because
			// it makes for an easy literal check later (to check if a string
			// has any interpolations).
			if _, ok := parserS[parserpt-0].node.(*ast.Concat); !ok {
				if n, ok := parserS[parserpt-0].node.(*ast.LiteralNode); !ok || n.Typex != ast.TypeString {
					parserResult = &ast.Concat{
						Exprs: []ast.Node{parserS[parserpt-0].node},
						Posx:  parserS[parserpt-0].node.Pos(),
					}
				}
			}
		}
	case 3:
		//line lang.y:64
		{
			parserVAL.node = parserS[parserpt-0].node
		}
	case 4:
		//line lang.y:68
		{
			var result []ast.Node
			if c, ok := parserS[parserpt-1].node.(*ast.Concat); ok {
				result = append(c.Exprs, parserS[parserpt-0].node)
			} else {
				result = []ast.Node{parserS[parserpt-1].node, parserS[parserpt-0].node}
			}

			parserVAL.node = &ast.Concat{
				Exprs: result,
				Posx:  result[0].Pos(),
			}
		}
	case 5:
		//line lang.y:84
		{
			parserVAL.node = parserS[parserpt-0].node
		}
	case 6:
		//line lang.y:88
		{
			parserVAL.node = parserS[parserpt-0].node
		}
	case 7:
		//line lang.y:94
		{
			parserVAL.node = parserS[parserpt-1].node
		}
	case 8:
		//line lang.y:100
		{
			parserVAL.node = parserS[parserpt-0].node
		}
	case 9:
		//line lang.y:104
		{
			parserVAL.node = &ast.LiteralNode{
				Value: parserS[parserpt-0].token.Value.(int),
				Typex: ast.TypeInt,
				Posx:  parserS[parserpt-0].token.Pos,
			}
		}
	case 10:
		//line lang.y:112
		{
			parserVAL.node = &ast.LiteralNode{
				Value: parserS[parserpt-0].token.Value.(float64),
				Typex: ast.TypeFloat,
				Posx:  parserS[parserpt-0].token.Pos,
			}
		}
	case 11:
		//line lang.y:120
		{
			parserVAL.node = &ast.VariableAccess{Name: parserS[parserpt-0].token.Value.(string), Posx: parserS[parserpt-0].token.Pos}
		}
	case 12:
		//line lang.y:124
		{
			parserVAL.node = &ast.Call{Func: parserS[parserpt-3].token.Value.(string), Args: parserS[parserpt-1].nodeList, Posx: parserS[parserpt-3].token.Pos}
		}
	case 13:
		//line lang.y:129
		{
			parserVAL.nodeList = nil
		}
	case 14:
		//line lang.y:133
		{
			parserVAL.nodeList = append(parserS[parserpt-2].nodeList, parserS[parserpt-0].node)
		}
	case 15:
		//line lang.y:137
		{
			parserVAL.nodeList = append(parserVAL.nodeList, parserS[parserpt-0].node)
		}
	case 16:
		//line lang.y:143
		{
			parserVAL.node = &ast.LiteralNode{
				Value: parserS[parserpt-0].token.Value.(string),
				Typex: ast.TypeString,
				Posx:  parserS[parserpt-0].token.Pos,
			}
		}
	}
	goto parserstack /* stack new state and value */
}