acme/parser.go

package main

import (
	"errors"
	"fmt"
	"regexp"
	"strconv"
)

/*


stat	 	::= assign | if | for | funDecl | ret | funCall
statlist	::= stat [statlist]

if 			::= 'if' exp '{' [statlist] '}' [else '{' [statlist] '}']
for			::= 'for' [assign] ';' [explist] ';' [assign] '{' [statlist] '}'

type		::= 'int' | 'float' | 'bool'
typelist	::= type [',' typelist]
paramlist	::= var type [',' paramlist]
funDecl		::= 'fun' Name '(' [paramlist] ')' [typelist] '{' [statlist] '}'

ret			::= 'return' [explist]

assign 		::= varlist ‘=’ explist | postIncr | postDecr
postIncr	::= varDecl '++'
postDecr	::= varDecl '--'
varlist		::= varDecl [‘,’ varlist]
explist		::= exp [‘,’ explist]
exp 		::= Numeral | String | var | '(' exp ')' | exp binop exp | unop exp | funCall
funCall		::= Name '(' [explist] ')'
varDecl		::= [shadow] var
var 		::= Name
binop		::= '+' | '-' | '*' | '/' | '%' | '==' | '!=' | '<=' | '>=' | '<' | '>' | '&&' | '||'
unop		::= '-' | '!'


Operator priority (Descending priority!):

0:	'-', '!'
1: 	'*', '/', '%'
2: 	'+', '-'
3:	'==', '!=', '<=', '>=', '<', '>'
4:	'&&', '||'

*/

/////////////////////////////////////////////////////////////////////////////////////////////////
// CONST
/////////////////////////////////////////////////////////////////////////////////////////////////

const (
	TYPE_UNKNOWN = iota
	TYPE_INT
	TYPE_STRING
	TYPE_FLOAT
	TYPE_BOOL
	// TYPE_FUNCTION ?
	TYPE_ARRAY
	TYPE_STRUCT
	// This type will always be considered equal to any other type when compared!
	// Used for variadic functions.
	TYPE_WHATEVER
)
const (
	OP_PLUS = iota
	OP_MINUS
	OP_MULT
	OP_DIV
	OP_MOD

	OP_NEGATIVE
	OP_NOT

	OP_EQ
	OP_NE
	OP_LE
	OP_GE
	OP_LESS
	OP_GREATER

	OP_AND
	OP_OR

	OP_UNKNOWN
)

/////////////////////////////////////////////////////////////////////////////////////////////////
// INTERFACES
/////////////////////////////////////////////////////////////////////////////////////////////////

var (
	ErrCritical = errors.New("")
	ErrNormal   = errors.New("error - ")
)

type SymbolVarEntry struct {
	sType ComplexType
	// Refers to the name used in the final assembler
	varName string
	offset  int

	// In case the variable is indexing an array (see sType), we need this second underlaying type  as well!
	isIndexed bool
	//arrayType Type

	// ... more information
}

// This is needed when code for function calls is generated
// and we need to know how many and what kind of variables are
// pushed onto the stack or popped from afterwards.
type SymbolFunEntry struct {
	paramTypes               []ComplexType
	returnTypes              []ComplexType
	jumpLabel                string
	epilogueLabel            string
	returnStackPointerOffset int
	inline                   bool
	isUsed                   bool
}

type SymbolTypeEntry struct {
	members []StructMem
	offset  int
}

type SymbolTable struct {
	varTable  map[string]SymbolVarEntry
	funTable  map[string][]SymbolFunEntry
	typeTable map[string]SymbolTypeEntry
	// activeFunctionReturn references the function return types, if we are within a function, otherwise nil
	// This is required to check validity and code generation of return statements
	activeFunctionName   string
	activeFunctionParams []ComplexType
	activeFunctionReturn []ComplexType

	activeLoop              bool
	activeLoopBreakLabel    string
	activeLoopContinueLabel string

	parent *SymbolTable
}

type AST struct {
	block             Block
	globalSymbolTable *SymbolTable
}

type ComplexType struct {
	t Type
	// iff t is a struct, we need the qualified type name to query the symbol table!
	tName   string
	subType *ComplexType
}

type Type int
type Operator int

type Node interface {
	// Notes the start position in the actual source code!
	// (lineNr, columnNr)
	startPos() (int, int)
	generateCode(asm *ASM, s *SymbolTable)
}

