anchor.diff:        // Right associative, so we recurse at the same precedence
         // level.
         token = parsePrecedenceExpression(token.next, POSTFIX_PRECEDENCE,
  -                                        withoutCascades);
  +                                        allowCascades);
         listener.handleUnaryPrefixExpression(operator);
       } else if ((value === '++') || value === '--') {
         // TODO(ahe): Validate this is used correctly.
  
positive.code:       // Right associative, so we recurse at the same precedence
        // level.
        token = parsePrecedenceExpression(token.next, POSTFIX_PRECEDENCE,
                                          withoutCascades);
        listener.handleUnaryPrefixAssignmentExpression(operator);
      } else {
        token = parsePrimary(token);
  
negative.code:             // precedence level. However, POSTFIX_PRECEDENCE is the
              // highest level, so we just call parseUnaryExpression
              // directly.
              token = parseUnaryExpression(token.next, allowCascades);
              listener.handleBinaryExpression(operator);
            } else if ((info === OPEN_PAREN_INFO) ||
                       (info === OPEN_SQUARE_BRACKET_INFO)) {
  