Claude Haiku 4.5 vs DeepSeek V4.1 Flash

A hard prompt: “Evaluate an arithmetic expression, no eval”, in full.

• Claude Haiku 4.5

  Failed: 14 of 15 tests passed. First failure: evaluate("-2 ^ 2"): Expected values to be strictly deep-equal:

  ```javascript
  function evaluate(expression) {
    const tokens = tokenize(expression);
    const parser = new Parser(tokens);
    const result = parser.parseExpression();
    
    if (parser.pos !== tokens.length) {
      throw new Error("Unexpected tokens after expression");
    }
    
    return result;
  }
  
  function tokenize(expression) {
    const tokens = [];
    let i = 0;
    
    while (i < expression.length) {
      const ch = expression[i];
      
      if (/\s/.test(ch)) {
        i++;
        continue;
      }
      
      if (/\d/.test(ch)) {
        let num = '';
        while (i < expression.length && /[\d.]/.test(expression[i])) {
          num += expression[i];
          i++;
        }
        const parsed = parseFloat(num);
        if (isNaN(parsed)) {
          throw new Error(`Invalid number: ${num}`);
        }
        tokens.push({ type: 'NUMBER', value: parsed });
        continue;
      }
      
      if ('+-*/^()'.includes(ch)) {
        tokens.push({ type: ch, value: ch });
        i++;
        continue;
      }
      
      throw new Error(`Unexpected character: ${ch}`);
    }
    
    return tokens;
  }
  
  class Parser {
    constructor(tokens) {
      this.tokens = tokens;
      this.pos = 0;
    }
    
    peek() {
      return this.tokens[this.pos];
    }
    
    consume() {
      return this.tokens[this.pos++];
    }
    
    parseExpression() {
      return this.parseAddSub();
    }
    
    parseAddSub() {
      let left = this.parseMulDiv();
      
      while (this.peek() && (this.peek().type === '+' || this.peek().type === '-')) {
        const op = this.consume().type;
        const right = this.parseMulDiv();
        left = op === '+' ? left + right : left - right;
      }
      
      return left;
    }
    
    parseMulDiv() {
      let left = this.parsePower();
      
      while (this.peek() && (this.peek().type === '*' || this.peek().type === '/')) {
        const op = this.consume().type;
        const right = this.parsePower();
        left = op === '*' ? left * right : left / right;
      }
      
      return left;
    }
    
    parsePower() {
      let left = this.parseUnary();
      
      if (this.peek() && this.peek().type === '^') {
        this.consume();
        const right = this.parsePower();
        left = Math.pow(left, right);
      }
      
      return left;
    }
    
    parseUnary() {
      if (this.peek() && this.peek().type === '-') {
        this.consume();
        return -this.parseUnary();
      }
      
      if (this.peek() && this.peek().type === '+') {
        this.consume();
        return this.parseUnary();
      }
      
      return this.parsePrimary();
    }
    
    parsePrimary() {
      const token = this.peek();
      
      if (!token) {
        throw new Error("Unexpected end of expression");
      }
      
      if (token.type === 'NUMBER') {
        this.consume();
        return token.value;
      }
      
      if (token.type === '(') {
        this.consume();
        const result = this.parseExpression();
        
        if (!this.peek() || this.peek().type !== ')') {
          throw new Error("Missing closing parenthesis");
        }
        
        this.consume();
        return result;
      }
      
      throw new Error(`Unexpected token: ${token.value}`);
    }
  }
  ```

  599 tokens in, 1,007 out · 7.6 s · $0.0056 · 1 message on Pro · answered by anthropic/claude-haiku-4.5 via Amazon Bedrock · September 27, 2026

• DeepSeek V4.1 Flash

  Passed: All 15 tests passed.

  ```javascript
  function evaluate(expression) {
    if (typeof expression !== 'string') {
      throw new Error('Expression must be a string');
    }
  
    // ---- Tokenizer ----
    const tokens = [];
    let i = 0;
    const isDigit = (c) => c >= '0' && c <= '9';
  
    while (i < expression.length) {
      const ch = expression[i];
  
      if (ch === ' ' || ch === '\t') {
        i++;
        continue;
      }
  
      // number: digits with an optional single decimal point (at least one digit)
      if (isDigit(ch) || ch === '.') {
        let j = i;
        let digits = 0;
        while (j < expression.length && isDigit(expression[j])) {
          j++;
          digits++;
        }
        if (j < expression.length && expression[j] === '.') {
          j++;
          while (j < expression.length && isDigit(expression[j])) {
            j++;
            digits++;
          }
        }
        if (digits === 0) {
          throw new Error('Invalid number in expression');
        }
        tokens.push({ type: 'num', value: parseFloat(expression.slice(i, j)) });
        i = j;
        continue;
      }
  
      if ('+-*/^()'.indexOf(ch) !== -1) {
        tokens.push({ type: ch });
        i++;
        continue;
      }
  
      throw new Error('Unexpected character: ' + ch);
    }
  
    if (tokens.length === 0) {
      throw new Error('Empty expression');
    }
  
    // ---- Parser (recursive descent) ----
    let pos = 0;
    const peek = () => tokens[pos];
    const isOp = (tok, ch) => tok !== undefined && tok.type === ch;
  
    // expr := term (('+' | '-') term)*          left-associative
    function parseExpression() {
      let value = parseTerm();
      while (isOp(peek(), '+') || isOp(peek(), '-')) {
        const op = tokens[pos++].type;
        const rhs = parseTerm();
        value = op === '+' ? value + rhs : value - rhs;
      }
      return value;
    }
  
    // term := unary (('*' | '/') unary)*        left-associative
    function parseTerm() {
      let value = parseUnary();
      while (isOp(peek(), '*') || isOp(peek(), '/')) {
        const op = tokens[pos++].type;
        const rhs = parseUnary();
        value = op === '*' ? value * rhs : value / rhs;
      }
      return value;
    }
  
    // unary := ('-' | '+') unary | power
    // unary minus is looser than '^', so -2^2 === -(2^2) === -4
    function parseUnary() {
      if (isOp(peek(), '-')) {
        pos++;
        return -parseUnary();
      }
      if (isOp(peek(), '+')) {
        pos++;
        return parseUnary();
      }
      return parsePower();
    }
  
    // power := primary ('^' unary)?             right-associative
    // the exponent is a unary, which permits 2^-1 and 2^3^2 = 2^(3^2)
    function parsePower() {
      const base = parsePrimary();
      if (isOp(peek(), '^')) {
        pos++;
        const exponent = parseUnary();
        return Math.pow(base, exponent);
      }
      return base;
    }
  
    // primary := number | '(' expr ')'
    function parsePrimary() {
      const tok = peek();
      if (tok === undefined) {
        throw new Error('Unexpected end of expression');
      }
      if (tok.type === 'num') {
        pos++;
        return tok.value;
      }
      if (tok.type === '(') {
        pos++;
        const value = parseExpression();
        if (!isOp(peek(), ')')) {
          throw new Error('Missing closing parenthesis');
        }
        pos++;
        return value;
      }
      throw new Error('Unexpected token: ' + tok.type);
    }
  
    const result = parseExpression();
    if (pos !== tokens.length) {
      throw new Error('Unexpected token: ' + tokens[pos].type);
    }
    return result;
  }
  ```

  591 tokens in, 2,442 out (1,491 of them reasoning) · 5.8 s · $0.0030 · 1 message on Pro · answered by deepseek/deepseek-v4.1-flash via Together · October 8, 2026