// Copyright 2018 Couchbase, Inc. All rights reserved.

package gojsonsm

import (
	"fmt"
	"math"
	"regexp"
	"strconv"
	"strings"
	"sync"
)

/**
 * SimpleParser provides user to be able to specify a N1QL-Styled expression for gojsonsm.
 *
 * Values can be string or floats. Strings should be enclosed by double quotes, as to not be confused
 * with field variables
 *
 * Embedded objects are accessed via (.) accessor.
 * Example:
 * 		name.first == 'Neil'
 *
 * Field variables can be escaped by backticks ` to become literals.
 * Example:
 * 		`version0.1_serialNumber` LIKE "SN[0-9]+"
 *
 * Arrays are accessed with brackets, and integer indexes do not have to be enclosed by backticks.
 * Example:
 * 		user[10]
 * 		US.`users.ids`[10]
 *
 * Parenthesis are allowed, but must be surrounded by at least 1 white space
 * Currently, only the following operations are supported:
 * 		==/=, !=, ||/OR, &&/AND, >=, >, <=, <, LIKE/=~, NOT LIKE, EXISTS, IS MISSING, IS NULL, IS NOT NULL
 *
 * Usage example:
 * exprStr := "name.`first.name` == "Neil" && (age < 50 || isActive == true)"
 * expr, err := ParseSimpleExpression(exprStr)
 *
 * Notes:
 * - Parenthesis parsing is there but could be a bit wonky should users choose to have invalid and weird syntax with it
 */

// Values by def should be enclosed within double quotes or single quotes
var valueRegex *regexp.Regexp = regexp.MustCompile(`^\".*\"$`)
var valueRegex2 *regexp.Regexp = regexp.MustCompile(`^\'.*\'$`)

// Or Values can be int or floats by themselves (w/o alpha char)
var valueNumRegex *regexp.Regexp = regexp.MustCompile(`^(-?)(0|([1-9][0-9]*))(\.[0-9]+)?$`)

var intNumRegex *regexp.Regexp = regexp.MustCompile(`^(-?)[0-9]+$`)

// Field path can be integers
var fieldTokenInt *regexp.Regexp = regexp.MustCompile(`[0-9]`)

// But they cannot have leading zeros
var fieldIndexNoLeadingZero *regexp.Regexp = regexp.MustCompile(`[^0][0-9]+`)

// Functions patterns
var funcTranslateTable map[string]string = map[string]string{
	FuncAbs:   MathFuncAbs,
	FuncAcos:  MathFuncAcos,
	FuncAsin:  MathFuncAsin,
	FuncAtan:  MathFuncAtan,
	FuncCeil:  MathFuncCeil,
	FuncCos:   MathFuncCos,
	FuncDate:  DateFunc,
	FuncDeg:   MathFuncDegrees,
	FuncExp:   MathFuncExp,
	FuncFloor: MathFuncFloor,
	FuncLog:   MathFuncLog,
	FuncLn:    MathFuncLn,
	FuncSin:   MathFuncSin,
	FuncTan:   MathFuncTan,
	FuncRad:   MathFuncRadians,
	FuncRound: MathFuncRound,
	FuncSqrt:  MathFuncSqrt,
}

var func0VarTranslateTable map[string]string = map[string]string{
	"PI": MathFuncPi,
	"E":  MathFuncE,
}

// Two variables function patterns
var func2VarsTranslateTable map[string]string = map[string]string{
	FuncAtan2: MathFuncAtan2,
	FuncPower: MathFuncPow,
}

func funcIsConstantType(fxName string) (bool, interface{}) {
	switch fxName {
	case MathFuncPi:
		return true, float64(math.Pi)
	case MathFuncE:
		return true, float64(math.E)
	}
	return false, nil
}

func getOutputFuncName(userInput string) string {
	if val, ok := funcTranslateTable[userInput]; ok {
		return val
	} else if val, ok := func0VarTranslateTable[userInput]; ok {
		return val
	} else if val, ok := func2VarsTranslateTable[userInput]; ok {
		return val
	} else {
		return ""
	}
}

func getCheckFuncPattern(name string) string {
	return fmt.Sprintf(`^%s\((?P<args>.+)\)$`, name)
}

func getCheckFunc0Pattern(name string) string {
	return fmt.Sprintf(`^%s\(\)$`, name)
}

func getCheckFunc2Pattern(name string) string {
	return fmt.Sprintf(`^%s\((?P<args>.+), *(?P<args>.+)\)$`, name)
}

type ParserTreeNode struct {
	tokenType ParseTokenType
	data      interface{}
}

func needToSpawnNewContext(err error) bool {
	return err == ErrorNeedToStartOneNewCtx || err == ErrorNeedToStartNewCtx
}

var emptyParserTreeNode ParserTreeNode

func NewParserTreeNode(tokenType ParseTokenType, data interface{}) ParserTreeNode {
	newNode := &ParserTreeNode{
		tokenType: tokenType,
		data:      data,
	}
	return *newNode
}

type parserSubContext struct {
	// Actual parser context
	currentMode            parseMode
	lastSubFieldNode       int // The last finished left side of the op
	skipAdvanceCurrentMode bool
	opTokenContext         opTokenContext

	fieldIsTrueOrFalse bool

	// For tree organization
	lastParserDataNode  int // Last inserted parser data node location
	lastBinTreeDataNode int // Last inserted parserTree data node location
	lastFieldIndex      int
	lastOpIndex         int
	lastValueIndex      int

	// For inserting node
	funcHelperCtx *funcOutputHelper

	// Means that we should return as soon as the one layer of field -> op -> value is done
	oneLayerMode bool

	// Last seeker found
	lastSeeker *opSeeker
}

func (subctx *parserSubContext) isUnused() bool {
	return subctx.lastFieldIndex == -1 && subctx.lastOpIndex == -1 && subctx.lastValueIndex == -1 &&
		subctx.lastSubFieldNode == -1 && subctx.currentMode == fieldMode
}

func NewParserSubContext() *parserSubContext {
	subCtx := &parserSubContext{
		lastFieldIndex:   -1,
		lastOpIndex:      -1,
		lastValueIndex:   -1,
		lastSubFieldNode: -1,
		currentMode:      fieldMode,
	}
	return subCtx
}

func NewParserSubContextOneLayer() *parserSubContext {
	subCtx := NewParserSubContext()
	subCtx.oneLayerMode = true
	return subCtx
}

type multiwordHelperPair struct {
	actualMultiWords []string
	valid            bool
}

type funcOutputHelper struct {
	// args represent levels of potential fx recursion. The first slice is always the top level fx call
	// The first element of []interface{} is always the func name
	args             [][]interface{}
	lvlMarker        int
	recursiveKeyFunc checkAndGetKeyFunc

	// Functional regex to grab function names and also its arguments
	builtInFuncRegex map[string]*regexp.Regexp
}

type opSeeker struct {
	completeToken string
	idx           int

	opFound bool
	//	opFoundLastIdx int
	opMatched string
}

func NewOpSeeker(token string) *opSeeker {
	seeker := &opSeeker{completeToken: token}
	return seeker
}

func (os *opSeeker) Seek() bool {
	for i := 0; i < len(os.completeToken); i++ {
		os.idx = i
		os.seekInternal(i)
		if os.opFound {
			return true
		}
	}
	return false
}

func (os *opSeeker) GetToken() string {
	return os.opMatched
}

func (os *opSeeker) seekInternal(curIdx int) {
	compiledStr := os.completeToken[os.idx:curIdx]
	if tokenIsOpType(compiledStr) {
		if !os.opFound {
			os.opFound = true
		}
		if curIdx == len(os.completeToken) {
			// The last character just happens to be the op
			os.opMatched = compiledStr
			return
		}
	} else {
		if os.opFound {
			os.opMatched = os.completeToken[os.idx : curIdx-1]
			return
		}
	}

	if curIdx < len(os.completeToken) {
		os.seekInternal(curIdx + 1)
	}
}

