ast

Documentation

Index

• type Filter
  • func (fs *Filter) ToString() string
• type Function
  • func (fs *Function) ToString() string
• type Node
• type ParseError
  • func (pes *ParseError) ToString() string
• type Value
  • func (vs *Value) ToString() string

Types

type Filter

type Filter struct {
	Node
	F *Function
}

func (*Filter) ToString

func (fs *Filter) ToString() string

type Function

type Function struct {
	Node
	Name       token.Token
	Parameters []interface{}
}

func (*Function) ToString

func (fs *Function) ToString() string

type Node

type Node interface {
	ToString() string
}

Filter ::= Function Function ::= <IDENTIFIER> "(" Parameters ")" Parameters ::= Function |

<IDENTIFIER> |
<IDENTIFIER> "," ValueList

ParameterList :== Value |

Value "," ParameterList

Value ::= <STRING> | <INT> | <NUMBER>

PARSE RULES: - There are 2 types of functions (LOGICAL OPERATOR, FIELD OPERATORS) - They can be further subdivided into -- UNARY : Single Parameter -- BINARY : 2 Parameters

• They can have an optional final parameter, that would allow for passing extra conditions to be passed into the interpreted so as to allow for different types of processing

SYNTAX CHECKER - FUNCTIONS can be: -- LOGICAL UNARY not(eq(..,..)) -- LOGICAL BINARY and(eq(...), eq(...)) -- FIELD OPERATORS eq(...,...), neq, contains, gt, lt, gte, lte, etc

FUNCTION UNARY: example not - ACCEPTS one parameter of type function

type ParseError

type ParseError struct {
	Node
	Message string
}

func (*ParseError) ToString

func (pes *ParseError) ToString() string

type Value

type Value struct {
	Node
	V token.Token
}

func (*Value) ToString

func (vs *Value) ToString() string