[1] The formalism was invented in 1962 by Lambert Meertens while developing a grammar for generating English sentences.
[2] Meertens also applied affix grammars to the description and composition of music, and obtained a special prize from the jury at the 1968 International Federation for Information Processing (IFIP) Congress in Edinburgh for his computer-generated string quartet, Quartet No.
The ranges of allowable values for affixes can be described with context-free grammar rules.
However, it turns out that, even though affix values can only be manipulated with string concatenation, this formalism is Turing complete; hence, even the most basic questions about the language described by an arbitrary 2VW grammar are undecidable in general.
Another possibility is to allow the values of affixes to be computed by code written in some programming language.