type expressionParserContext struct {
	// For token reading
	tokens               []string
	currentTokenIndex    int
	advTokenPositionOnly bool // This flag is set once, and the corresponding method will toggle it off automatically
	multiwordHelperMap   map[string]*multiwordHelperPair
	multiwordMapOnce     sync.Once
	// Split the last successful field token into subtokens for transformer's Path
	lastFieldTokens []string

	// The levels of parenthesis currently discovered in the expression
	parenDepth int

	// Current sub context
	subCtx *parserSubContext

	// non-short ciruit eval -> left most expression does not necessarily translate into the first to be examined
	shortCircuitEnabled bool

	// Final parser tree - binTree is the one that is used to keep track of tree structure
	// Each element of []ParserTreeNode corresponds to the # of element in parserTree.data
	parserTree      binParserTree
	parserDataNodes []ParserTreeNode
	treeHeadIndex   int

	// For field tokens, as the parser checks the syntax of the field, it separates them into subtokens for outputting
	// to Path for field expressions. This map stores the information. Key is the index of ParserTreeNode
	fieldTokenPaths map[int][]string

	// Functions are essentially like augmented fields/values.
	// Each element in this map that is a field must have a counter part in the fieldTOkensPaths map above
	// If it's a value, then it's indicated in the pair, and the value interface is used
	funcOutputContext map[int]*funcOutputHelper
	builtInFuncRegex  map[string]*regexp.Regexp

	// Outputting context
	currentOuputNode int

	// Compile-time determined PCRE module
	pcreWrapper PcreWrapperInterface
}

type checkFieldMode int

const (
	cfmNone          checkFieldMode = iota
	cfmBacktick      checkFieldMode = iota
	cfmNestedNumeric checkFieldMode = iota
)

func NewExpressionParserCtx(strExpression string) (*expressionParserContext, error) {
	subCtx := NewParserSubContext()
	ctx := &expressionParserContext{
		tokens:            strings.Fields(strExpression),
		subCtx:            subCtx,
		treeHeadIndex:     -1,
		fieldTokenPaths:   make(map[int][]string),
		builtInFuncRegex:  make(map[string]*regexp.Regexp),
		funcOutputContext: make(map[int]*funcOutputHelper),
	}
	for k, _ := range funcTranslateTable {
		regex := regexp.MustCompile(getCheckFuncPattern(k))
		ctx.builtInFuncRegex[k] = regex
	}
	for k, _ := range func0VarTranslateTable {
		regex := regexp.MustCompile(getCheckFunc0Pattern(k))
		ctx.builtInFuncRegex[k] = regex
	}
	for k, _ := range func2VarsTranslateTable {
		regex := regexp.MustCompile(getCheckFunc2Pattern(k))
		ctx.builtInFuncRegex[k] = regex
	}
	return ctx, nil
}

type ParseTokenType int

const (
	TokenTypeField    ParseTokenType = iota
	TokenTypeFunc     ParseTokenType = iota
	TokenTypeOperator ParseTokenType = iota
	TokenTypeValue    ParseTokenType = iota
	TokenTypeRegex    ParseTokenType = iota
	TokenTypePcre     ParseTokenType = iota
	TokenTypeParen    ParseTokenType = iota
	TokenTypeEndParen ParseTokenType = iota
	TokenTypeTrue     ParseTokenType = iota
	TokenTypeFalse    ParseTokenType = iota
	TokenTypeInvalid  ParseTokenType = iota
)

func (ptt ParseTokenType) String() string {
	switch ptt {
	case TokenTypeField:
		return "TokenTypeField"
	case TokenTypeOperator:
		return "TokenTypeOperator"
	case TokenTypeValue:
		return "TokenTypeValue"
	case TokenTypeRegex:
		return "TokenTypeRegex"
	case TokenTypePcre:
		return "TokenTypePcre"
	case TokenTypeParen:
		return "TokenTypeParen"
	case TokenTypeEndParen:
		return "TokenTypeEndParen"
	case TokenTypeTrue:
		return "TokenTypeTrue"
	case TokenTypeFalse:
		return "TokenTypeFalse"
	case TokenTypeInvalid:
		return "TokenTypeInvalid"
	}
	return "Unknown"
}

func (ptt ParseTokenType) isBoolType() bool {
	return ptt == TokenTypeTrue || ptt == TokenTypeFalse
}

func (ptt ParseTokenType) isFieldType() bool {
	return ptt == TokenTypeField || ptt == TokenTypeFunc
}

func (ptt ParseTokenType) isOpType() bool {
	return ptt == TokenTypeOperator
}

// Regex is a type of special "value", and functions can act as values too
func (ptt ParseTokenType) isValueType() bool {
	return ptt == TokenTypeValue || ptt == TokenTypeRegex || ptt == TokenTypeFunc || ptt == TokenTypePcre
}

// Operator types
const (
	TokenOperatorEqual         = "=="
	TokenOperatorNotEqual      = "!="
	TokenOperatorOr            = "||"
	TokenOperatorAnd           = "&&"
	TokenOperatorLessThan      = "<"
	TokenOperatorLessThanEq    = "<="
	TokenOperatorGreaterThan   = ">"
	TokenOperatorGreaterThanEq = ">="
	TokenOperatorLike          = "=~"
	TokenOperatorExists        = "EXISTS"
)

// Other allowable operator tokens
const (
	TokenOperatorEqual2 = "="
	TokenOperatorOr2    = "OR"
	TokenOperatorAnd2   = "AND"
	TokenOperatorLike2  = "LIKE"
)

// Multi-word operator tokens
var TokenOperatorNotLike []string = []string{"NOT", "LIKE"}
var TokenOperatorIsNull []string = []string{"IS", "NULL"}
var TokenOperatorIsNotNull []string = []string{"IS", "NOT", "NULL"}
var TokenOperatorIsMissing []string = []string{"IS", "MISSING"}

// In keeping with internals, flatten it and use it as comparison for actual op when outputting
func flattenToken(token []string) string {
	return strings.Join(token, "_")
}

func replaceOpTokenIfNecessary(token string) string {
	switch token {
	case TokenOperatorEqual2:
		return TokenOperatorEqual
	case TokenOperatorOr2:
		return TokenOperatorOr
	case TokenOperatorAnd2:
		return TokenOperatorAnd
	case TokenOperatorLike2:
		return TokenOperatorLike
	}
	return token
}

func tokenIsOpType(token string) bool {
	// Equal is both numeric and logical
	return tokenIsChainOpType(token) || tokenIsEquivalentType(token) || tokenIsCompareOpType(token) || tokenIsLikeType(token) ||
		tokenIsOpOnlyType(token)
}

// This ops do not have value follow-ups
func tokenIsOpOnlyType(token string) bool {
	return tokenIsExistenceType(token) || tokenIsNullType(token)
}

func tokenIsExistenceType(token string) bool {
	return token == TokenOperatorExists || token == flattenToken(TokenOperatorIsMissing)
}

func tokenIsNullType(token string) bool {
	return token == flattenToken(TokenOperatorIsNull) || token == flattenToken(TokenOperatorIsNotNull)
}

func tokenIsLikeType(token string) bool {
	return token == TokenOperatorLike || token == TokenOperatorLike2 || token == flattenToken(TokenOperatorNotLike)
}

func tokenIsEquivalentType(token string) bool {
	return token == TokenOperatorEqual || token == TokenOperatorEqual2 || token == TokenOperatorNotEqual
}

