All sentences of CFL are partitioned into subsets by heaps,hierarchies,clusters and cuboids.It has a time bound proportional to(where is the length of the sentence enumerated).

• 通过堆、层、簇和长方体将句子划分为有穷集合序列,该算法的时间效率为,是被枚举句子的长度。