//
// Interface types
//
type Statement interface {
	Node
	statement()
}
type Expression interface {
	Node
	expression()
	getExpressionTypes(s *SymbolTable) []ComplexType
	getResultCount() int
	isDirectlyAccessed() bool
	getDirectAccess() []DirectAccess
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// EXPRESSIONS
/////////////////////////////////////////////////////////////////////////////////////////////////
// This can either be an index access or a struct . access
type DirectAccess struct {
	indexed bool
	// If indexed, this is the index expression
	indexExpression Expression
	// If struct access by qualified name, this is the qualified name
	accessName string
	// If struct, we also need the offset within the struct!
	structOffset int
	line, column int
}

type Variable struct {
	vType        ComplexType
	vName        string
	vShadow      bool
	directAccess []DirectAccess
	line, column int
}
type Constant struct {
	cType        Type
	cValue       string
	line, column int
}
type Array struct {
	aType        ComplexType
	aCount       int
	aExpressions []Expression
	directAccess []DirectAccess
	line, column int
}
type BinaryOp struct {
	operator  Operator
	leftExpr  Expression
	rightExpr Expression
	opType    ComplexType
	// fixed means, that the whole binary operation is in '(' ')' and should not be combined differently
	// independent on operator priority!
	fixed        bool
	line, column int
}
type UnaryOp struct {
	operator     Operator
	expr         Expression
	opType       ComplexType
	line, column int
}
type FunCall struct {
	funName string
	// as struct creation and funCalls have the same syntax, we set this flag, weather we have a
	// function call or a struct creation. Analysis and code generation may differ.
	createStruct bool
	args         []Expression
	retTypes     []ComplexType
	directAccess []DirectAccess
	line, column int
}

func (_ Variable) expression() {}
func (_ Constant) expression() {}
func (_ Array) expression()    {}
func (_ BinaryOp) expression() {}
func (_ UnaryOp) expression()  {}
func (_ FunCall) expression()  {}
func (e Variable) startPos() (int, int) {
	return e.line, e.column
}
func (e Constant) startPos() (int, int) {
	return e.line, e.column
}
func (e Array) startPos() (int, int) {
	return e.line, e.column
}
func (e BinaryOp) startPos() (int, int) {
	return e.line, e.column
}
func (e UnaryOp) startPos() (int, int) {
	return e.line, e.column
}
func (e FunCall) startPos() (int, int) {
	return e.line, e.column
}

func getAccessedType(c ComplexType, access []DirectAccess, s *SymbolTable) ComplexType {
	for _, da := range access {
		if da.indexed {
			c = *c.subType
		} else {
			entry, _ := s.getType(c.tName)
			for _, m := range entry.members {
				if da.accessName == m.memName {
					c = m.memType
					break
				}
			}
		}
	}
	return c
}

func (e Constant) getExpressionTypes(s *SymbolTable) []ComplexType {
	return []ComplexType{ComplexType{e.cType, "", nil}}
}
func (e Array) getExpressionTypes(s *SymbolTable) []ComplexType {
	//	t := e.aType
	//	for _, da := range e.directAccess {
	//		// TODO: Else case with struct access!
	//		if da.indexed {
	//			t = *t.subType
	//		}
	//	}
	//	return []ComplexType{t}

	return []ComplexType{getAccessedType(e.aType, e.directAccess, s)}
}

func (e Variable) getExpressionTypes(s *SymbolTable) []ComplexType {
	//	t := e.vType
	//	for _, da := range e.directAccess {
	//		// TODO: Else case with struct access!
	//		if da.indexed {
	//			t = *t.subType
	//		}
	//	}

	return []ComplexType{getAccessedType(e.vType, e.directAccess, s)}
}
func (e UnaryOp) getExpressionTypes(s *SymbolTable) []ComplexType {
	return []ComplexType{e.opType}
}
func (e BinaryOp) getExpressionTypes(s *SymbolTable) []ComplexType {
	return []ComplexType{e.opType}
}
func (e FunCall) getExpressionTypes(s *SymbolTable) []ComplexType {

	if len(e.retTypes) != 1 {
		return e.retTypes
	}

	// Only an expression with exactly 1 result can be indexed!
	// So we return the simple result first and go down indexing types here.
	//	t := e.retTypes[0]
	//	for _, da := range e.directAccess {
	//		// TODO: Else case with struct access!
	//		if da.indexed {
	//			t = *t.subType
	//		}
	//	}
	//	return []ComplexType{t}

	return []ComplexType{getAccessedType(e.retTypes[0], e.directAccess, s)}
}

func (e Constant) getResultCount() int {
	return 1
}
func (e Array) getResultCount() int {
	return 1
}
func (e Variable) getResultCount() int {
	return 1
}
func (e UnaryOp) getResultCount() int {
	return 1
}
func (e BinaryOp) getResultCount() int {
	return 1
}
func (e FunCall) getResultCount() int {
	return len(e.retTypes)
}

func (e Constant) isDirectlyAccessed() bool {
	return false
}
func (e Array) isDirectlyAccessed() bool {
	return len(e.directAccess) > 0
}
func (e Variable) isDirectlyAccessed() bool {
	return len(e.directAccess) > 0
}
func (e UnaryOp) isDirectlyAccessed() bool {
	return false
}
func (e BinaryOp) isDirectlyAccessed() bool {
	return false
}
func (e FunCall) isDirectlyAccessed() bool {
	return len(e.directAccess) > 0
}

func (e Constant) getDirectAccess() []DirectAccess {
	return nil
}
func (e Array) getDirectAccess() []DirectAccess {
	return e.directAccess
}
func (e Variable) getDirectAccess() []DirectAccess {
	return e.directAccess
}
func (e UnaryOp) getDirectAccess() []DirectAccess {
	return nil
}
func (e BinaryOp) getDirectAccess() []DirectAccess {
	return nil
}
func (e FunCall) getDirectAccess() []DirectAccess {
	return e.directAccess
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// STATEMENTS
/////////////////////////////////////////////////////////////////////////////////////////////////
type StructMem struct {
	memName string
	offset  int
	memType ComplexType
}
type StructDef struct {
	name         string
	members      []StructMem
	line, column int
}

type Block struct {
	statements   []Statement
	symbolTable  *SymbolTable
	line, column int
}

type Assignment struct {
	variables    []Variable
	expressions  []Expression
	line, column int
}

type Condition struct {
	expression   Expression
	block        Block
	elseBlock    Block
	line, column int
}

type Case struct {
	// When comparing values, a nil expressions list means: 'default'
	// In a general switch, default is just 'true'
	expressions []Expression
	block       Block
}
type Switch struct {
	// nil for a general switch
	expression   Expression
	cases        []Case
	line, column int
}

type Loop struct {
	assignment     Assignment
	expressions    []Expression
	incrAssignment Assignment
	block          Block
	line, column   int
}

type RangedLoop struct {
	counter         Variable
	elem            Variable
	rangeExpression Expression
	block           Block
	line, column    int
}

type Function struct {
	fName        string
	parameters   []Variable
	returnTypes  []ComplexType
	block        Block
	line, column int
}

type Return struct {
	expressions  []Expression
	line, column int
}

type Break struct {
	line, column int
}
type Continue struct {
	line, column int
}

func (_ StructDef) statement()  {}
func (_ Block) statement()      {}
func (_ Assignment) statement() {}
func (_ Condition) statement()  {}
func (_ Switch) statement()     {}
func (_ Loop) statement()       {}
func (_ Function) statement()   {}
func (_ Return) statement()     {}
func (_ FunCall) statement()    {}
func (_ RangedLoop) statement() {}
func (_ Break) statement()      {}
func (_ Continue) statement()   {}

func (s StructDef) startPos() (int, int) {
	return s.line, s.column
}
func (s Block) startPos() (int, int) {
	return s.line, s.column
}
func (s Assignment) startPos() (int, int) {
	return s.line, s.column
}
func (s Condition) startPos() (int, int) {
	return s.line, s.column
}
func (s Switch) startPos() (int, int) {
	return s.line, s.column
}
func (s Loop) startPos() (int, int) {
	return s.line, s.column
}
func (s Function) startPos() (int, int) {
	return s.line, s.column
}
func (s Return) startPos() (int, int) {
	return s.line, s.column
}
func (s RangedLoop) startPos() (int, int) {
	return s.line, s.column
}
func (s Break) startPos() (int, int) {
	return s.line, s.column
}
func (s Continue) startPos() (int, int) {
	return s.line, s.column
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// AST, OPS STRING
/////////////////////////////////////////////////////////////////////////////////////////////////

func (ast AST) String() string {
	s := fmt.Sprintln("AST:")

	for _, st := range ast.block.statements {
		s += fmt.Sprintf("%v\n", st)
	}
	return s
}

func (o Operator) String() string {
	switch o {
	case OP_PLUS:
		return "+"
	case OP_MINUS:
		return "-"
	case OP_MULT:
		return "*"
	case OP_DIV:
		return "/"
	case OP_MOD:
		return "%"
	case OP_NEGATIVE:
		return "-"
	case OP_EQ:
		return "=="
	case OP_NE:
		return "!="
	case OP_LE:
		return "<="
	case OP_GE:
		return ">="
	case OP_LESS:
		return "<"
	case OP_GREATER:
		return ">"
	case OP_AND:
		return "&&"
	case OP_OR:
		return "||"
	case OP_NOT:
		return "!"
	case OP_UNKNOWN:
		return "?"
	}
	return "?"
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// EXPRESSION STRING
/////////////////////////////////////////////////////////////////////////////////////////////////

func (c ComplexType) String() string {

	switch c.t {
	case TYPE_ARRAY:
		return fmt.Sprintf("array[%v]", c.subType)
	case TYPE_STRUCT:
		return fmt.Sprintf("struct[%v]", c.tName)
	}

	return fmt.Sprintf("%v", c.t.String())
}

func (v Variable) String() string {
	if !v.isDirectlyAccessed() {
		shadowString := ""
		if v.vShadow {
			shadowString = "shadow "
		}
		return fmt.Sprintf("%v%v(%v)", shadowString, v.vType.t, v.vName)
	}
	return fmt.Sprintf("%v(%v[%v])", v.vType.subType, v.vName, v.directAccess)
}
func (c Constant) String() string {
	return fmt.Sprintf("%v(%v)", c.cType, c.cValue)
}
func (b BinaryOp) String() string {

	start, end := "", ""
	if b.fixed {
		start = "("
		end = ")"
	}
	return fmt.Sprintf("%v%v %v %v%v", start, b.leftExpr, b.operator, b.rightExpr, end)
}
func (u UnaryOp) String() string {
	return fmt.Sprintf("%v(%v)", u.operator, u.expr)
}

func (a Array) String() string {
	return fmt.Sprintf("[](%v, %v)", a.aType, a.aCount)
}

func (v Type) String() string {
	switch v {
	case TYPE_INT:
		return "int"
	case TYPE_STRING:
		return "string"
	case TYPE_FLOAT:
		return "float"
	case TYPE_BOOL:
		return "bool"
	case TYPE_ARRAY:
		return "array"
	case TYPE_STRUCT:
		return "struct"
	case TYPE_WHATEVER:
		return "anything"
	}
	return "?"
}

func stringToType(s string) Type {
	switch s {
	case "int":
		return TYPE_INT
	case "float":
		return TYPE_FLOAT
	case "bool":
		return TYPE_BOOL
	case "string":
		return TYPE_STRING
	case "array":
		return TYPE_ARRAY
	}
	return TYPE_UNKNOWN
}

func isTypeString(s string) bool {
	t := stringToType(s)
	return t == TYPE_INT ||
		t == TYPE_FLOAT ||
		t == TYPE_BOOL ||
		t == TYPE_ARRAY ||
		t == TYPE_STRING
}

func (s SymbolFunEntry) String() string {

	st := "SymbolFunEntry: ("

	st += fmt.Sprintf("params: [")
	for i, p := range s.paramTypes {
		st += p.String()
		if i < len(s.paramTypes)-1 {
			st += " "
		}
	}
	st += fmt.Sprintf("], returns: [")
	for i, p := range s.returnTypes {
		st += p.String()
		if i < len(s.returnTypes)-1 {
			st += " "
		}
	}
	st += "])"

	return st
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// STATEMENT STRING
/////////////////////////////////////////////////////////////////////////////////////////////////

func (a Assignment) String() (s string) {

	for i, v := range a.variables {
		s += fmt.Sprintf("%v", v)
		if i != len(a.variables)-1 {
			s += fmt.Sprintf(", ")
		}
	}
	s += fmt.Sprintf(" = ")

	for i, v := range a.expressions {
		s += fmt.Sprintf("%v", v)
		if i != len(a.expressions)-1 {
			s += ", "
		}
	}

	return
}

func (st StructDef) String() (s string) {
	s += "struct " + st.name + " {\n"

	for _, m := range st.members {
		s += fmt.Sprintf("    %v    %v\n", m.memName, m.memType)
	}

	s += "}"
	return
}

func (c Condition) String() (s string) {

	s += fmt.Sprintf("if %v {\n", c.expression)

	for _, st := range c.block.statements {
		s += fmt.Sprintf("\t%v\n", st)
	}

	s += "}"

	if c.elseBlock.statements != nil {
		s += " else {\n"
		for _, st := range c.elseBlock.statements {
			s += fmt.Sprintf("\t%v\n", st)
		}
		s += "}"
	}
	return
}
func (c Case) String() (s string) {
	s += "case "
	for i, e := range c.expressions {
		s += fmt.Sprintf("%v", e)
		if i != len(c.expressions)-1 {
			s += ", "
		}
	}
	s += ":\n"
	s += fmt.Sprintf("%v\n", c.block)
	return

}
func (sw Switch) String() (s string) {

	s = "switch "
	if sw.expression != nil {
		s += fmt.Sprintf("%v ", sw.expression)
	}
	s += "{\n"

	for _, c := range sw.cases {
		s += c.String()
	}

	s += "}"
	return
}

func (l Loop) String() (s string) {

	s += fmt.Sprintf("for %v; ", l.assignment)

	for i, e := range l.expressions {
		s += fmt.Sprintf("%v", e)
		if i != len(l.expressions)-1 {
			s += ", "
		}
	}

	s += fmt.Sprintf("; %v", l.incrAssignment)

	s += " {\n"

	for _, st := range l.block.statements {
		s += fmt.Sprintf("\t%v\n", st)
	}

	s += "}"
	return
}

func (l RangedLoop) String() (s string) {
	s += fmt.Sprintf("for %v, %v : %v {\n", l.counter, l.elem, l.rangeExpression)
	for _, st := range l.block.statements {
		s += fmt.Sprintf("\t%v\n", st)
	}
	s += "}"
	return
}

func (s Return) String() string {
	return fmt.Sprintf("return %v", s.expressions)
}

func (s Break) String() string {
	return "break"
}
func (s Continue) String() string {
	return "continue"
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// TOKEN CHANNEL
/////////////////////////////////////////////////////////////////////////////////////////////////

// Implements a channel with one cache/lookahead, that can be pushed back in (logically)
type TokenChannel struct {
	c      chan Token
	cached []Token
}

func (tc *TokenChannel) next() Token {

	if len(tc.cached) > 0 {
		t := tc.cached[len(tc.cached)-1]
		tc.cached = tc.cached[:len(tc.cached)-1]
		return t
	}

	v, ok := <-tc.c
	if !ok {
		panic("Error: Channel closed unexpectedly.")
	}
	return v
}

func (tc *TokenChannel) createToken(t TokenType, v string, line, column int) Token {
	return Token{t, v, line, column}
}

func (tc *TokenChannel) pushBack(t Token) {
	tc.cached = append(tc.cached, t)
}

/////////////////////////////////////////////////////////////////////////////////////////////////
// PARSER IMPLEMENTATION
/////////////////////////////////////////////////////////////////////////////////////////////////

// Sometimes, we are OK with non strict equality, i.e. if we only need an array and don't care about
// the actual type.
func equalType(c1, c2 ComplexType, strict bool) bool {
	if c1.t != TYPE_WHATEVER && c2.t != TYPE_WHATEVER && c1.t != c2.t {
		return false
	}
	if c1.tName != c2.tName {
		return false
	}
	if c1.subType != nil && c2.subType != nil {
		return equalType(*c1.subType, *c2.subType, strict)
	}
	return !strict || c1.subType == nil && c2.subType == nil
}
func equalTypes(l1, l2 []ComplexType, strict bool) bool {
	if len(l1) != len(l2) {
		return false
	}
	for i, c1 := range l1 {
		if !equalType(c1, l2[i], strict) {
			return false
		}
	}
	return true
}

func (c ComplexType) typeIsGeneric() bool {
	if c.t == TYPE_WHATEVER {
		return true
	}
	if c.subType == nil {
		return false
	}
	return c.subType.typeIsGeneric()
}

func (c ComplexType) getMemTypes(symbolTable *SymbolTable) []Type {

	if c.t == TYPE_STRUCT {
		types := make([]Type, 0)
		entry, _ := symbolTable.getType(c.tName)
		for _, m := range entry.members {
			types = append(types, m.memType.getMemTypes(symbolTable)...)
		}
		return types
	}

	return []Type{c.t}
}

func (c ComplexType) getMemCount(symbolTable *SymbolTable) int {
	return len(c.getMemTypes(symbolTable))
}

func typesToMemCount(ct []ComplexType, symbolTable *SymbolTable) (count int) {
	for _, t := range ct {
		count += t.getMemCount(symbolTable)
	}
	return
}

// Operator priority (Descending priority!):
// 0:	'-', '!'
// 1: 	'*', '/', '%'
// 2: 	'+', '-'
// 3:	'==', '!=', '<=', '>=', '<', '>'
// 4:	'&&'
// 5:	'||'
func (o Operator) priority() int {
	switch o {
	case OP_NEGATIVE, OP_NOT:
		return 0
	case OP_MULT, OP_DIV, OP_MOD:
		return 1
	case OP_PLUS, OP_MINUS:
		return 2
	case OP_EQ, OP_NE, OP_LE, OP_GE, OP_LESS, OP_GREATER:
		return 3
	case OP_AND:
		return 4
	case OP_OR:
		return 5
	default:
		fmt.Printf("Unknown operator: %v\n", o)
	}
	return 100
}

func getOperatorType(o string) Operator {
	switch o {
	case "+":
		return OP_PLUS
	case "-":
		return OP_MINUS
	case "*":
		return OP_MULT
	case "/":
		return OP_DIV
	case "%":
		return OP_MOD
	case "==":
		return OP_EQ
	case "!=":
		return OP_NE
	case "<=":
		return OP_LE
	case ">=":
		return OP_GE
	case "<":
		return OP_LESS
	case ">":
		return OP_GREATER
	case "&&":
		return OP_AND
	case "||":
		return OP_OR
	case "!":
		return OP_NOT

	}
	return OP_UNKNOWN
}

// expectType checks the next token against a given expected type and returns the token string
// with corresponding line and column numbers
func (tokens *TokenChannel) expectType(ttype TokenType) (string, int, int, bool) {
	t := tokens.next()
	//fmt.Println("  ", t)
	if t.tokenType != ttype {
		tokens.pushBack(t)
		return t.value, t.line, t.column, false
	}
	return t.value, t.line, t.column, true
}

// expect checks the next token against a given expected type and value and returns true, if the
// check was valid.
func (tokens *TokenChannel) expect(ttype TokenType, value string) (int, int, bool) {
	t := tokens.next()
	//fmt.Println("  ", t)
	if t.tokenType != ttype || t.value != value {
		tokens.pushBack(t)
		return t.line, t.column, false
	}
	return t.line, t.column, true
}

func parseDirectAccess(tokens *TokenChannel) (indexExpressions []DirectAccess, err error) {

	// If it comes to it, we parse infinite [] expressions :)
	for {
		// Parse indexed expressions ...[..]
		if row, col, ok := tokens.expect(TOKEN_SQUARE_OPEN, "["); ok {

			e, parseErr := parseExpression(tokens)
			if errors.Is(parseErr, ErrCritical) {
				err = parseErr
				return
			}

			if row, col, ok := tokens.expect(TOKEN_SQUARE_CLOSE, "]"); !ok {
				err = fmt.Errorf("%w[%v:%v] - Expected ']' after array index expression",
					ErrCritical, row, col,
				)
				return
			}

			indexExpressions = append(indexExpressions, DirectAccess{true, e, "", 0, row, col})
		} else {
			// Parse struct access with qualified name.
			if _, _, ok := tokens.expect(TOKEN_DOT, "."); ok {

				name, row, col, ok := tokens.expectType(TOKEN_IDENTIFIER)
				if !ok {
					err = fmt.Errorf("%w[%v:%v] - Expected struct member name after '.'",
						ErrCritical, row, col,
					)
					return
				}

				indexExpressions = append(indexExpressions, DirectAccess{false, nil, name, 0, row, col})
			} else {
				break
			}
		}
	}
	return
}

func parseVariable(tokens *TokenChannel) (variable Variable, err error) {

	severity := ErrNormal
	_, _, shadowing := tokens.expect(TOKEN_KEYWORD, "shadow")
	if shadowing {
		severity = ErrCritical
	}

	vName, startRow, startCol, ok := tokens.expectType(TOKEN_IDENTIFIER)
	if !ok {
		err = fmt.Errorf("%wExpected identifier for variable", severity)
		return
	}

	directAccess, parseErr := parseDirectAccess(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = parseErr
		return
	}
	variable.directAccess = directAccess

	variable.vType = ComplexType{TYPE_UNKNOWN, "", nil}
	variable.vName = vName
	variable.vShadow = shadowing
	variable.line = startRow
	variable.column = startCol
	return
}

func parseVarList(tokens *TokenChannel) (variables []Variable, err error) {
	lastRow, lastCol, ok := 0, 0, false
	i := 0
	for {
		v, parseErr := parseVariable(tokens)
		if errors.Is(parseErr, ErrCritical) {
			err = parseErr
			return
		}
		if parseErr != nil {

			// If we don't find any variable, thats fine. Just don't end in ',', thats an error!
			// We throw a normal error, so the parser up the chain can handle it how it likes.
			if i == 0 {
				err = fmt.Errorf("%wVariable list is empty or invalid", ErrNormal)
				return
			}
			err = fmt.Errorf("%w[%v:%v] - Variable list ends with ','", ErrCritical, lastRow, lastCol)
			variables = nil
			return
		}
		variables = append(variables, v)

		// Expect separating ','. Otherwise, all good, we are through!
		if lastRow, lastCol, ok = tokens.expect(TOKEN_SEPARATOR, ","); !ok {
			break
		}
		i += 1
	}
	return
}

func getConstType(c string) Type {
	rFloat := regexp.MustCompile(`^(-?\d+\.\d*)`)
	rInt := regexp.MustCompile(`^(-?\d+)`)
	rString := regexp.MustCompile(`^(".*")`)
	rBool := regexp.MustCompile(`^(true|false)`)
	cByte := []byte(c)

	if s := rFloat.FindIndex(cByte); s != nil {
		return TYPE_FLOAT
	}
	if s := rInt.FindIndex(cByte); s != nil {
		return TYPE_INT
	}
	if s := rString.FindIndex(cByte); s != nil {
		return TYPE_STRING
	}
	if s := rBool.FindIndex(cByte); s != nil {
		return TYPE_BOOL
	}
	return TYPE_UNKNOWN
}

func parseConstant(tokens *TokenChannel) (Constant, bool) {

	if v, row, col, ok := tokens.expectType(TOKEN_CONSTANT); ok {
		return Constant{getConstType(v), v, row, col}, true
	}
	return Constant{TYPE_UNKNOWN, "", 0, 0}, false
}

func parseFunCall(tokens *TokenChannel) (funCall FunCall, err error) {

	readKeyword := false

	v, startRow, startCol, ok := tokens.expectType(TOKEN_IDENTIFIER)
	if !ok {
		sv, row, col, ok := tokens.expectType(TOKEN_KEYWORD)
		if !ok {
			err = fmt.Errorf("%w - Invalid function call statement", ErrNormal)
			return
		}

		// We only consider type castings here!
		// In this case, this is just not a function call.
		if !isTypeString(sv) {
			err = fmt.Errorf("%w[%v:%v] - Function unknown", ErrNormal, row, col)
			tokens.pushBack(tokens.createToken(TOKEN_KEYWORD, sv, row, col))
			return
		}

		readKeyword = true
		v = sv
		startRow = row
		startCol = col
	}

	if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_OPEN, "("); !ok {
		// This could still be just an assignment, so just a normal error!
		err = fmt.Errorf("%w[%v:%v] - Expected '(' for function call parameters", ErrNormal, row, col)

		// LL(2)
		var t TokenType = TOKEN_IDENTIFIER
		if readKeyword {
			t = TOKEN_KEYWORD
		}
		tokens.pushBack(tokens.createToken(t, v, startRow, startCol))
		return
	}

	expressions, parseErr := parseExpressionList(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = parseErr
		return
	}

	if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_CLOSE, ")"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Function call expects ')' after parameter list", ErrCritical, row, col)
		return
	}

	funCall.funName = v
	funCall.args = expressions
	funCall.retTypes = []ComplexType{}
	funCall.line = startRow
	funCall.column = startCol

	return
}

func parseArrayExpression(tokens *TokenChannel) (array Array, err error) {

	startRow, startCol, ok := tokens.expect(TOKEN_SQUARE_OPEN, "[")
	if !ok {
		err = fmt.Errorf("%wExpected '['", ErrNormal)
		return
	}
	// .. = [](int, 5)
	if _, _, ok := tokens.expect(TOKEN_SQUARE_CLOSE, "]"); ok {

		if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_OPEN, "("); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected '(' after '[]'", ErrCritical, row, col)
			return
		}

		t, parseErr := parseType(tokens)
		if errors.Is(parseErr, ErrCritical) {
			err = parseErr
			return
		}

		if row, col, ok := tokens.expect(TOKEN_SEPARATOR, ","); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected ',' after array type", ErrCritical, row, col)
			return
		}

		c, ok := parseConstant(tokens)
		cValue, tmpE := strconv.ParseInt(c.cValue, 10, 64)
		if !ok || tmpE != nil || c.cType != TYPE_INT || cValue < 0 {
			err = fmt.Errorf("%w[%v:%v] - Invalid size for array literal. Must be a constant int >= 0", ErrCritical, c.line, c.column)
			return
		}

		if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_CLOSE, ")"); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected ')' after array declaration", ErrCritical, row, col)
			return
		}

		array.aType = ComplexType{TYPE_ARRAY, "", &t}
		array.aCount = int(cValue)
		array.aExpressions = []Expression{}
		array.line = startRow
		array.column = startCol
		return
	} else {
		// .. = [1,2,3,4,5]

		expressions, parseErr := parseExpressionList(tokens)
		if errors.Is(parseErr, ErrCritical) {
			err = parseErr
			return
		}

		if row, col, ok := tokens.expect(TOKEN_SQUARE_CLOSE, "]"); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected ']' after expression list in array declaration", ErrCritical, row, col)
			return
		}

		if len(expressions) == 0 {
			err = fmt.Errorf("%w[%v:%v] - Expression list in array declaration can not be empty", ErrCritical, startRow, startCol)
			return
		}

		array.aType = ComplexType{TYPE_UNKNOWN, "", nil}
		// This needs to be evaluated and counted up in analysis - One expression might have multiple values!
		array.aCount = 0
		array.aExpressions = expressions
		array.line = startRow
		array.column = startCol
		return
	}

}