// Comparison Operator can be used for both string comparison and numeric
func tokenIsCompareOpType(token string) bool {
	return token == TokenOperatorGreaterThanEq || token == TokenOperatorLessThan || token == TokenOperatorLessThanEq || token == TokenOperatorGreaterThan
}

// Chain-op are operators that can chain multiple expressions together
func tokenIsChainOpType(token string) bool {
	return token == TokenOperatorAnd || token == TokenOperatorAnd2 || token == TokenOperatorOr || token == TokenOperatorOr2
}

func (ctx *expressionParserContext) tokenIsBuiltInFuncType(token string) (bool, string) {
	for key, checker := range ctx.builtInFuncRegex {
		if checker.MatchString(token) {
			return true, key
		}
	}
	return false, ""
}

func (opCtx opTokenContext) isChainOp() bool {
	return opCtx == chainOp
}

func (opCtx opTokenContext) isCompareOp() bool {
	return opCtx == compareOp
}

func (opCtx opTokenContext) isLikeOp() bool {
	return opCtx == matchOp
}

func (opCtx *opTokenContext) clear() {
	if *opCtx != noOp {
		*opCtx = noOp
	}
}

// returns a delim string, or true for valueNumRegex match, nor nil if no match
func valueCheck(token string) interface{} {
	if valueRegex.MatchString(token) {
		return `"`
	} else if valueRegex2.MatchString(token) {
		return "'"
	} else if valueNumRegex.MatchString(token) {
		return true
	}
	return nil
}

func (ctx *expressionParserContext) advanceToken() error {
	ctx.currentTokenIndex++

	if ctx.advTokenPositionOnly {
		ctx.advTokenPositionOnly = false
		return nil
	}

	ctx.subCtx.funcHelperCtx = nil

	// context mode transition
	switch ctx.subCtx.currentMode {
	case fieldMode:
		// After the field mode, the next token *must* be an op
		ctx.subCtx.currentMode = opMode
	case opMode:
		switch ctx.subCtx.opTokenContext {
		case noFieldOp:
			// These ops do not have fields
			ctx.subCtx.currentMode = chainMode
		case chainOp:
			ctx.subCtx.currentMode = fieldMode
			ctx.subCtx.fieldIsTrueOrFalse = false
		default:
			// After the op mode, the next mode should be value mode
			ctx.subCtx.currentMode = valueMode
		}
	case valueMode:
		if ctx.subCtx.oneLayerMode {
			// One layer mode means that we should return as soon as this value is done so we can merge
			ctx.currentTokenIndex = ctx.currentTokenIndex - 1
			return NonErrorOneLayerDone
		} else {
			// After the value is finished, this subcompletion becomes a "field", so the next mode should be
			// a op
			ctx.subCtx.currentMode = chainMode
		}

		ctx.subCtx.opTokenContext.clear()
	case chainMode:
		ctx.subCtx.currentMode = fieldMode
		ctx.subCtx.fieldIsTrueOrFalse = false
	default:
		return fmt.Errorf("Not implemented yet for mode transition %v", ctx.subCtx.currentMode)
	}
	return nil
}

func (ctx *expressionParserContext) handleParenPrefix(paren string) error {
	// Strip the "(" or ")" from this token and into its own element
	ctx.tokens = append(ctx.tokens, "")
	ctx.tokens[ctx.currentTokenIndex] = strings.TrimPrefix(ctx.tokens[ctx.currentTokenIndex], paren)
	copy(ctx.tokens[ctx.currentTokenIndex+1:], ctx.tokens[ctx.currentTokenIndex:])
	ctx.tokens[ctx.currentTokenIndex] = paren
	return nil
}

func (ctx *expressionParserContext) handleParenSuffix(paren string) error {
	// Strip the paren from the end of this token and insert into its own element
	for strings.HasSuffix(ctx.tokens[ctx.currentTokenIndex], paren) {
		ctx.tokens = append(ctx.tokens, "")
		copy(ctx.tokens[ctx.currentTokenIndex+1:], ctx.tokens[ctx.currentTokenIndex:])
		ctx.tokens[ctx.currentTokenIndex] = strings.TrimSuffix(ctx.tokens[ctx.currentTokenIndex], paren)
		ctx.tokens[ctx.currentTokenIndex+1] = paren
	}
	return nil
}

func (ctx *expressionParserContext) handleCloseParenBookKeeping() error {
	if ctx.parenDepth == 0 {
		return ErrorParenMismatch
	}
	ctx.parenDepth--

	// If a close parenthesis is found and there was no op in this latest () and it's not (true) or (false)
	if ctx.subCtx.lastOpIndex == -1 && !ctx.subCtx.fieldIsTrueOrFalse && ctx.subCtx.currentMode != fieldMode {
		return ErrorMalformedParenthesis
	}
	return nil
}

func (ctx *expressionParserContext) handleOpenParenBookKeeping() error {
	ctx.parenDepth++
	// for paren prefix, internally advance so the next getToken will not get a paren
	ctx.advTokenPositionOnly = true
	return ctx.advanceToken()
}

// Given a specific op token, set the opTokenContext to the type of op it is
func (ctx *expressionParserContext) checkAndMarkDetailedOpToken(token string) {
	if tokenIsChainOpType(token) && ctx.subCtx.lastSubFieldNode != -1 {
		// Only set chain op if there is something previously to chain
		ctx.subCtx.opTokenContext = chainOp
	} else if tokenIsCompareOpType(token) {
		ctx.subCtx.opTokenContext = compareOp
	} else if tokenIsLikeType(token) {
		ctx.subCtx.opTokenContext = matchOp
	} else if tokenIsOpOnlyType(token) {
		ctx.subCtx.opTokenContext = noFieldOp
	}
}

func (ctx *expressionParserContext) checkIfTokenIsPotentiallyOpType(token string) bool {
	if token == TokenOperatorNotLike[0] || token == TokenOperatorIsNull[0] || token == TokenOperatorIsNotNull[0] {
		ctx.multiwordMapOnce.Do(func() {
			ctx.multiwordHelperMap = make(map[string]*multiwordHelperPair)
			ctx.multiwordHelperMap[flattenToken(TokenOperatorNotLike)] = &multiwordHelperPair{
				actualMultiWords: TokenOperatorNotLike,
			}
			ctx.multiwordHelperMap[flattenToken(TokenOperatorIsNull)] = &multiwordHelperPair{
				actualMultiWords: TokenOperatorIsNull,
			}
			ctx.multiwordHelperMap[flattenToken(TokenOperatorIsNotNull)] = &multiwordHelperPair{
				actualMultiWords: TokenOperatorIsNotNull,
			}
			ctx.multiwordHelperMap[flattenToken(TokenOperatorIsMissing)] = &multiwordHelperPair{
				actualMultiWords: TokenOperatorIsMissing,
			}
		})
		for _, v := range ctx.multiwordHelperMap {
			v.valid = true
		}
		return true
	}
	return false
}

func (ctx *expressionParserContext) handleMultiTokens() (string, ParseTokenType, error) {
	var tokenOrig string = ctx.tokens[ctx.currentTokenIndex]
	numValids := len(ctx.multiwordHelperMap)

outerLoop:
	for i := 0; ctx.currentTokenIndex+i < len(ctx.tokens); i++ {
		token := ctx.tokens[ctx.currentTokenIndex+i]
		retry := true
		for retry {
			retry = false
			for fstr, pair := range ctx.multiwordHelperMap {
				if !pair.valid {
					continue
				}
				if i >= len(pair.actualMultiWords) || pair.actualMultiWords[i] != token {
					pair.valid = false
					numValids--
					retry = true
					break
				}
				if numValids == 0 {
					break outerLoop
				} else if numValids == 1 && i == len(pair.actualMultiWords)-1 && pair.actualMultiWords[i] == token {
					ctx.currentTokenIndex += i
					ctx.checkAndMarkDetailedOpToken(fstr)
					return fstr, TokenTypeOperator, nil
				}
			}
		}
	}

	return tokenOrig, TokenTypeInvalid, fmt.Errorf("Error: Invalid use of keyword for token: %s", tokenOrig)
}

