An experiment is reported that combines the use of a heuristic search and a tree systems inference technique to induce context-free relational grammars that generate patterns in the style embodied in a sample set. This is achieved by searching for concise structural representations of each pattern in a sample set and discovering regularities in their tree systems representation. The knowledge induced is represented as an accepting tree systems automation and generative grammar, and is used to classify extant patterns and generate novel ones. Examples are given to illustrate the methodology, and to lend support to the hypothesis that the style of a pattern can be partially characterized by a unique generative process