//func parseStructExpr(tokens *TokenChannel) (st StructExpr, err error) {

//	name, startRow, startCol, ok := tokens.expectType(TOKEN_IDENTIFIER)
//	if !ok {
//		err = fmt.Errorf("%wExpected identifier for struct expression", ErrNormal)
//		return
//	}

//	if _, _, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
//		err = fmt.Errorf("%wExpected '{' after struct name", ErrNormal)
//		tokens.pushBack(tokens.createToken(TOKEN_IDENTIFIER, name, startRow, startCol))
//		return
//	}

//	expressions, parseErr := parseExpressionList(tokens)
//	if errors.Is(parseErr, ErrCritical) {
//		err = parseErr
//		return
//	}

//	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
//		err = fmt.Errorf("%w[%v:%v] - Expected '}' after struct expression", ErrCritical, row, col)
//		return
//	}

//	st.sType = ComplexType{TYPE_STRUCT, name, nil}
//	st.name = name
//	st.args = expressions
//	return
//}

// parseSimpleExpression just parses variables, constants and '('...')'
func parseSimpleExpression(tokens *TokenChannel) (expression Expression, err error) {

	// Parse function call before parsing for variables, as they are syntactically equal
	// until the '(' for a function call!
	tmpFunCall, parseErr := parseFunCall(tokens)
	switch {
	case parseErr == nil:
		expression = tmpFunCall
		return
	case errors.Is(parseErr, ErrCritical):
		err = parseErr
		return
	}

	//	tmpStructExpr, parseErr := parseStructExpr(tokens)
	//	switch {
	//	case parseErr == nil:
	//		expression = tmpStructExpr
	//		return
	//	case errors.Is(parseErr, ErrCritical):
	//		err = parseErr
	//		return
	//	}

	tmpV, parseErr := parseVariable(tokens)
	switch {
	case parseErr == nil:
		expression = tmpV
		return
	case errors.Is(parseErr, ErrCritical):
		err = parseErr
		return
	}

	tmpA, parseErr := parseArrayExpression(tokens)
	switch {
	case parseErr == nil:
		expression = tmpA
		return
	case errors.Is(parseErr, ErrCritical):
		err = parseErr
		return
	}

	if tmpC, ok := parseConstant(tokens); ok {
		expression = tmpC
		return
	}

	// Or a '(', then continue until ')'.
	if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_OPEN, "("); ok {
		e, parseErr := parseExpression(tokens)
		if parseErr != nil {
			err = fmt.Errorf("%w%v", ErrCritical, parseErr.Error())
			return
		}
		if tmpE, ok := e.(BinaryOp); ok {
			tmpE.fixed = true
			// We need to reassign the variable for the 'true' to hold instead of editing the local copy
			e = tmpE

		}
		expression = e

		// Expect TOKEN_PARENTHESIS_CLOSE
		row, col, ok = tokens.expect(TOKEN_PARENTHESIS_CLOSE, ")")
		if ok {
			return
		}

		err = fmt.Errorf("%w[%v:%v] - Expected ')'", ErrCritical, row, col)
		return
	}

	err = fmt.Errorf("%wInvalid simple expression", ErrNormal)
	return
}

