The constraint relationship between the algorithm and a class of equivalent grammars
[1]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]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
20
Number of periods:
1999 No.03
Page number:
13-15
Column:
Public date:
1999-01-01
- Title:
- The constraint relationship between the algorithm and a class of equivalent grammars
- CLC:
- -
- DOI:
- 10.3969/j.issn.1671-6833.1999.03.005
- 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.
- References:
- -
- Similar References:
Memo
-
Last Update:
1900-01-01