A Program optimized for fast mapping of Operator to Operand.

Interpretation

A Program is interpreted as a Lexicon by treating it as a sequence of Operator and Operand pairs that map Operators to Operands as follows:

An Operand following an Operator indicates a mapping from the Operator to the Operand.
An Operator without an Operand indicates that the system definition is to be used.
An Operand without an Operator defines the mapping for the empty Operator. When the Lexicon is used in an environment, this is treated as the default mapping, applied when looking up an Operator that is not explicitly included in the environment.
The last mapping wins; all others are insignificant.

Normalization

A Program is normalized as a Lexicon as follows:

Each Separator is removed, and a line Separator is inserted between each Operator and Operand pair.
In the case of duplicate mappings for an Operator, earlier mappings are disregarded and removed from the normalized form.