This article is very interesting but it address only the constant overhead. It would be interesting to know is there is also a factor on the size of the program (Sexp = k*Snoexp + C). I'm not sure if this factor (here 'k') will be greater or smaller than 1 (without exception, you have to generate code for every if/then needed for managing the error code).

If k<1, the choice become a trade-of : Small programs are smaller without exception and big programs are smaller with exception.

Has anyone try to measure this factor ?