func (ctx *expressionParserContext) getCurrentTokenParenHelper(token string) (string, ParseTokenType, error) {
	if token != "(" && strings.HasPrefix(token, "(") {
		ctx.handleParenPrefix("(")
		return ctx.getCurrentToken()
	} else if token != "(" && strings.HasSuffix(token, "(") {
		ctx.handleParenSuffix("(")
		return ctx.getCurrentToken()
	} else if token != ")" && strings.HasSuffix(token, ")") {
		ctx.handleParenSuffix(")")
		return ctx.getCurrentToken()
	} else if token != ")" && strings.HasPrefix(token, ")") {
		ctx.handleParenPrefix(")")
		token = ctx.tokens[ctx.currentTokenIndex]
		return token, TokenTypeEndParen, ctx.handleCloseParenBookKeeping()
	} else if token == ")" {
		return token, TokenTypeEndParen, ctx.handleCloseParenBookKeeping()
	} else if token == "(" {
		return token, TokenTypeParen, ctx.handleOpenParenBookKeeping()
	} else if found := ctx.checkPotentialSeparation(token); found {
		return ctx.getAndSeparateToken()
	}

	return token, TokenTypeInvalid, ErrorMalformedParenthesis
}

func (ctx *expressionParserContext) getTokenValueSubtype() ParseTokenType {
	if ctx.subCtx.opTokenContext.isLikeOp() {
		return TokenTypeRegex
	} else {
		return TokenTypeValue
	}
}

func (ctx *expressionParserContext) getValueTokenHelper(delim string) (string, ParseTokenType, error) {
	token := ctx.tokens[ctx.currentTokenIndex]

	// For value, strip the double quotes
	token = strings.TrimPrefix(token, delim)
	token = strings.TrimSuffix(token, delim)

	if ctx.getTokenValueSubtype() != TokenTypeValue {
		_, err := regexp.Compile(token)
		if err != nil {
			if tokenIsPcreValueType(token) {
				return token, TokenTypePcre, nil
			}
			return token, TokenTypeRegex, err
		}
	}

	return token, ctx.getTokenValueSubtype(), nil
}

// Also does some internal ctx set
func (ctx *expressionParserContext) getTrueFalseValue(token string) (string, ParseTokenType, error) {
	if token == "true" {
		ctx.subCtx.fieldIsTrueOrFalse = true
		return token, TokenTypeTrue, nil
	} else if token == "false" {
		ctx.subCtx.fieldIsTrueOrFalse = true
		return token, TokenTypeFalse, nil
	} else {
		return token, TokenTypeInvalid, ErrorInvalidFuncArgs
	}
}

func (ctx *expressionParserContext) getCurrentToken() (string, ParseTokenType, error) {
	if ctx.currentTokenIndex >= len(ctx.tokens) {
		return "", TokenTypeInvalid, ErrorNoMoreTokens
	}

	token := ctx.tokens[ctx.currentTokenIndex]
	if ctx.checkIfTokenIsPotentiallyOpType(token) {
		return ctx.handleMultiTokens()
	} else if tokenIsOpType(token) {
		token = replaceOpTokenIfNecessary(token)
		ctx.checkAndMarkDetailedOpToken(token)
		return token, TokenTypeOperator, nil
	} else if delim, ok := valueCheck(token).(string); ok && ctx.subCtx.currentMode == valueMode {
		return ctx.getValueTokenHelper(delim)
	} else if isNum, ok := valueCheck(token).(bool); ok && isNum {
		return token, ctx.getTokenValueSubtype(), nil
	} else if token == "true" || token == "false" {
		return ctx.getTrueFalseValue(token)
	} else if isFunc, key := ctx.tokenIsBuiltInFuncType(token); isFunc {
		return ctx.getFuncFieldTokenHelper(token, key)
	} else if strings.Contains(token, "(") || strings.Contains(token, ")") {
		return ctx.getCurrentTokenParenHelper(token)
	} else if delim, unfinished := tokenIsUnfinishedValueType(token); ctx.subCtx.currentMode == valueMode && unfinished {
		return ctx.getUnfinishedValueHelper(delim)
	} else if found := ctx.checkPotentialSeparation(token); found {
		return ctx.getAndSeparateToken()
	} else {
		return ctx.getTokenFieldTokenHelper()
	}
}

func tokenIsUnfinishedValueType(token string) (string, bool) {
	if strings.HasPrefix(token, `"`) && !strings.HasSuffix(token, `"`) {
		return `"`, true
	} else if strings.HasPrefix(token, "'") && !strings.HasSuffix(token, "'") {
		return `'`, true
	}
	return "", false
}

func (ctx *expressionParserContext) getUnfinishedValueHelper(delim string) (string, ParseTokenType, error) {
	outputToken := strings.TrimPrefix(ctx.tokens[ctx.currentTokenIndex], delim)
	tokensLen := len(ctx.tokens)
	for ctx.currentTokenIndex++; ctx.currentTokenIndex < tokensLen; ctx.currentTokenIndex++ {
		var breakout bool
		token := ctx.tokens[ctx.currentTokenIndex]
		if ctx.parenDepth > 0 && strings.HasSuffix(token, ")") {
			ctx.handleParenSuffix(")")
			tokensLen = len(ctx.tokens)
			token = ctx.tokens[ctx.currentTokenIndex]
		}
		if strings.HasSuffix(token, delim) {
			breakout = true
			token = strings.TrimSuffix(token, delim)
		}
		outputToken = fmt.Sprintf("%s %s", outputToken, token)

		if breakout {
			break
		}
	}

	if ctx.currentTokenIndex == tokensLen {
		return "", TokenTypeInvalid, ErrorMissingQuote
	}

	return outputToken, ctx.getTokenValueSubtype(), nil
}

func (ctx *expressionParserContext) NewFuncHelper() *funcOutputHelper {
	helper := &funcOutputHelper{
		args: make([][]interface{}, 1),
		recursiveKeyFunc: func(token string) (bool, string) {
			return ctx.tokenIsBuiltInFuncType(token)
		},
		builtInFuncRegex: ctx.builtInFuncRegex,
	}
	return helper
}

func (ctx *expressionParserContext) getFuncFieldTokenHelper(token, funcKey string) (string, ParseTokenType, error) {
	if ctx.subCtx.currentMode == fieldMode || ctx.subCtx.currentMode == valueMode {
		helper := ctx.NewFuncHelper()
		ctx.subCtx.funcHelperCtx = helper
		defer helper.resetLevel()
		return token, TokenTypeFunc, helper.resolveRecursiveFuncs(token, funcKey)
	} else {
		return token, TokenTypeFunc, fmt.Errorf("Error: %v mode is invalid for functions", ctx.subCtx.currentMode.String())
	}
}

// Checks the syntax of field - i.e. paths, array syntax, etc
func (ctx *expressionParserContext) getTokenFieldTokenHelper() (string, ParseTokenType, error) {
	var err error

	token := ctx.tokens[ctx.currentTokenIndex]

	// Field name cannot start or end with a period
	invalidPeriodPosRegex := regexp.MustCompile(`(^\.)|(\.$)`)
	if invalidPeriodPosRegex.MatchString(token) {
		err = fmt.Errorf("Invalid field: %v - cannot start or end with a period", token)
	}

	if err != nil {
		return token, TokenTypeField, err
	}

	ctx.lastFieldTokens = make([]string, 0)

	token, err = checkAndParseField(ctx.tokens, &ctx.currentTokenIndex, &ctx.lastFieldTokens)
	return token, TokenTypeField, err
}

