DocumentCode
2220485
Title
A Simplification Algorithm of Regular Grammar Production
Author
Zhu Gejun ; Sun Yuqiang ; Yang Ruimin ; Gu Yuwan
Author_Institution
Inf. Eng., Changzhou Inst. of Mechatron. Technol., Changzhou, China
fYear
2009
fDate
26-28 Dec. 2009
Firstpage
4688
Lastpage
4691
Abstract
The Production quality of regular grammar influences the efficiency of lexical analysis. The paper puts up a new algorithm, in which can get more simple production equal to grammar for given right (left) liner grammar. Firstly, translate grammar production´s simplification into the renovation of finite automata. Then, make the string length of each arc is small than 2 by algorithm about automata. At last, verify the transition process with an instance.
Keywords
finite automata; lexical analysis; production quality; regular grammar production; simplification algorithm; transition process; Algorithm design and analysis; Automata; Information analysis; Information science; Mechatronics; Production systems; Programming environments; Software algorithms; Sun;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Engineering (ICISE), 2009 1st International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-4909-5
Type
conf
DOI
10.1109/ICISE.2009.163
Filename
5455044
Link To Document