Hi All,
As far as I can see you have two options:
1. Assume that the prior comes from a known distribution. If you have a sample you could estimate the parameters of a MultiNormal distribution (any parameters which are constrained to be positive you can take the log and work with the log of the parameter). For many classes of problems this approximation is a reasonable one, especially if your sample size which generated the prior is large.
2. You have a sample which represents the valid (much reduced) parameter space. If you know the likelihood, just sample with replacement at random (from your sample) to propose parameters and accept with the standard metropolis hasting step. Even if it is not very efficient it should be computationally cheap so you can run a long chain and thin etc.. If you know the BUGS code but you are struggling with the likelihood you could use NIMBLE to calculate the loglikelihood example in Chapter 17
NimbleUserManual.pdf (r-nimble.org).
Philip