func checkAndParseField(tokens []string, i *int, subTokens *[]string) (string, error) {
	var mode checkFieldMode
	var nextMode checkFieldMode
	var skipAppend bool
	var unfinishedField []string
	var done bool = false
	var outputToken string

	token := tokens[*i]

	if len(token) == 0 {
		return outputToken, ErrorEmptyToken
	}

	for !done {
		var pos int
		var beginPos int
		for ; pos < len(token); pos++ {
			switch mode {
			case cfmNone:
				switch string(token[pos]) {
				case fieldSeparator:
					if !skipAppend {
						*subTokens = append(*subTokens, string(token[beginPos:pos]))
						outputToken = fmt.Sprintf("%s %s", outputToken, string(token[beginPos:pos]))
					} else {
						skipAppend = false
					}
					beginPos = pos + 1
				case fieldLiteral:
					mode = cfmBacktick
					beginPos = pos + 1
					nextMode = cfmNone
				case fieldNestedStart:
					if !skipAppend {
						*subTokens = append(*subTokens, string(token[beginPos:pos]))
						outputToken = fmt.Sprintf("%s %s", outputToken, string(token[beginPos:pos]))
					} else {
						skipAppend = false
					}
					beginPos = pos
					mode = cfmNestedNumeric
				}
			case cfmBacktick:
				// Keep going until we find another literal seperator
				switch string(token[pos]) {
				case fieldLiteral:
					if beginPos == pos {
						return outputToken, ErrorEmptyLiteral
					}
					if len(unfinishedField) > 0 {
						unfinishedField = append(unfinishedField, string(token[beginPos:pos]))
						*subTokens = append(*subTokens, strings.Join(unfinishedField, " "))
						outputToken = fmt.Sprintf("%s %s", outputToken, strings.Join(unfinishedField, " "))
						unfinishedField = make([]string, 0)
					} else {
						*subTokens = append(*subTokens, string(token[beginPos:pos]))
						outputToken = fmt.Sprintf("%s %s", outputToken, string(token[beginPos:pos]))
					}
					mode = nextMode
					if pos != len(token)-1 && (string(token[pos+1]) == fieldSeparator || string(token[pos+1]) == fieldNestedStart) || pos == len(token)-1 {
						skipAppend = true
					}
				}
			case cfmNestedNumeric:
				if pos == beginPos {
					continue
				}
				if pos == beginPos+1 && string(token[pos]) == "0" {
					return outputToken, ErrorLeadingZeroes
				} else if !fieldTokenInt.MatchString(string(token[pos])) && string(token[pos]) != fieldNestedEnd {
					return outputToken, ErrorAllInts
				}
				switch string(token[pos]) {
				case fieldNestedEnd:
					// If nothing was entered between the brackets
					if pos == beginPos+1 {
						return outputToken, ErrorEmptyNest
					}

					// Advance mode to the next, and skip appending if this is the last or is followed by another nest
					mode = cfmNone
					if !skipAppend {
						*subTokens = append(*subTokens, token[beginPos:pos+1])
						outputToken = fmt.Sprintf("%s %s", outputToken, string(token[beginPos:pos+1]))
					} else {
						skipAppend = false
					}
					if pos == len(token)-1 || (pos < len(token)-1 && string(token[pos+1]) == fieldNestedStart) {
						skipAppend = true
					}
				case fieldSeparator:
					fallthrough
				case fieldLiteral:
					// For now, bracket can be used only for array indexing
					return outputToken, ErrorAllInts
				}
			}
		}

		// Catch any outstanding mismatched backticks or anything else
		switch mode {
		case cfmNone:
			if !skipAppend {
				// Capture the last string, whatever it is
				*subTokens = append(*subTokens, string(token[beginPos:pos]))
				outputToken = fmt.Sprintf("%s %s", outputToken, string(token[beginPos:pos]))
			}
			done = true
		case cfmNestedNumeric:
			return outputToken, ErrorMissingBacktickBracket
		case cfmBacktick:
			// We haven't found the end backtick in this token, go through the next token
			unfinishedField = append(unfinishedField, string(token[beginPos:pos]))
			*i = *i + 1
			if *i >= len(tokens) {
				return outputToken, ErrorMissingBacktickBracket
			}
			token = tokens[*i]
		}
	} // !done

	return outputToken, nil
}

func (ctx *expressionParserContext) getErrorNeedToStartNewCtx() error {
	return ErrorNeedToStartNewCtx
}

func (ctx *expressionParserContext) getErrorNeedToStartOneNewCtx() error {
	if ctx.shortCircuitEnabled {
		// If short circuit is enabled, no need to return after one context.
		// Having recursively starting new context will make it such that the left-most
		// expression stays at the higher levels to be evaluated first
		return ErrorNeedToStartNewCtx
	} else {
		return ErrorNeedToStartOneNewCtx
	}
}

func (ctx *expressionParserContext) checkTokenTypeWithinContext(tokenType ParseTokenType, token string) error {
	switch ctx.subCtx.currentMode {
	case opMode:
		// opMode is pretty much a less restrictive chainMode
		fallthrough
	case chainMode:
		if tokenType == TokenTypeEndParen {
			// For end parenthesis, do not advance the context
			ctx.advTokenPositionOnly = true
			return NonErrorOneLayerDone
		} else if !tokenType.isOpType() {
			return fmt.Errorf("Error: For operator/chain mode, token must be operator type - received %v(%v)", token, tokenType.String())
		} else if ctx.subCtx.currentMode != opMode && !ctx.subCtx.opTokenContext.isChainOp() {
			// This is specific for chain mode only
			return fmt.Errorf("Error: For chain mode, token must be chain type - received %v(%v)", token, tokenType.String())
		}
	case fieldMode:
		// fieldMode is a more restrictive valueMode
		if tokenType == TokenTypeParen {
			return ctx.getErrorNeedToStartNewCtx()
		} else if !tokenType.isFieldType() && !tokenType.isBoolType() {
			return fmt.Errorf("Error: For field mode, expecting a field type. Received: %v(%v)", token, tokenType)
		}
		fallthrough
	case valueMode:
		if tokenType.isFieldType() && ctx.subCtx.opTokenContext.isChainOp() {
			return ctx.getErrorNeedToStartOneNewCtx()
		} else if tokenType.isBoolType() {
			if ctx.subCtx.opTokenContext.isCompareOp() || ctx.subCtx.opTokenContext.isLikeOp() {
				return fmt.Errorf("Error: Unable to do comparison operator on true or false values")
			}
		} else if !tokenType.isValueType() && !tokenType.isFieldType() {
			return fmt.Errorf("Error: For value mode, token must be value type - received %v(%v)", token, tokenType.String())
		}
	default:
		return fmt.Errorf("Error: Not implemented for tokenType: %v(%v)", token, tokenType.String())
	}

	return nil
}

