In the case of recursive grammars, there is no problem with the stickbreaking representation and the order by which we enumerate the nonterminals.
in §4 we give an empirical comparison of the algorithm to MCMC inference and describe a novel application of adaptor grammars to unsupervised dependency parsing.