If( X, a) is a pair of symbols of any context free grammar, then there is at most one generalized precedence relation between X aad a.

• 指出基因表达式编程和仅含有单个非终结符的上下文无关文法在描述能力上是等价的。