func (ctx *expressionParserContext) insertNode(newNode ParserTreeNode) error {
	ctx.parserDataNodes = append(ctx.parserDataNodes, newNode)
	ctx.subCtx.lastParserDataNode = len(ctx.parserDataNodes) - 1

	// binTree representation
	newBinTreeNode := &binParserTreeNode{
		tokenType: newNode.tokenType,
	}
	newBinTreeNode.ParentIdx = -1
	newBinTreeNode.Left = -1
	newBinTreeNode.Right = -1

	ctx.parserTree.data = append(ctx.parserTree.data, *newBinTreeNode)
	ctx.subCtx.lastBinTreeDataNode = ctx.parserTree.NumNodes() - 1

	switch ctx.subCtx.currentMode {
	case fieldMode:
		// FieldMode - nothing to do just record this as the last field
		ctx.subCtx.lastFieldIndex = ctx.subCtx.lastBinTreeDataNode
		ctx.subCtx.lastSubFieldNode = ctx.subCtx.lastBinTreeDataNode
		// Store the corresponding path vaiables
		ctx.fieldTokenPaths[ctx.subCtx.lastBinTreeDataNode] = DeepCopyStringArray(ctx.lastFieldTokens)

		if ctx.subCtx.funcHelperCtx != nil {
			ctx.funcOutputContext[ctx.subCtx.lastFieldIndex] = ctx.subCtx.funcHelperCtx
		}
	case chainMode:
		fallthrough
	case opMode:
		ctx.subCtx.lastOpIndex = ctx.subCtx.lastBinTreeDataNode
		thisOpNode := &ctx.parserTree.data[ctx.subCtx.lastOpIndex]
		thisOpNode.Left = ctx.subCtx.lastSubFieldNode
		// OpMode means this node becomes the field mode's parent
		lastFieldNode := &ctx.parserTree.data[ctx.subCtx.lastSubFieldNode]
		lastFieldNode.ParentIdx = ctx.subCtx.lastOpIndex
		// If head hasnt' been set, this becomes the tree head
		if ctx.treeHeadIndex == -1 {
			ctx.treeHeadIndex = ctx.subCtx.lastOpIndex
		}
		ctx.subCtx.lastSubFieldNode = ctx.subCtx.lastOpIndex
	case valueMode:
		ctx.subCtx.lastValueIndex = ctx.subCtx.lastBinTreeDataNode
		// Value mode means that the op's right is the value
		thisValueNode := &ctx.parserTree.data[ctx.subCtx.lastValueIndex]
		thisValueNode.ParentIdx = ctx.subCtx.lastOpIndex

		lastOpNode := &ctx.parserTree.data[ctx.subCtx.lastOpIndex]
		lastOpNode.Right = ctx.subCtx.lastValueIndex

		// Now that we have completed a sub-expression, the "op" becomes the parent of the last completed nodes
		ctx.subCtx.lastSubFieldNode = ctx.subCtx.lastOpIndex

		if ctx.subCtx.funcHelperCtx != nil {
			ctx.funcOutputContext[ctx.subCtx.lastValueIndex] = ctx.subCtx.funcHelperCtx
		}
	default:
		// OK to leak the node created above because we should be erroring out anyway
		return fmt.Errorf("Unsure how to insert into tree: %v", newNode)
	}

	return nil
}

// Given two sub contexts, one in the ctx, and the older one, merge them
func (ctx *expressionParserContext) mergeAndRestoreSubContexts(olderSubCtx *parserSubContext) error {
	// If older subctx is not used, don't merge (nor restore orig context)
	// - this means user entered an expression that started with a open paren
	if olderSubCtx.isUnused() {
		return nil
	}

	// If user enters a true/false and enclosed it in paren, don't merge
	if !ctx.subCtx.oneLayerMode && olderSubCtx.fieldIsTrueOrFalse {
		return nil
	}

	// Boundary check
	if olderSubCtx.lastOpIndex >= len(ctx.parserTree.data) {
		return ErrorNotFound
	}
	if ctx.subCtx.lastOpIndex >= len(ctx.parserTree.data) {
		return ErrorNotFound
	}

	// Note that the subContext within *ctx is considered newer spawned
	lastOpNodeOfOlderSubCtx := &ctx.parserTree.data[olderSubCtx.lastOpIndex]
	lastOpNodeOfNewContext := &ctx.parserTree.data[ctx.subCtx.lastOpIndex]

	if lastOpNodeOfOlderSubCtx.Right != -1 {
		return fmt.Errorf("Merging sub-context should expect value to be unassigned, but currently assigned to: %v", lastOpNodeOfOlderSubCtx.Right)
	}
	lastOpNodeOfOlderSubCtx.Right = ctx.subCtx.lastOpIndex

	if lastOpNodeOfNewContext.ParentIdx != -1 {
		return fmt.Errorf("Merging sub-context should expect parent to be unassigned, but currently assigned to: %v", lastOpNodeOfNewContext.ParentIdx)
	}
	lastOpNodeOfNewContext.ParentIdx = olderSubCtx.lastOpIndex

	// When merging, figure out the actual head and update it - the op that no longer merges to a parent is to be the new head
	lastOpIndexNode := ctx.parserTree.data[olderSubCtx.lastOpIndex]
	if lastOpIndexNode.ParentIdx == -1 {
		ctx.treeHeadIndex = olderSubCtx.lastOpIndex
	}

	// Once merge is done - restore original context
	*(ctx.subCtx) = *(olderSubCtx)
	return nil
}

// Enable short circuit if expression is linked by only && or only ||
func (ctx *expressionParserContext) enableShortCircuitEvalIfPossible() {
	var operator string
	for i := 0; i < len(ctx.tokens); i++ {
		if ctx.tokens[i] == TokenOperatorOr || ctx.tokens[i] == TokenOperatorAnd {
			if len(operator) == 0 {
				ctx.shortCircuitEnabled = true
				operator = ctx.tokens[i]
			} else {
				if ctx.tokens[i] != operator {
					ctx.shortCircuitEnabled = false
					return
				}
			}
		}
	}
}

// Main high level portion of the parser
func (ctx *expressionParserContext) parse() error {
	var token string
	var tokenType ParseTokenType
	var err error

	for ; ; err = ctx.advanceToken() {
		if err != nil {
			break
		}

		token, tokenType, err = ctx.getCurrentToken()
		if err != nil {
			break
		}

		// Context mode should match the token
		err = ctx.checkTokenTypeWithinContext(tokenType, token)
		if err == nil {
			// Push the token into the correct location into the tree
			err = ctx.insertNode(NewParserTreeNode(tokenType, token))
			if err != nil {
				break
			}
		} else if needToSpawnNewContext(err) {
			// Save current subContext
			currentSubCtx := NewParserSubContext()
			*currentSubCtx = *ctx.subCtx

			if err == ErrorNeedToStartNewCtx {
				// Starting a new context means the new sub context continues until it ends or hits an end paren
				ctx.subCtx = NewParserSubContext()
			} else {
				// One Context means a specific set of (field -> op -> value) only, and then get back to merge
				ctx.subCtx = NewParserSubContextOneLayer()
			}

			// Recursively fill in the necessary information in the newer subcontext
			err = ctx.parse()
			if err != nil && err != NonErrorOneLayerDone {
				break
			}

			err = ctx.mergeAndRestoreSubContexts(currentSubCtx)
			if err != nil {
				break
			}
		} else {
			break
		}

	}
	if err == ErrorNoMoreTokens {
		err = nil
		if ctx.parenDepth > 0 {
			err = ErrorParenMismatch
		}
	}
	return err
}

// Given a potentially unseparated token, and the current context mode, see if we
// can separate it just enough to get the supposed token
func (ctx *expressionParserContext) checkPotentialSeparation(token string) bool {
	ctx.subCtx.lastSeeker = NewOpSeeker(token)
	return ctx.subCtx.lastSeeker.Seek()
}

