A binary-branching (Chomsky adjunction) grammar can generate an unlimited number of adjuncts with very few rules.
for example, the following grammar generates any sequence VP → V NP PP*: the Penn Treebank style would create a new rule for each number of PPs seen in training data.