摘要
有限自动机正则化是编译中的重要技术,文章针对现有有限自动机正则化方法的不足,分析了有限自动机正则化的本质,提出了一个新的有限自动机正则化方法。这个新的方法具有通用的特点。
Converting finite automation machine to regular expression is very important in compilers.However,the traditional ways for converting finite automation machine to regular expression are not powerful enough.This paper analyzes the basic idea for converting finite automation machine to regular expression,gives a new method, which is more general way for converting finite automation machine to regular expression.
出处
《四川理工学院学报（自然科学版）》
CAS
2005年第1期49-51,共3页
Journal of Sichuan University of Science & Engineering(Natural Science Edition)
关键词
有限自动机
正则化方法
编译
regular grammar
regular expression
finite automation machine