func (ctx *expressionParserContext) getAndSeparateToken() (string, ParseTokenType, error) {
	lastSeeker := ctx.subCtx.lastSeeker
	delim := lastSeeker.GetToken()
	token := ctx.tokens[ctx.currentTokenIndex]

	tokenSplitSlice := StringSplitFirstInst(token, delim)
	lenSlice := len(tokenSplitSlice)
	if lenSlice > 1 {
		numToInsert := lenSlice - 1
		ctx.tokens = append(ctx.tokens, make([]string, numToInsert)...)
		copy(ctx.tokens[ctx.currentTokenIndex+numToInsert:], ctx.tokens[ctx.currentTokenIndex:])
		for i := 0; i < lenSlice; i++ {
			ctx.tokens[ctx.currentTokenIndex+i] = tokenSplitSlice[i]
		}
	}
	return ctx.getCurrentToken()
}

// Output helpers - return the actual node with data (and optionally the index position of the sought after node)
func (ctx *expressionParserContext) getThisOutputNode(pos int) ParserTreeNode {
	if pos >= len(ctx.parserDataNodes) {
		return emptyParserTreeNode
	}
	return ctx.parserDataNodes[pos]
}

func (ctx *expressionParserContext) getLeftOutputNode(pos int) (ParserTreeNode, int) {
	if pos >= len(ctx.parserTree.data) {
		return emptyParserTreeNode, -1
	}
	thisNode := ctx.parserTree.data[pos]

	if thisNode.Left >= len(ctx.parserDataNodes) {
		return emptyParserTreeNode, -1
	}
	leftNode := ctx.parserDataNodes[thisNode.Left]
	return leftNode, thisNode.Left
}

func (ctx *expressionParserContext) getRightOutputNode(pos int) (ParserTreeNode, int) {
	if pos >= len(ctx.parserTree.data) || pos < 0 {
		return emptyParserTreeNode, -1
	}
	thisNode := ctx.parserTree.data[pos]

	if thisNode.Left >= len(ctx.parserDataNodes) || thisNode.Left < 0 {
		return emptyParserTreeNode, -1
	}

	if thisNode.Right >= len(ctx.parserDataNodes) || thisNode.Right < 0 {
		return emptyParserTreeNode, -2
	}

	rightNode := ctx.parserDataNodes[thisNode.Right]
	return rightNode, thisNode.Right
}

// Main function used during output to funnel to the right type of output method
func (ctx *expressionParserContext) outputNode(node ParserTreeNode, pos int) (Expression, error) {
	if node == emptyParserTreeNode || pos == -1 {
		return emptyExpression, fmt.Errorf("Error: Unable to parse internal tree data structure")
	}

	switch node.tokenType {
	case TokenTypeOperator:
		return ctx.outputOp(node, pos)
	case TokenTypeField:
		return ctx.outputField(pos)
	case TokenTypeTrue:
		return ctx.outputTrue()
	case TokenTypeFalse:
		return ctx.outputFalse()
	case TokenTypeValue:
		return ctx.outputValue(node)
	case TokenTypeRegex:
		return ctx.outputRegex(node)
	case TokenTypeFunc:
		return ctx.outputFunc(pos)
	case TokenTypePcre:
		return ctx.outputPcre(node)
	default:
		return emptyExpression, fmt.Errorf("Error: Invalid Node token type: %v", node.tokenType.String())
	}
}

func (ctx *expressionParserContext) outputTrue() (Expression, error) {
	return ValueExpr{true}, nil
}

func (ctx *expressionParserContext) outputFalse() (Expression, error) {
	return ValueExpr{false}, nil
}

func outputValueInternal(data interface{}) (Expression, error) {
	var outputData interface{} = data
	var err error
	if strData, ok := data.(string); ok && valueNumRegex.MatchString(strData) {
		if intNumRegex.MatchString(strData) {
			outputData, err = strconv.ParseInt(strData, 10, 64)
		} else {
			outputData, err = strconv.ParseFloat(strData, 64)
		}
	}
	return ValueExpr{outputData}, err

}

func (ctx *expressionParserContext) outputValue(node ParserTreeNode) (Expression, error) {
	return outputValueInternal(node.data)
}

func (ctx *expressionParserContext) outputRegex(node ParserTreeNode) (Expression, error) {
	return RegexExpr{node.data}, nil
}

func (ctx *expressionParserContext) outputPcre(node ParserTreeNode) (Expression, error) {
	return PcreExpr{node.data}, nil
}

func (ctx *expressionParserContext) outputField(pos int) (Expression, error) {
	var out FieldExpr
	path, ok := ctx.fieldTokenPaths[pos]
	if !ok {
		return out, ErrorFieldPathNotFound
	}

	out.Path = path
	return out, nil
}

func (ctx *expressionParserContext) outputFunc(pos int) (Expression, error) {
	var out FuncExpr

	helper, ok := ctx.funcOutputContext[pos]
	if !ok {
		return out, fmt.Errorf("Error: Unable to find internally stored function name for outputting")
	}

	curLevel := helper.lvlMarker

	if len(helper.args) <= curLevel || len(helper.args[curLevel]) == 0 {
		return out, ErrorMalformedFxInternals
	}

	if _, ok := helper.args[curLevel][0].(string); !ok {
		return out, ErrorMalformedFxInternals
	}

	out.FuncName = getOutputFuncName(helper.args[curLevel][0].(string))

	// For constants, just return a plain value to speed up the match execution
	if isConst, val := funcIsConstantType(out.FuncName); isConst && len(helper.args[curLevel]) == 1 {
		return outputValueInternal(val)
	}

	for i := 1; i < len(helper.args[curLevel]); i++ {
		if funcIdx, isFunc := helper.args[curLevel][i].(funcRecursiveIdx); isFunc {
			helper.lvlMarker = int(funcIdx)
			subFuncExpr, err := ctx.outputFunc(pos)
			if err != nil {
				return out, fmt.Errorf("Error: Unable to output subFx: %v", err)
			}
			out.Params = append(out.Params, subFuncExpr.(FuncExpr))
		} else if fieldTokens, isField := helper.args[curLevel][i].([]string); isField {
			var argField FieldExpr
			argField.Path = fieldTokens
			out.Params = append(out.Params, argField)
		} else if strArg, ok := helper.args[curLevel][i].(string); ok {
			// value
			valueExpr, err := outputValueInternal(strArg)
			if err != nil {
				return out, fmt.Errorf("Error: Unable to output value: %v", strArg)
			}
			out.Params = append(out.Params, valueExpr.(ValueExpr))
		} else {
			return out, fmt.Errorf("Error: Invalid internal func: %v", helper.args[curLevel][i])
		}
	}

	return out, nil
}

func (ctx *expressionParserContext) outputOp(node ParserTreeNode, pos int) (Expression, error) {
	nodeData, ok := (node.data).(string)
	if !ok || pos == -1 {
		return emptyExpression, fmt.Errorf("Unable to parse internal tree data structure")
	}

	switch nodeData {
	case TokenOperatorEqual:
		return ctx.outputEq(node, pos)
	case TokenOperatorNotEqual:
		return ctx.outputNotEq(node, pos)
	case TokenOperatorOr:
		return ctx.outputOr(node, pos)
	case TokenOperatorAnd:
		return ctx.outputAnd(node, pos)
	case TokenOperatorLessThan:
		return ctx.outputLessThan(node, pos)
	case TokenOperatorLessThanEq:
		return ctx.outputLessThanEq(node, pos)
	case TokenOperatorGreaterThan:
		return ctx.outputGreaterThan(node, pos)
	case TokenOperatorGreaterThanEq:
		return ctx.outputGreaterThanEq(node, pos)
	case TokenOperatorLike:
		return ctx.outputLike(node, pos)
	case flattenToken(TokenOperatorNotLike):
		return ctx.outputNotLike(node, pos)
	case TokenOperatorExists:
		return ctx.outputExists(node, pos)
	case flattenToken(TokenOperatorIsMissing):
		return ctx.outputIsMissing(node, pos)
	case flattenToken(TokenOperatorIsNull):
		return ctx.outputIsNull(node, pos)
	case flattenToken(TokenOperatorIsNotNull):
		return ctx.outputIsNotNull(node, pos)
	default:
		return emptyExpression, fmt.Errorf("Error: Invalid op type: %s", nodeData)
	}
}

