摘要
本文介绍了对YACC的改进方法,解决了由于合并同心项而产生的归约/归约冲突问题。给出了改进后的确定自动机DFA的算法。改进的YACC巳在IBM PC/AST机上运行。
The method for improving YACC is introduced in the paper. The problem with reduce/reduce conflict problem generating i the case that the concentric terms are merged is solved. The constructed DFA algorithm is given. The improved YACC is run on IBM PC/AST computer.
出处
《吉林大学自然科学学报》
CAS
CSCD
1992年第2期36-41,共6页
Acta Scientiarum Naturalium Universitatis Jilinensis