The quantifier rules for standard intuitionist logic are the same as for standard classical logic, and the inference $\forall xFx \vdash \exists xFx$ (which presupposes a non-empty domain) is valid in both standard systems.
We can tinker in the same way with the rules in both the classical and the intuitionist case to allow for empty domains (this is particularly neatly done in the case of 'tree' systems).
The intuitionist and classic cases are, in this respect, quite parallel.
It is a further question whether the intuitionist has a special reason, over and above those available to the classical logician, to drop the standard assumption of non-empty domains. The classicist, after all, could also argue that the presumption that there are some objects to quantify over (in a given case) is not in general a _logical_ assumption.