The dependencies among variables in a PCFG are depicted graphically in Figure 1, which makes clear that the Gibbs sampler is highly parallelizable (just like the EM algorithm).
the parses t i are independent given θ and so can be sampled in parallel from the following distribution as described in the next section.