func parseUnaryExpression(tokens *TokenChannel) (expression Expression, err error) {
	// Check for unary operator before the expression
	if row, col, ok := tokens.expect(TOKEN_OPERATOR, "-"); ok {
		e, parseErr := parseExpression(tokens)
		if parseErr != nil {
			err = fmt.Errorf("%w[%v:%v] - Invalid expression after unary '-'", ErrCritical, row, col)
			return
		}

		expression = UnaryOp{OP_NEGATIVE, e, ComplexType{TYPE_UNKNOWN, "", nil}, row, col}
		return
	}
	// Check for unary operator before the expression
	if row, col, ok := tokens.expect(TOKEN_OPERATOR, "!"); ok {
		e, parseErr := parseExpression(tokens)
		if parseErr != nil {
			err = fmt.Errorf("%w[%v:%v] - Invalid expression after unary '!'", ErrCritical, row, col)
			return
		}

		expression = UnaryOp{OP_NOT, e, ComplexType{TYPE_UNKNOWN, "", nil}, row, col}
		return
	}

	err = fmt.Errorf("%wInvalid unary expression", ErrNormal)
	return
}

func parseExpression(tokens *TokenChannel) (expression Expression, err error) {

	unaryExpression, parseErr := parseUnaryExpression(tokens)
	if parseErr == nil {
		expression = unaryExpression
	} else {
		simpleExpression, parseErr := parseSimpleExpression(tokens)
		if parseErr != nil {
			err = fmt.Errorf("%wSimple expression expected", parseErr)
			return
		}
		expression = simpleExpression
	}

	// Or an expression followed by a binop. Here we can continue just normally and just check
	// if token.next() == binop, and just then, throw the parsed expression into a binop one.
	if t, row, col, ok := tokens.expectType(TOKEN_OPERATOR); ok {

		// Create and return binary operation expression!
		rightHandExpr, parseErr := parseExpression(tokens)
		if parseErr != nil {
			err = fmt.Errorf("%w[%v:%v] - Invalid expression on right hand side of binary operation", ErrCritical, row, col)
			return
		}
		row, col = expression.startPos()
		finalExpression := BinaryOp{getOperatorType(t), expression, rightHandExpr, ComplexType{TYPE_UNKNOWN, "", nil}, false, row, col}
		expression = finalExpression
	}

	directAccess, parseErr := parseDirectAccess(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = parseErr
		return
	}

	if parseErr == nil && len(directAccess) > 0 {
		switch e := expression.(type) {
		case Variable:
			e.directAccess = directAccess
			expression = e
		case Array:
			e.directAccess = directAccess
			expression = e
		case FunCall:
			e.directAccess = directAccess
			expression = e
		default:
			row, col := expression.startPos()
			err = fmt.Errorf("%w[%v:%v] - Expression can not be indexed", ErrCritical, row, col)
			return
		}
	}

	// We just return the simpleExpression or unaryExpression and are happy
	return
}

