[1]王文义,张行进,张影..算法与一类等价文法的制约关系[J].郑州大学学报(工学版),1999,20(03):13-15.[doi:10.3969/j.issn.1671-6833.1999.03.005]
　WANG Wenyi,Zhang Xingjin,Zhang Ying.The constraint relationship between the algorithm and a class of equivalent grammars[J].Journal of Zhengzhou University (Engineering Science),1999,20(03):13-15.[doi:10.3969/j.issn.1671-6833.1999.03.005]
点击复制

算法与一类等价文法的制约关系()
分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
20卷
期数:
1999年03期
页码:
13-15
栏目:
出版日期:
1999-01-01

文章信息/Info

Title:
The constraint relationship between the algorithm and a class of equivalent grammars
作者:
王文义; 张行进; 张影.
郑州工业大学电气信息工程学院,河南,郑州,450002
Author(s):
WANG Wenyi; Zhang Xingjin; Zhang Ying
关键词:
等价文法;  优先关系矩阵;  算符优先分析算法
Keywords:
equivalent grammar;  priority relationship matrix;  Operator-first analysis algorithm
DOI:
10.3969/j.issn.1671-6833.1999.03.005
文献标志码:
A
摘要:
存在着一类文法,虽然它们接受的是相同的语言,但却不能被算符优先分析算法所识别.针对问题产生的原因提出改进方法,该方法要求对文法中的产生式顺序加以限制,即文法除了必需满足算符文法的既定条件以外,还应保持文法中各产生式左部的文法变量必需是可区分的.
Abstract:
There is a class of grammars that accept the same language but cannot be recognized by operator-first analysis algorithms. An improved method is proposed to address the cause of the problem, which requires limiting the order of generators in grammar, that is, in addition to satisfying the established conditions of the arithmetic grammar, the grammar variables on the left part of each generator in the grammar must be distinguishable.

更新日期/Last Update: 1900-01-01