Functional Description

The mechanics of the TextGenerator tool can be divided into three steps.
  1. Identify symbols.
  2. Assemble combinations.
  3. Generate strings.

Identifying symbols

With any given input pattern, the tool parses the string to identify all symbols that match the criteria of this tool's syntax.
When all symbols have been found, they are separated in their two types; variables and references (see the nomenclature). Each token is then split up into lists of its members and are then ready to be used in the third step.

Assembling combinations

The pattern, when validated, is then used as the basis for creating a table with indices. This is the actual combinatorics, because this is where each variable's members (references are not participating in this step) are combined with the other variables and their members. This is solely an indexing operation; no string literals are used here.

Generating results

The third and final step is to use the input pattern and replace each variable with the variable's member for the current combination, as previously assigned when assembling indices.
All references are also replaced by the corresponding variable member (or conditional reference member).

Last edited Jul 8, 2010 at 9:21 AM by Reyhn, version 3


No comments yet.