public void visitArithExpr(final ArithExpr expr) { // important one
		expr.left().visit(this); // visit the left branch

		if (!found) { // if a match isn't found yet
			exchangeFactor++; // increase the exchange factor
			if (expr.left().type().isWide()) {
				exchangeFactor++; // twice if wide
			}
			if (exchangeFactor < 3) {
				expr.right().visit(this); // visit right branch
			}
		}
	}