Study on the Automation Method of Regular Expression to Finite Automaton

Article Preview

Abstract:

Regular expression was the foundation of advanced language and compiler. It can be recognized by finite automaton. In this paper, combined with operator priority analysis and the rules of regular expression, the table of priority relationship between operators involved in regular expression has be constructed. Based on the table, realized the automatic convert from regular expression to finite automaton, and the program is given. It provided a new reference of regular expression convert to finite automaton.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1493-1496

Citation:

Online since:

October 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jiang Zongli, Jiang shouxu. Formal Languages and Automata Theory(Second Edition) [M]: Tsinghua University Press,(2007).

Google Scholar

[2] WU Xiao-jun; GU Jian-hua; ZHOU Xing-she. Prioritized Operators Algorithm Based Logic Expression Validity Judgement [J]. Mini-micro Systems, 2002, 23(10) : 1189-1192.

Google Scholar

[3] Dai Zuxu, Liu Jiding. Dealing with Syntactic Bracket in Operand_ First Syntax Analysis [J]. Journal of Wuhan University of Technology, 2003, 25(11): 100-102.

Google Scholar

[4] ZHANG Zhiyuan. Regular Expression to NFA Based on Syntax-Directed Translation [J]. Computer Engineering, 2005, 31(7): 138-139.

Google Scholar

[5] Chen Huowang. Program language compiles principle (Third Edition) [M]. National Defence Industry Press,(2000).

Google Scholar