A class of functions with a finite number of return values is defined over combinatorial structures. We prove that the characterization of combinatorial structures by such a function is equivalent to a set of grammar productions and we show how to derive these productions from the body of the function. In the field of automatic average case analysis, this result allows the use of functions, which makes the description of algorithms more natural and smaller