anchor.diff:              // precedence level. However, POSTFIX_PRECEDENCE is the
               // highest level, so we just call parseUnaryExpression
               // directly.
  -            token = parseUnaryExpression(token.next, withoutCascades);
  +            token = parseUnaryExpression(token.next, allowCascades);
               listener.handleBinaryExpression(operator);
             } else if ((info === OPEN_PAREN_INFO) ||
                        (info === OPEN_SQUARE_BRACKET_INFO)) {
  
positive.code:           // Left associative, so we recurse at the next higher
            // precedence level.
            token = parsePrecedenceExpression(token.next, level + 1,
                                              withoutCascades);
            listener.handleBinaryExpression(operator);
          }
          info = token.info;
  
negative.code:     return token;
    }
  
    Token parseUnaryExpression(Token token, bool allowCascades) {
      String value = token.stringValue;
      // Prefix:
      if (value === '+') {
  