DocumentCode
2041241
Title
Parallel Transition from Regular Expressions to Follow Automata
Author
Su Yuqiang ; Gu Yuwan ; Yang Ruimin ; Lu Jieru
Author_Institution
Sch. of Inf. Sci. & Eng., Jiangsu Polytech. Univ., Changzhou
fYear
2009
fDate
23-24 May 2009
Firstpage
1
Lastpage
4
Abstract
Constructing smaller nondeterministic finite automata of Regular Expressions is key technique in the fields of compiler science. The whole progress of parallel transition from regular expressions to Follow automata is analyzed in the paper, and a parallel transition algorithm with the middle structure of Thompson automata and Glushkov automata is proposed. The thesis describes whole design and implementation in detail, and simulates its parallel translation progress with an instance.
Keywords
automata theory; parallel algorithms; Glushkov automata; Thompson automata; compiler science; follow automata; middle structure; nondeterministic finite automata; parallel transition algorithm; regular expressions; Algorithm design and analysis; Automata; Computer science; Concurrent computing; Data structures; Educational institutions; Information science; Information technology; Parallel processing; Sun;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3893-8
Electronic_ISBN
978-1-4244-3894-5
Type
conf
DOI
10.1109/IWISA.2009.5072996
Filename
5072996
Link To Document