func (ctx *expressionParserContext) getComparisonSubExprsNodes(node ParserTreeNode, pos int) (Expression, Expression, error) {
	leftNode, leftPos := ctx.getLeftOutputNode(pos)
	rightNode, rightPos := ctx.getRightOutputNode(pos)

	if leftPos < 0 || rightPos < 0 {
		return nil, nil, ErrorNotFound
	}

	leftSubExpr, err := ctx.outputNode(leftNode, leftPos)
	if err != nil {
		return nil, nil, err
	}

	rightSubExpr, err := ctx.outputNode(rightNode, rightPos)
	if err != nil {
		return nil, nil, err
	}

	return leftSubExpr, rightSubExpr, err
}

func (ctx *expressionParserContext) getSingleLeftSubExprsNodes(node ParserTreeNode, pos int) (Expression, error) {
	leftNode, leftPos := ctx.getLeftOutputNode(pos)

	leftSubExpr, err := ctx.outputNode(leftNode, leftPos)
	if err != nil {
		return nil, err
	}

	return leftSubExpr, err
}

func (ctx *expressionParserContext) outputEq(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return EqualsExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputNotEq(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return NotEqualsExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputLessThan(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return LessThanExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputLessThanEq(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return LessEqualsExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputGreaterThan(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return GreaterThanExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputGreaterThanEq(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return GreaterEqualsExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputLike(node ParserTreeNode, pos int) (Expression, error) {
	leftSubExpr, rightSubExpr, err := ctx.getComparisonSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return LikeExpr{
		leftSubExpr,
		rightSubExpr,
	}, nil
}

func (ctx *expressionParserContext) outputNotLike(node ParserTreeNode, pos int) (Expression, error) {
	matchExpr, err := ctx.outputLike(node, pos)
	if err != nil {
		return nil, err
	}

	return NotExpr{
		matchExpr,
	}, nil
}

func (ctx *expressionParserContext) outputExists(node ParserTreeNode, pos int) (Expression, error) {
	subExpr, err := ctx.getSingleLeftSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return ExistsExpr{
		subExpr,
	}, nil
}

func (ctx *expressionParserContext) outputIsMissing(node ParserTreeNode, pos int) (Expression, error) {
	subExpr, err := ctx.getSingleLeftSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return NotExistsExpr{
		subExpr,
	}, nil
}

func (ctx *expressionParserContext) outputIsNull(node ParserTreeNode, pos int) (Expression, error) {
	subExpr, err := ctx.getSingleLeftSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return EqualsExpr{
		subExpr,
		ValueExpr{nil},
	}, nil
}

func (ctx *expressionParserContext) outputIsNotNull(node ParserTreeNode, pos int) (Expression, error) {
	subExpr, err := ctx.getSingleLeftSubExprsNodes(node, pos)
	if err != nil {
		return nil, err
	}

	return NotEqualsExpr{
		subExpr,
		ValueExpr{nil},
	}, nil
}

func (ctx *expressionParserContext) outputAnd(node ParserTreeNode, pos int) (Expression, error) {
	var out AndExpr
	leftNode, leftPos := ctx.getLeftOutputNode(pos)
	rightNode, rightPos := ctx.getRightOutputNode(pos)

	leftSubExpr, err := ctx.outputNode(leftNode, leftPos)
	if err != nil {
		return out, err
	}

	rightSubExpr, err := ctx.outputNode(rightNode, rightPos)
	if err != nil {
		return out, err
	}

	out = append(out, leftSubExpr)
	out = append(out, rightSubExpr)

	return out, nil
}

func (ctx *expressionParserContext) outputOr(node ParserTreeNode, pos int) (Expression, error) {
	var out OrExpr
	leftNode, leftPos := ctx.getLeftOutputNode(pos)
	rightNode, rightPos := ctx.getRightOutputNode(pos)

	leftSubExpr, err := ctx.outputNode(leftNode, leftPos)
	if err != nil {
		return out, err
	}
	rightSubExpr, err := ctx.outputNode(rightNode, rightPos)
	if err != nil {
		return out, err
	}

	out = append(out, leftSubExpr)
	out = append(out, rightSubExpr)

	return out, nil
}

// Main output function to retrieve an Expression from the internal data of expressionParserContext
func (ctx *expressionParserContext) outputExpression() (Expression, error) {
	if ctx.parserTree.NumNodes() == 0 || ctx.treeHeadIndex == -1 {
		return emptyExpression, fmt.Errorf("Error: string expression has not been parsed into internal data structures")
	}

	node := ctx.getThisOutputNode(ctx.treeHeadIndex)
	if node == emptyParserTreeNode {
		return emptyExpression, fmt.Errorf("Error: Incorrectly parsed context")
	}

	if node.tokenType != TokenTypeOperator {
		return emptyExpression, fmt.Errorf("Error: Invalid op node type: %v", node.tokenType.String())
	}

	return ctx.outputOp(node, ctx.treeHeadIndex)
}

func (helper *funcOutputHelper) resetLevel() {
	helper.lvlMarker = 0
}

func (helper *funcOutputHelper) resolveRecursiveFuncs(token string, lastFunc string) error {
	regex, ok := helper.builtInFuncRegex[lastFunc]
	if !ok {
		return ErrorNotFound
	}

	// First set the function name
	helper.args[helper.lvlMarker] = append(helper.args[helper.lvlMarker], lastFunc)

	subMatches := regex.FindStringSubmatch(token)

	// Then given the arguments of the functions, populate them if there are any
	fxIdx := helper.lvlMarker
	for i := 1; i < len(subMatches); i++ {
		if isFunc, key := helper.recursiveKeyFunc(subMatches[i]); isFunc {
			nextFuncLvl := helper.makeNewFuncLevel()
			helper.resolveRecursiveFuncs(subMatches[1], key)
			helper.args[fxIdx] = append(helper.args[fxIdx], funcRecursiveIdx(nextFuncLvl))
		} else if delim, ok := valueCheck(subMatches[i]).(string); ok {
			valueString := strings.TrimPrefix(subMatches[i], delim)
			valueString = strings.TrimSuffix(valueString, delim)
			helper.args[fxIdx] = append(helper.args[fxIdx], valueString)
			if lastFunc == FuncDate && !validTimeChecker(valueString) {
				return ErrorInvalidTimeFormat
			}
		} else if isNumericValue, ok := valueCheck(subMatches[i]).(bool); ok && isNumericValue {
			helper.args[fxIdx] = append(helper.args[fxIdx], subMatches[i])
		} else {
			// Field
			var fieldTokens []string
			_, err := checkAndParseField(subMatches, &i, &fieldTokens)
			if err != nil {
				return err
			}
			helper.args[fxIdx] = append(helper.args[fxIdx], fieldTokens)
		}
	}

	return nil
}

func (helper *funcOutputHelper) makeNewFuncLevel() int {
	helper.lvlMarker = len(helper.args)
	helper.args = append(helper.args, make([]interface{}, 0))
	return helper.lvlMarker
}

// MAIN
func ParseSimpleExpression(strExpression string) (Expression, error) {
	ctx, err := NewExpressionParserCtx(strExpression)
	ctx.enableShortCircuitEvalIfPossible()
	err = ctx.parse()

	if err != nil {
		return emptyExpression, err
	}

	return ctx.outputExpression()
}