func parseExpressionList(tokens *TokenChannel) (expressions []Expression, err error) {

	i := 0
	lastRow, lastCol, ok := 0, 0, false
	for {
		e, parseErr := parseExpression(tokens)
		if parseErr != nil {

			// If we don't find any expression, thats fine. Just don't end in ',', thats an error!
			if i == 0 {
				// We propagate the error from the parser. This might be normal or critical.
				err = fmt.Errorf("%w - Expression list is empty or invalid", parseErr)
				return
			}

			err = fmt.Errorf("%w[%v:%v] - Expression list ends in ','", ErrCritical, lastRow, lastCol)
			expressions = nil
			return
		}
		expressions = append(expressions, e)

		// Expect separating ','. Otherwise, all good, we are through!
		if lastRow, lastCol, ok = tokens.expect(TOKEN_SEPARATOR, ","); !ok {
			break
		}
		i += 1
	}
	return
}

// parseBlock parses a list of statements from the tokens.
func parseAssignment(tokens *TokenChannel) (assignment Assignment, err error) {

	// A list of variables!
	variables, parseErr := parseVarList(tokens)
	// No variables will return an ErrNormal. So all good, severity is handled up stream.
	if len(variables) == 0 {
		err = fmt.Errorf("%wExpected variable in assignment", parseErr)
		return
	}
	// This is most likely a critical error, like: a, = ...
	if parseErr != nil {
		err = fmt.Errorf("%w - Parsing the variable list for an assignment resulted in an error", parseErr)
		return
	}

	// Special case: i++ as an assignment i = i+1
	if len(variables) == 1 {
		o, row, col, ok := tokens.expectType(TOKEN_OPERATOR)
		if ok {
			assignment.variables = variables
			assignment.line = row
			assignment.column = col

			// Same one again!
			_, _, ok := tokens.expect(TOKEN_OPERATOR, o)
			if ok && (o == "+" || o == "-") {

				assignment.expressions = []Expression{
					BinaryOp{
						getOperatorType(o),
						variables[0],
						Constant{TYPE_INT, "1", row, col},
						ComplexType{TYPE_INT, "", nil},
						false,
						row, col,
					},
				}
				assignment.line = row
				assignment.column = col
				return
			}

			// Check, if we have the special case of: i += 2
			_, _, ok = tokens.expect(TOKEN_ASSIGNMENT, "=")
			if ok && (o == "+" || o == "-" || o == "*" || o == "/") {

				e, parseErr := parseExpression(tokens)
				if errors.Is(parseErr, ErrCritical) {
					err = parseErr
					return
				}

				assignment.expressions = []Expression{
					BinaryOp{getOperatorType(o), variables[0], e, ComplexType{TYPE_UNKNOWN, "", nil}, false, row, col},
				}
				return
			}

			// push the first operator token back
			tokens.pushBack(tokens.createToken(TOKEN_OPERATOR, o, row, col))
		}
	}

	// One TOKEN_ASSIGNMENT
	// If we got this far, we have a valid variable list. So from here on out, this _needs_ to be valid!
	// Right now, it can still be a function call!
	if row, col, ok := tokens.expect(TOKEN_ASSIGNMENT, "="); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '=' in assignment", ErrNormal, row, col)

		// LL(2)
		tokens.pushBack(tokens.createToken(TOKEN_IDENTIFIER, variables[0].vName, variables[0].line, variables[0].column))

		return
	}

	expressions, parseErr := parseExpressionList(tokens)
	// For now we also accept an empty expression list (ErrNormal). If this is valid or not, is handled in the
	// semanticAnalyzer.
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid expression list in assignment", parseErr)
		return
	}

	row, col := variables[0].startPos()
	assignment = Assignment{variables, expressions, row, col}
	return
}

// if ::= 'if' exp '{' [stat] '}' [else '{' [stat] '}']
func parseCondition(tokens *TokenChannel) (condition Condition, err error) {

	startRow, startCol, ok := 0, 0, false

	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "if"); !ok {
		err = fmt.Errorf("%wExpected 'if' keyword for condition", ErrNormal)
		return
	}

	expression, parseErr := parseExpression(tokens)
	if parseErr != nil {
		err = fmt.Errorf("%w%v - Expected expression after 'if' keyword", ErrCritical, parseErr.Error())
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '{' after condition", ErrCritical, row, col)
		return
	}

	statements, parseErr := parseBlock(tokens)
	if parseErr != nil {
		err = fmt.Errorf("%w - Invalid statement list in condition block", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '}' after condition block", ErrCritical, row, col)
		return
	}

	condition.expression = expression
	condition.block = statements

	// Just in case we have an else, handle it!
	if _, _, ok := tokens.expect(TOKEN_KEYWORD, "else"); ok {
		if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected '{' after 'else' in condition", ErrCritical, row, col)
			return
		}

		elseStatements, parseErr := parseBlock(tokens)
		if parseErr != nil {
			err = fmt.Errorf("%w - Invalid statement list in condition else block", parseErr)
			return
		}

		if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected '}' after 'else' block in condition", ErrCritical, row, col)
			return
		}

		condition.elseBlock = elseStatements
	}

	condition.line = startRow
	condition.column = startCol

	return
}

func parseCases(tokens *TokenChannel, valueSwitch bool) (cases []Case, err error) {

	var parseErr error

	for {

		var expressions []Expression
		var block Block

		// When comparing values, a nil expressions list means: 'default'
		// In a general switch, default is just 'true'

		if _, _, ok := tokens.expect(TOKEN_KEYWORD, "case"); !ok {

			if row, col, ok := tokens.expect(TOKEN_KEYWORD, "default"); ok {

				if row, col, ok := tokens.expect(TOKEN_COLON, ":"); !ok {
					err = fmt.Errorf("%w[%v:%v] - Expected ':' after default case", ErrCritical, row, col)
					return
				}

				if valueSwitch {
					expressions = nil
				} else {
					expressions = []Expression{Constant{TYPE_BOOL, "true", row, col}}
				}

				block, parseErr = parseBlock(tokens)
				if errors.Is(parseErr, ErrCritical) {
					err = parseErr
					return
				}
			} else {
				err = ErrNormal
				return
			}

		} else {

			expressions, parseErr = parseExpressionList(tokens)
			if errors.Is(parseErr, ErrCritical) {
				err = parseErr
				return
			}

			if row, col, ok := tokens.expect(TOKEN_COLON, ":"); !ok {
				err = fmt.Errorf("%w[%v:%v] - Expected ':' after case expressions", ErrCritical, row, col)
				return
			}
			block, parseErr = parseBlock(tokens)
			if errors.Is(parseErr, ErrCritical) {
				err = parseErr
				return
			}
		}

		cases = append(cases, Case{expressions, block})
	}

	return
}

func parseSwitch(tokens *TokenChannel) (switchCase Switch, err error) {

	startRow, startCol, ok := 0, 0, false
	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "switch"); !ok {
		err = fmt.Errorf("%wExpected 'switch' keyword", ErrNormal)
		return
	}

	e, parseErr := parseExpression(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = parseErr
		return
	}
	if parseErr != nil {
		e = nil
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '{'", ErrCritical, row, col)
		return
	}

	// Parse cases
	cases, parseErr := parseCases(tokens, e != nil)
	if errors.Is(parseErr, ErrCritical) {
		err = parseErr
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '}'", ErrCritical, row, col)
		return
	}

	switchCase.expression = e
	switchCase.cases = cases
	switchCase.line = startRow
	switchCase.column = startCol
	return
}

// parseRangedLoop is special in the case, that we have multiple statements that start with 'for id, id'.
// So we have to push multiple tokens back to the channel, if we fail before encountering the ':'.
// After that, we fail hard!
func parseRangedLoop(tokens *TokenChannel) (loop RangedLoop, err error) {

	startRow, startCol, ok := 0, 0, false
	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "for"); !ok {
		err = fmt.Errorf("%wExpected 'for' keyword for loop", ErrNormal)
		return
	}

	i, iRow, iCol, ok := tokens.expectType(TOKEN_IDENTIFIER)
	if !ok {
		tokens.pushBack(tokens.createToken(TOKEN_KEYWORD, "for", startRow, startCol))
		err = fmt.Errorf("%wExpected identifier", ErrNormal)
		return
	}

	sRow, sCol, ok := tokens.expect(TOKEN_SEPARATOR, ",")
	if !ok {
		tokens.pushBack(tokens.createToken(TOKEN_IDENTIFIER, i, iRow, iCol))
		tokens.pushBack(tokens.createToken(TOKEN_KEYWORD, "for", startRow, startCol))
		err = fmt.Errorf("%wExpected separator ','", ErrNormal)
		return
	}

	// After a ',' there must be an identifier, no matter what. Might as well fail here!
	e, eRow, eCol, ok := tokens.expectType(TOKEN_IDENTIFIER)
	if !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected identifier after ','", ErrCritical, eRow, eCol)
		return
	}

	// Last place where this might be a normal loop. Push everything back!
	if _, _, ok := tokens.expect(TOKEN_COLON, ":"); !ok {
		tokens.pushBack(tokens.createToken(TOKEN_IDENTIFIER, e, eRow, eCol))
		tokens.pushBack(tokens.createToken(TOKEN_SEPARATOR, ",", sRow, sCol))
		tokens.pushBack(tokens.createToken(TOKEN_IDENTIFIER, i, iRow, iCol))
		tokens.pushBack(tokens.createToken(TOKEN_KEYWORD, "for", startRow, startCol))
		err = fmt.Errorf("%wExpected colon ':'", ErrNormal)
		return
	}

	a, parseErr := parseExpression(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid expression in ranged loop", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '{' after loop header", ErrCritical, row, col)
		return
	}

	forBlock, parseErr := parseBlock(tokens)
	if parseErr != nil {
		err = fmt.Errorf("%w - Error while parsing loop block", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '}' after loop block", ErrCritical, row, col)
		return
	}

	loop.counter = Variable{ComplexType{TYPE_INT, "", nil}, i, false, nil, iRow, iCol}
	loop.elem = Variable{ComplexType{TYPE_UNKNOWN, "", nil}, e, false, nil, eRow, eCol}
	loop.rangeExpression = a
	loop.block = forBlock
	loop.line = startRow
	loop.column = startCol

	return
}

func parseLoop(tokens *TokenChannel) (res Statement, err error) {

	startRow, startCol, ok := 0, 0, false

	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "for"); !ok {
		err = fmt.Errorf("%wExpected 'for' keyword for loop", ErrNormal)
		return
	}

	// We don't care about a valid assignment. If there is none, we are fine too :)
	assignment, parseErr := parseAssignment(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid assignment in loop", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_SEMICOLON, ";"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected ';' after loop assignment", ErrCritical, row, col)
		return
	}

	expressions, parseErr := parseExpressionList(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid expression list in loop expression", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_SEMICOLON, ";"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected ';' after loop expression", ErrCritical, row, col)
		return
	}

	// We are also fine with no assignment!
	incrAssignment, parseErr := parseAssignment(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid increment assignment in loop", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '{' after loop header", ErrCritical, row, col)
		return
	}

	forBlock, parseErr := parseBlock(tokens)
	if parseErr != nil {
		err = fmt.Errorf("%w - Error while parsing loop block", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '}' after loop block", ErrCritical, row, col)
		return
	}

	var loop Loop
	loop.assignment = assignment
	loop.expressions = expressions
	loop.incrAssignment = incrAssignment
	loop.block = forBlock
	loop.line = startRow
	loop.column = startCol

	res = loop
	return
}

func parseType(tokens *TokenChannel) (t ComplexType, err error) {

	name := ""
	valid := false
	if keyword, _, _, ok := tokens.expectType(TOKEN_KEYWORD); ok {
		name = keyword
		valid = true
	} else {
		if id, _, _, ok := tokens.expectType(TOKEN_IDENTIFIER); ok {
			name = id
			valid = true
		}
	}

	if !valid {

		if row, col, ok := tokens.expect(TOKEN_SQUARE_OPEN, "["); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected a type or '['", ErrCritical, row, col)
			return
		}
		if row, col, ok := tokens.expect(TOKEN_SQUARE_CLOSE, "]"); !ok {
			err = fmt.Errorf("%w[%v:%v] - Expected ']'", ErrCritical, row, col)
			return
		}

		subType, parseErr := parseType(tokens)
		if parseErr != nil {
			err = parseErr
			return
		}

		t.t = TYPE_ARRAY
		t.subType = &subType

		return
	}

	tmpT := stringToType(name)
	if tmpT == TYPE_UNKNOWN {
		t.t = TYPE_STRUCT
		t.tName = name
	} else {
		t.t = tmpT
	}

	t.subType = nil
	return
}
func parseArgList(tokens *TokenChannel, expectSeparator bool) (variables []Variable, err error) {

	i := 0
	lastRow, lastCol, ok := 0, 0, false
	for {
		vName, row, col, vOK := tokens.expectType(TOKEN_IDENTIFIER)
		if !vOK {

			// If we don't find any variable, thats fine. Just don't end in ',', thats an error!
			if i == 0 {
				// We propagate the error from the parser. This might be normal or critical.
				err = fmt.Errorf("%wNot a variable", ErrNormal)
				return
			}

			// If we have a separator, it means, that we can only fail there. Failing here means, we
			// do have a trailing ','
			if expectSeparator {
				err = fmt.Errorf("%w[%v:%v] - Variable list ends in ','", ErrCritical, lastRow, lastCol)
				variables = nil
			}
			return
		}
		v := Variable{ComplexType{TYPE_UNKNOWN, "", nil}, vName, false, nil, row, col}

		t, parseErr := parseType(tokens)
		if parseErr != nil {
			err = parseErr
			return
		}

		v.vType = t

		// Function parameters are always shadowing!
		v.vShadow = true
		variables = append(variables, v)

		if expectSeparator {
			// Expect separating ','. Otherwise, all good, we are through!
			if lastRow, lastCol, ok = tokens.expect(TOKEN_SEPARATOR, ","); !ok {
				break
			}
		}
		i += 1
	}
	return
}

