本文揭示了路径表达式与3型文法之间的一种等价关系。
This paper reveals an equivalent relationship between Path Expresson and Type 3 Grammer.
介绍了文法化简中消除无用符号和无用产生式的树型算法，并通过实例予以验证。
This paper introduces a new tree algorithm that is for deleting superfluous symbol and production in grammar, and gives a practical example to check the algorithm.
应用推荐