Files
chaisql/sql/parser/expr.go
Asdine El Hrychy dfdbc16b18 Drop duration type
2020-09-28 22:44:32 +04:00

545 lines
14 KiB
Go

package parser
import (
"bytes"
"fmt"
"strconv"
"strings"
"github.com/genjidb/genji/document"
"github.com/genjidb/genji/sql/query/expr"
"github.com/genjidb/genji/sql/scanner"
)
type dummyOperator struct {
leftHand, rightHand expr.Expr
}
func (d *dummyOperator) Token() scanner.Token { panic("not implemented") }
func (d *dummyOperator) Equal(expr.Expr) bool { panic("not implemented") }
func (d *dummyOperator) Eval(expr.EvalStack) (document.Value, error) { panic("not implemented") }
func (d *dummyOperator) Precedence() int { panic("not implemented") }
func (d *dummyOperator) LeftHand() expr.Expr { panic("not implemented") }
func (d *dummyOperator) RightHand() expr.Expr { return d.rightHand }
func (d *dummyOperator) SetLeftHandExpr(e expr.Expr) { panic("not implemented") }
func (d *dummyOperator) SetRightHandExpr(e expr.Expr) { d.rightHand = e }
// ParseExpr parses an expression.
func (p *Parser) ParseExpr() (e expr.Expr, lit string, err error) {
// enable the expression buffer to store the literal representation
// of the parsed expression
if p.buf == nil {
p.buf = new(bytes.Buffer)
defer func() { p.buf = nil }()
}
// Dummy root node.
var root expr.Operator = new(dummyOperator)
// Parse a non-binary expression type to start.
// This variable will always be the root of the expression tree.
e, err = p.parseUnaryExpr()
if err != nil {
return nil, "", err
}
root.SetRightHandExpr(e)
// Loop over operations and unary exprs and build a tree based on precedence.
for {
// If the next token is NOT an operator then return the expression.
op, tok, err := p.parseOperator()
if err != nil {
return nil, "", err
}
if tok == 0 {
return root.RightHand(), strings.TrimSpace(p.buf.String()), nil
}
var rhs expr.Expr
if rhs, err = p.parseUnaryExpr(); err != nil {
return nil, "", err
}
// Find the right spot in the tree to add the new expression by
// descending the RHS of the expression tree until we reach the last
// BinaryExpr or a BinaryExpr whose RHS has an operator with
// precedence >= the operator being added.
for node := root.(expr.Operator); ; {
p, ok := node.RightHand().(expr.Operator)
if !ok || p.Precedence() >= tok.Precedence() {
// Add the new expression here and break.
node.SetRightHandExpr(op(node.RightHand(), rhs))
break
}
node = p
}
}
}
func (p *Parser) parseOperator() (func(lhs, rhs expr.Expr) expr.Expr, scanner.Token, error) {
op, _, _ := p.ScanIgnoreWhitespace()
if !op.IsOperator() && op != scanner.NOT {
p.Unscan()
return nil, 0, nil
}
switch op {
case scanner.EQ:
return expr.Eq, op, nil
case scanner.NEQ:
return expr.Neq, op, nil
case scanner.GT:
return expr.Gt, op, nil
case scanner.GTE:
return expr.Gte, op, nil
case scanner.LT:
return expr.Lt, op, nil
case scanner.LTE:
return expr.Lte, op, nil
case scanner.AND:
return expr.And, op, nil
case scanner.OR:
return expr.Or, op, nil
case scanner.ADD:
return expr.Add, op, nil
case scanner.SUB:
return expr.Sub, op, nil
case scanner.MUL:
return expr.Mul, op, nil
case scanner.DIV:
return expr.Div, op, nil
case scanner.MOD:
return expr.Mod, op, nil
case scanner.BITWISEAND:
return expr.BitwiseAnd, op, nil
case scanner.BITWISEOR:
return expr.BitwiseOr, op, nil
case scanner.BITWISEXOR:
return expr.BitwiseXor, op, nil
case scanner.IN:
return expr.In, op, nil
case scanner.IS:
if tok, _, _ := p.ScanIgnoreWhitespace(); tok == scanner.NOT {
return expr.IsNot, op, nil
}
p.Unscan()
return expr.Is, op, nil
case scanner.NOT:
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.IN {
return nil, 0, newParseError(scanner.Tokstr(tok, lit), []string{"IN"}, pos)
}
return expr.NotIn, op, nil
}
panic(fmt.Sprintf("unknown operator %q", op))
}
// parseUnaryExpr parses an non-binary expression.
func (p *Parser) parseUnaryExpr() (expr.Expr, error) {
tok, pos, lit := p.ScanIgnoreWhitespace()
switch tok {
case scanner.CAST:
p.Unscan()
return p.parseCastExpression()
case scanner.IDENT:
// if the next token is a left parenthesis, this is a function
if tok1, _, _ := p.Scan(); tok1 == scanner.LPAREN {
p.Unscan()
p.Unscan()
return p.parseFunction()
}
p.Unscan()
p.Unscan()
field, err := p.parsePath()
if err != nil {
return nil, err
}
fs := expr.FieldSelector(field)
return fs, nil
case scanner.NAMEDPARAM:
if len(lit) == 1 {
return nil, &ParseError{Message: "missing param name"}
}
if p.orderedParams > 0 {
return nil, &ParseError{Message: "cannot mix positional arguments with named arguments"}
}
p.namedParams++
return expr.NamedParam(lit[1:]), nil
case scanner.POSITIONALPARAM:
if p.namedParams > 0 {
return nil, &ParseError{Message: "cannot mix positional arguments with named arguments"}
}
p.orderedParams++
return expr.PositionalParam(p.orderedParams), nil
case scanner.STRING:
return expr.TextValue(lit), nil
case scanner.NUMBER:
v, err := strconv.ParseFloat(lit, 64)
if err != nil {
return nil, &ParseError{Message: "unable to parse number", Pos: pos}
}
return expr.DoubleValue(v), nil
case scanner.INTEGER:
v, err := strconv.ParseInt(lit, 10, 64)
if err != nil {
// The literal may be too large to fit into an int64, parse as Float64
if v, err := strconv.ParseFloat(lit, 64); err == nil {
return expr.DoubleValue(v), nil
}
return nil, &ParseError{Message: "unable to parse integer", Pos: pos}
}
return expr.IntegerValue(v), nil
case scanner.TRUE, scanner.FALSE:
return expr.BoolValue(tok == scanner.TRUE), nil
case scanner.NULL:
return expr.NullValue(), nil
case scanner.LBRACKET:
p.Unscan()
e, err := p.parseDocument()
return e, err
case scanner.LSBRACKET:
p.Unscan()
return p.parseExprList(scanner.LSBRACKET, scanner.RSBRACKET)
case scanner.LPAREN:
e, _, err := p.ParseExpr()
if err != nil {
return nil, err
}
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.RPAREN {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{")"}, pos)
}
return expr.Parentheses{E: e}, nil
default:
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"identifier", "string", "number", "bool"}, pos)
}
}
// parseIdent parses an identifier.
func (p *Parser) parseIdent() (string, error) {
tok, pos, lit := p.ScanIgnoreWhitespace()
if tok != scanner.IDENT {
return "", newParseError(scanner.Tokstr(tok, lit), []string{"identifier"}, pos)
}
return lit, nil
}
// parseIdentList parses a comma delimited list of identifiers.
func (p *Parser) parseIdentList() ([]string, error) {
// Parse first (required) identifier.
ident, err := p.parseIdent()
if err != nil {
return nil, err
}
idents := []string{ident}
// Parse remaining (optional) identifiers.
for {
if tok, _, _ := p.ScanIgnoreWhitespace(); tok != scanner.COMMA {
p.Unscan()
return idents, nil
}
if ident, err = p.parseIdent(); err != nil {
return nil, err
}
idents = append(idents, ident)
}
}
// parseParam parses a positional or named param.
func (p *Parser) parseParam() (expr.Expr, error) {
tok, _, lit := p.ScanIgnoreWhitespace()
switch tok {
case scanner.NAMEDPARAM:
if len(lit) == 1 {
return nil, &ParseError{Message: "missing param name"}
}
if p.orderedParams > 0 {
return nil, &ParseError{Message: "cannot mix positional arguments with named arguments"}
}
p.namedParams++
return expr.NamedParam(lit[1:]), nil
case scanner.POSITIONALPARAM:
if p.namedParams > 0 {
return nil, &ParseError{Message: "cannot mix positional arguments with named arguments"}
}
p.orderedParams++
return expr.PositionalParam(p.orderedParams), nil
default:
return nil, nil
}
}
func (p *Parser) parseType() document.ValueType {
tok, _, _ := p.ScanIgnoreWhitespace()
switch tok {
case scanner.TYPEARRAY:
return document.ArrayValue
case scanner.TYPEBLOB:
return document.BlobValue
case scanner.TYPEBOOL:
return document.BoolValue
case scanner.TYPEBYTES:
return document.BlobValue
case scanner.TYPEDOCUMENT:
return document.DocumentValue
case scanner.TYPEDOUBLE:
return document.DoubleValue
case scanner.TYPEINTEGER:
return document.IntegerValue
case scanner.TYPETEXT:
return document.TextValue
}
p.Unscan()
return 0
}
// parseDocument parses a document
func (p *Parser) parseDocument() (expr.Expr, error) {
// Parse { token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.LBRACKET {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"{"}, pos)
}
var pairs expr.KVPairs
var pair expr.KVPair
var err error
// Parse kv pairs.
for {
if pair, err = p.parseKV(); err != nil {
p.Unscan()
break
}
pairs = append(pairs, pair)
if tok, _, _ := p.ScanIgnoreWhitespace(); tok != scanner.COMMA {
p.Unscan()
break
}
}
// Parse required } token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.RBRACKET {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"}"}, pos)
}
return pairs, nil
}
// parseKV parses a key-value pair in the form IDENT : Expr.
func (p *Parser) parseKV() (expr.KVPair, error) {
var k string
tok, pos, lit := p.ScanIgnoreWhitespace()
if tok == scanner.IDENT || tok == scanner.STRING {
k = lit
} else {
return expr.KVPair{}, newParseError(scanner.Tokstr(tok, lit), []string{"ident", "string"}, pos)
}
tok, pos, lit = p.ScanIgnoreWhitespace()
if tok != scanner.COLON {
p.Unscan()
return expr.KVPair{}, newParseError(scanner.Tokstr(tok, lit), []string{":"}, pos)
}
e, _, err := p.ParseExpr()
if err != nil {
return expr.KVPair{}, err
}
return expr.KVPair{
K: k,
V: e,
}, nil
}
// parsePath parses a path to a specific value.
func (p *Parser) parsePath() (document.ValuePath, error) {
var vPath document.ValuePath
// parse first mandatory ident
chunk, err := p.parseIdent()
if err != nil {
return nil, err
}
vPath = append(vPath, document.ValuePathFragment{
FieldName: chunk,
})
LOOP:
for {
// scan the very next token.
// if can be either a '.' or a '['
// Otherwise, unscan and return the path
tok, _, _ := p.Scan()
switch tok {
case scanner.DOT:
// scan the next token for an ident
tok, pos, lit := p.Scan()
if tok != scanner.IDENT {
return nil, newParseError(lit, []string{"identifier"}, pos)
}
vPath = append(vPath, document.ValuePathFragment{
FieldName: lit,
})
case scanner.LSBRACKET:
// scan the next token for an integer
tok, pos, lit := p.Scan()
if tok != scanner.INTEGER || lit[0] == '-' {
return nil, newParseError(lit, []string{"array index"}, pos)
}
idx, err := strconv.Atoi(lit)
if err != nil {
return nil, err
}
vPath = append(vPath, document.ValuePathFragment{
ArrayIndex: idx,
})
// scan the next token for a closing left bracket
tok, pos, lit = p.Scan()
if tok != scanner.RSBRACKET {
return nil, newParseError(lit, []string{"]"}, pos)
}
default:
p.Unscan()
break LOOP
}
}
return vPath, nil
}
func (p *Parser) parseExprList(leftToken, rightToken scanner.Token) (expr.LiteralExprList, error) {
// Parse ( or [ token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != leftToken {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{leftToken.String()}, pos)
}
var exprList expr.LiteralExprList
var expr expr.Expr
var err error
// Parse expressions.
for {
if expr, _, err = p.ParseExpr(); err != nil {
p.Unscan()
break
}
exprList = append(exprList, expr)
if tok, _, _ := p.ScanIgnoreWhitespace(); tok != scanner.COMMA {
p.Unscan()
break
}
}
// Parse required ) or ] token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != rightToken {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{rightToken.String()}, pos)
}
return exprList, nil
}
// parseFunction parses a function call.
// a function is an identifier followed by a parenthesis,
// an optional coma-separated list of expressions and a closing parenthesis.
func (p *Parser) parseFunction() (expr.Expr, error) {
// Parse function name.
fname, err := p.parseIdent()
if err != nil {
return nil, err
}
// Parse required ( token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.LPAREN {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"("}, pos)
}
// Special case: If the function is COUNT, support the special case COUNT(*)
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok == scanner.MUL {
if tok, _, _ := p.ScanIgnoreWhitespace(); tok != scanner.RPAREN {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{")"}, pos)
}
return &expr.CountFunc{Wildcard: true}, nil
}
p.Unscan()
// Check if the function is called without arguments.
if tok, _, _ := p.ScanIgnoreWhitespace(); tok == scanner.RPAREN {
return expr.GetFunc(fname)
}
p.Unscan()
var exprs []expr.Expr
// Parse expressions.
for {
e, _, err := p.ParseExpr()
if err != nil {
return nil, err
}
exprs = append(exprs, e)
if tok, _, _ := p.ScanIgnoreWhitespace(); tok != scanner.COMMA {
p.Unscan()
break
}
}
// Parse required ) token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.RPAREN {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{")"}, pos)
}
return expr.GetFunc(fname, exprs...)
}
// parseCastExpression parses a string of the form CAST(expr AS type).
func (p *Parser) parseCastExpression() (expr.Expr, error) {
// Parse required CAST token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.CAST {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"CAST"}, pos)
}
// Parse required ( token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.LPAREN {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"("}, pos)
}
// parse required expression.
e, _, err := p.ParseExpr()
if err != nil {
return nil, err
}
// Parse required AS token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.AS {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"AS"}, pos)
}
// Parse require typename.
tp := p.parseType()
if tp == 0 {
tok, pos, lit := p.ScanIgnoreWhitespace()
p.Unscan()
return nil, newParseError(scanner.Tokstr(tok, lit), []string{"type"}, pos)
}
// Parse required ) token.
if tok, pos, lit := p.ScanIgnoreWhitespace(); tok != scanner.RPAREN {
return nil, newParseError(scanner.Tokstr(tok, lit), []string{")"}, pos)
}
return expr.CastFunc{Expr: e, CastAs: tp}, nil
}