func parseTypeList(tokens *TokenChannel) (types []ComplexType, err error) {
	lastRow, lastCol, ok := 0, 0, false
	i := 0
	for {
		t, parseErr := parseType(tokens)

		if parseErr != nil {

			// If we don't find any type, thats fine. Just don't end in ',', thats an error!
			// We throw a normal error, so the parser up the chain can handle it how it likes.
			if i == 0 {
				err = fmt.Errorf("%wType list is empty or invalid", ErrNormal)
				return
			}
			err = fmt.Errorf("%w[%v:%v] - Type list ends with ','", ErrCritical, lastRow, lastCol)
			types = nil
			return
		}
		types = append(types, t)

		// Expect separating ','. Otherwise, all good, we are through!
		if lastRow, lastCol, ok = tokens.expect(TOKEN_SEPARATOR, ","); !ok {
			break
		}
		i += 1
	}
	return
}

func parseFunction(tokens *TokenChannel) (fun Function, err error) {
	startRow, startCol, ok := 0, 0, false
	var parseErr error = nil

	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "fun"); !ok {
		err = fmt.Errorf("%wExpected 'fun' keyword for function", ErrNormal)
		return
	}

	funName, row, col, ok := tokens.expectType(TOKEN_IDENTIFIER)
	if !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected identifier after 'fun'", ErrCritical, row, col)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_OPEN, "("); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '(' for function parameters", ErrCritical, row, col)
		return
	}

	variables, parseErr := parseArgList(tokens, true)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid argument list in function header", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_PARENTHESIS_CLOSE, ")"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected ')' after function parameters", ErrCritical, row, col)
		return
	}

	returnTypes, parseErr := parseTypeList(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid return-type list", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '{' after function header", ErrCritical, row, col)
		return
	}

	funBlock, parseErr := parseBlock(tokens)
	if parseErr != nil {
		err = fmt.Errorf("%w - Error while parsing loop block", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '}' after function block", ErrCritical, row, col)
		return
	}

	fun.fName = funName
	fun.parameters = variables
	fun.returnTypes = returnTypes
	fun.block = funBlock
	fun.line = startRow
	fun.column = startCol

	return
}

func parseReturn(tokens *TokenChannel) (ret Return, err error) {
	startRow, startCol, ok := 0, 0, false
	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "return"); !ok {
		err = fmt.Errorf("%wExpected 'return' keyword", ErrNormal)
		return
	}

	expressions, parseErr := parseExpressionList(tokens)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid expression list in return statement", parseErr)
		return
	}
	ret.expressions = expressions
	ret.line = startRow
	ret.column = startCol
	return
}

func parseBreak(tokens *TokenChannel) (br Break, err error) {

	startRow, startCol, ok := 0, 0, false
	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "break"); !ok {
		err = fmt.Errorf("%wExpected 'break' keyword", ErrNormal)
		return
	}

	br.line = startRow
	br.column = startCol
	return
}

func parseContinue(tokens *TokenChannel) (cont Continue, err error) {
	startRow, startCol, ok := 0, 0, false
	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "continue"); !ok {
		err = fmt.Errorf("%wExpected 'break' keyword", ErrNormal)
		return
	}

	cont.line = startRow
	cont.column = startCol
	return
}

func parseStruct(tokens *TokenChannel) (st StructDef, err error) {

	startRow, startCol, ok := 0, 0, false
	if startRow, startCol, ok = tokens.expect(TOKEN_KEYWORD, "struct"); !ok {
		err = fmt.Errorf("%wExpected 'struct' keyword", ErrNormal)
		return
	}

	name, row, col, ok := tokens.expectType(TOKEN_IDENTIFIER)
	if !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected identifier after 'struct'", ErrCritical, row, col)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_OPEN, "{"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '{' after function header", ErrCritical, row, col)
		return
	}

	// Struct definitions are basically the same as argument lists for function headers.
	variables, parseErr := parseArgList(tokens, false)
	if errors.Is(parseErr, ErrCritical) {
		err = fmt.Errorf("%w - Invalid struct member list", parseErr)
		return
	}

	if row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}"); !ok {
		err = fmt.Errorf("%w[%v:%v] - Expected '}' after struct definition", ErrCritical, row, col)
		return
	}

	st.name = name
	st.members = make([]StructMem, len(variables), len(variables))
	for i, v := range variables {
		st.members[i] = StructMem{v.vName, 0, v.vType}
	}
	st.line = startRow
	st.column = startCol

	return
}

func parseBlock(tokens *TokenChannel) (block Block, err error) {

	//	type ParseStmtFunc func(*TokenChannel) (interface{}, error)
	//	var blubb ParseStmtFunc = parseStruct

	//	parseStatementMethods := []ParseStmtFunc{
	//		parseStruct, parseCondition, parseSwitch, parseRangedLoop, parseLoop,
	//		parseAssignment, parseFunction, parseReturn, parseFunCall,
	//	}

	for {

		// fmt.Println("1")

		switch structStatement, parseErr := parseStruct(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, structStatement)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}

		// fmt.Println("2")

		switch ifStatement, parseErr := parseCondition(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, ifStatement)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("3")

		switch switchStatement, parseErr := parseSwitch(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, switchStatement)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("4")

		switch loopStatement, parseErr := parseRangedLoop(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, loopStatement)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("5")

		switch loopStatement, parseErr := parseLoop(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, loopStatement)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("6")

		switch assignment, parseErr := parseAssignment(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, assignment)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("7")

		switch function, parseErr := parseFunction(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, function)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("8")

		switch ret, parseErr := parseReturn(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, ret)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}

		switch br, parseErr := parseBreak(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, br)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}

		switch cont, parseErr := parseContinue(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, cont)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("9")

		switch funCall, parseErr := parseFunCall(tokens); {
		case parseErr == nil:
			block.statements = append(block.statements, funCall)
			continue
		case errors.Is(parseErr, ErrCritical):
			err = parseErr
			return
		}
		// fmt.Println("10")
		if _, _, ok := tokens.expect(TOKEN_EOF, ""); ok {
			return
		}

		// A block can only be closed with }. If we don't find that, we have an error on hand.
		row, col, ok := tokens.expect(TOKEN_CURLY_CLOSE, "}")
		if !ok {

			if row, col, ok := tokens.expect(TOKEN_KEYWORD, "case"); ok {
				tokens.pushBack(tokens.createToken(TOKEN_KEYWORD, "case", row, col))
				break
			}
			if row, col, ok := tokens.expect(TOKEN_KEYWORD, "default"); ok {
				tokens.pushBack(tokens.createToken(TOKEN_KEYWORD, "default", row, col))
				break
			}

			err = fmt.Errorf("%w[%v:%v] - Unexpected symbol. Can not be parsed.", ErrCritical, row, col)
			return

		}
		tokens.pushBack(tokens.createToken(TOKEN_CURLY_CLOSE, "}", row, col))

		// If we don't recognize the current token as part of a known statement, we break
		// This means likely, that we are at the end of a block
		break

	}

	if len(block.statements) > 0 {
		row, col := block.statements[0].startPos()
		block.line = row
		block.column = col
	}

	return
}

func parse(tokens chan Token) (ast AST, err error) {

	var tokenChan TokenChannel
	tokenChan.c = tokens

	block, parseErr := parseBlock(&tokenChan)
	err = parseErr

	ast.block = block
	return
}