|
| 1 | +package operator |
| 2 | + |
| 3 | +import ( |
| 4 | + "fmt" |
| 5 | + "strings" |
| 6 | +) |
| 7 | + |
| 8 | +// evaluate 计算逻辑表达式的值 |
| 9 | +func EvaluateBoolExpr(expr string, variables map[string]bool) (bool, error) { |
| 10 | + |
| 11 | + // 将表达式拆分成一个个token |
| 12 | + tokens, err := splitExpression(expr) |
| 13 | + if err != nil { |
| 14 | + return false, err |
| 15 | + } |
| 16 | + |
| 17 | + // 开始执行逻辑运算 |
| 18 | + stack := make([]bool, 0) |
| 19 | + opStack := make([]string, 0) |
| 20 | + for _, token := range tokens { |
| 21 | + switch token { |
| 22 | + case "&&": |
| 23 | + for len(opStack) > 0 && opStack[len(opStack)-1] == "!" { |
| 24 | + if len(stack) < 1 { |
| 25 | + return false, fmt.Errorf("invalid expression") |
| 26 | + } |
| 27 | + b := stack[len(stack)-1] |
| 28 | + stack = stack[:len(stack)-1] |
| 29 | + stack = append(stack, !b) |
| 30 | + opStack = opStack[:len(opStack)-1] |
| 31 | + } |
| 32 | + opStack = append(opStack, "&&") |
| 33 | + case "||": |
| 34 | + for len(opStack) > 0 && (opStack[len(opStack)-1] == "!" || opStack[len(opStack)-1] == "&&") { |
| 35 | + if len(stack) < 2 { |
| 36 | + return false, fmt.Errorf("invalid expression") |
| 37 | + } |
| 38 | + b1, b2 := stack[len(stack)-2], stack[len(stack)-1] |
| 39 | + stack = stack[:len(stack)-2] |
| 40 | + op := opStack[len(opStack)-1] |
| 41 | + opStack = opStack[:len(opStack)-1] |
| 42 | + stack = append(stack, evaluateOp(b1, b2, op)) |
| 43 | + } |
| 44 | + opStack = append(opStack, "||") |
| 45 | + case "!": |
| 46 | + opStack = append(opStack, "!") |
| 47 | + case "(": |
| 48 | + opStack = append(opStack, "(") |
| 49 | + case ")": |
| 50 | + if len(opStack) < 1 { |
| 51 | + return false, fmt.Errorf("invalid expression") |
| 52 | + } |
| 53 | + for opStack[len(opStack)-1] != "(" { |
| 54 | + if len(stack) < 2 { |
| 55 | + return false, fmt.Errorf("invalid expression") |
| 56 | + } |
| 57 | + b1, b2 := stack[len(stack)-2], stack[len(stack)-1] |
| 58 | + stack = stack[:len(stack)-2] |
| 59 | + op := opStack[len(opStack)-1] |
| 60 | + opStack = opStack[:len(opStack)-1] |
| 61 | + stack = append(stack, evaluateOp(b1, b2, op)) |
| 62 | + if len(opStack) == 0 { |
| 63 | + return false, fmt.Errorf("unmatched parentheses") |
| 64 | + } |
| 65 | + } |
| 66 | + opStack = opStack[:len(opStack)-1] |
| 67 | + if len(opStack) > 0 && opStack[len(opStack)-1] == "!" { |
| 68 | + if len(stack) < 1 { |
| 69 | + return false, fmt.Errorf("invalid expression") |
| 70 | + } |
| 71 | + b := stack[len(stack)-1] |
| 72 | + stack = stack[:len(stack)-1] |
| 73 | + stack = append(stack, !b) |
| 74 | + opStack = opStack[:len(opStack)-1] |
| 75 | + } |
| 76 | + default: |
| 77 | + if v, ok := variables[token]; ok { |
| 78 | + stack = append(stack, v) |
| 79 | + if len(opStack) > 0 && opStack[len(opStack)-1] == "!" { |
| 80 | + if len(stack) < 1 { |
| 81 | + return false, fmt.Errorf("invalid expression") |
| 82 | + } |
| 83 | + b := stack[len(stack)-1] |
| 84 | + stack = stack[:len(stack)-1] |
| 85 | + stack = append(stack, !b) |
| 86 | + opStack = opStack[:len(opStack)-1] |
| 87 | + } |
| 88 | + } else { |
| 89 | + return false, fmt.Errorf("unknown variable %s", token) |
| 90 | + } |
| 91 | + } |
| 92 | + } |
| 93 | + |
| 94 | + for len(opStack) > 0 { |
| 95 | + if len(stack) < 2 { |
| 96 | + return false, fmt.Errorf("invalid expression") |
| 97 | + } |
| 98 | + b1, b2 := stack[len(stack)-2], stack[len(stack)-1] |
| 99 | + stack = stack[:len(stack)-2] |
| 100 | + op := opStack[len(opStack)-1] |
| 101 | + opStack = opStack[:len(opStack)-1] |
| 102 | + stack = append(stack, evaluateOp(b1, b2, op)) |
| 103 | + } |
| 104 | + |
| 105 | + if len(stack) != 1 { |
| 106 | + return false, fmt.Errorf("invalid expression") |
| 107 | + } |
| 108 | + return stack[0], nil |
| 109 | +} |
| 110 | + |
| 111 | +// evaluateOp 对两个 bool 值进行逻辑运算 |
| 112 | +func evaluateOp(b1, b2 bool, op string) bool { |
| 113 | + switch op { |
| 114 | + case "&&": |
| 115 | + return b1 && b2 |
| 116 | + case "||": |
| 117 | + return b1 || b2 |
| 118 | + default: |
| 119 | + panic("unsupported operator: " + op) |
| 120 | + } |
| 121 | +} |
| 122 | + |
| 123 | +// isValid 检查表达式是否合法 |
| 124 | +func isValid(expr string) bool { |
| 125 | + if len(expr) == 0 { |
| 126 | + return false |
| 127 | + } |
| 128 | + allowed := "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!()+-_*%/|&," |
| 129 | + stack := make([]rune, 0) |
| 130 | + for _, ch := range expr { |
| 131 | + if ch == '(' { |
| 132 | + stack = append(stack, ch) |
| 133 | + } else if ch == ')' { |
| 134 | + if len(stack) == 0 { |
| 135 | + return false |
| 136 | + } |
| 137 | + stack = stack[:len(stack)-1] |
| 138 | + } else if !strings.ContainsRune(allowed, ch) { |
| 139 | + return false |
| 140 | + } |
| 141 | + } |
| 142 | + return len(stack) == 0 |
| 143 | +} |
| 144 | + |
| 145 | +// splitExpression 将表达式拆分为token |
| 146 | +func splitExpression(expr string) ([]string, error) { |
| 147 | + expr = strings.ReplaceAll(expr, " ", "") // 去除空格 |
| 148 | + if !isValid(expr) { |
| 149 | + return nil, fmt.Errorf("invalid expression") |
| 150 | + } |
| 151 | + tokens := make([]string, 0) |
| 152 | + buf := make([]rune, 0) |
| 153 | + |
| 154 | + for i := 0; i < len(expr); i++ { |
| 155 | + ch := rune(expr[i]) |
| 156 | + if ch == '&' && i < len(expr)-1 && rune(expr[i+1]) == '&' { |
| 157 | + if len(buf) > 0 { |
| 158 | + tokens = append(tokens, string(buf)) |
| 159 | + buf = []rune{} |
| 160 | + } |
| 161 | + tokens = append(tokens, "&&") |
| 162 | + i++ |
| 163 | + } else if ch == '|' && i < len(expr)-1 && rune(expr[i+1]) == '|' { |
| 164 | + if len(buf) > 0 { |
| 165 | + tokens = append(tokens, string(buf)) |
| 166 | + buf = []rune{} |
| 167 | + } |
| 168 | + tokens = append(tokens, "||") |
| 169 | + i++ |
| 170 | + } else if ch == '!' || ch == '(' || ch == ')' { |
| 171 | + if len(buf) > 0 { |
| 172 | + tokens = append(tokens, string(buf)) |
| 173 | + buf = []rune{} |
| 174 | + } |
| 175 | + tokens = append(tokens, string(ch)) |
| 176 | + } else if ch == ',' { |
| 177 | + if len(buf) > 0 { |
| 178 | + tokens = append(tokens, string(buf)) |
| 179 | + buf = []rune{} |
| 180 | + } |
| 181 | + tokens = append(tokens, string(ch)) |
| 182 | + } else { |
| 183 | + buf = append(buf, ch) |
| 184 | + } |
| 185 | + } |
| 186 | + if len(buf) > 0 { |
| 187 | + tokens = append(tokens, string(buf)) |
| 188 | + } |
| 189 | + return tokens, nil |
| 190 | +} |
0 commit comments