Implemented operators and better indexing

This commit is contained in:
Martino Ferrari
2026-01-30 00:49:42 +01:00
parent ecc7039306
commit 0cbbf5939a
13 changed files with 836 additions and 83 deletions

View File

@@ -226,6 +226,56 @@ func (p *Parser) parseSubnode() (Subnode, bool) {
}
func (p *Parser) parseValue() (Value, bool) {
return p.parseExpression(0)
}
func getPrecedence(t TokenType) int {
switch t {
case TokenStar, TokenSlash, TokenPercent:
return 5
case TokenPlus, TokenMinus:
return 4
case TokenConcat:
return 3
case TokenAmpersand:
return 2
case TokenPipe, TokenCaret:
return 1
default:
return 0
}
}
func (p *Parser) parseExpression(minPrecedence int) (Value, bool) {
left, ok := p.parseAtom()
if !ok {
return nil, false
}
for {
t := p.peek()
prec := getPrecedence(t.Type)
if prec == 0 || prec <= minPrecedence {
break
}
p.next()
right, ok := p.parseExpression(prec)
if !ok {
return nil, false
}
left = &BinaryExpression{
Position: left.Pos(),
Left: left,
Operator: t,
Right: right,
}
}
return left, true
}
func (p *Parser) parseAtom() (Value, bool) {
tok := p.next()
switch tok.Type {
case TokenString: