Faster generation of LALR(1) parsers

[1] 李虎. GLR分析器自动生成及相关研究 .北京:北京航空航天大学计算机学院, 2006 Li Hu. On GLR parser generation and related issues . Beijing: School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, 2006(in Chinese) [2] Park J C H, Choe K M, Chang C H. A new analysis of LALR formalism[J]. ACM Transactions on Programming Languages and Systems, 1985, 7(1): 159-175 [3] Alfred V A,Ravi S,Jeffrey D U. Compilers: principles,techniques,and tools[M]. Beijing: China Post and Telecommunications Press, 2002 [4] Deremer F, Pennello T. Efficient computation of LALR(1) look-ahead sets[J]. ACMTOPLAS, 1982, 4(4): 615-649 [5] Sippu S, Soisalon-Soininen E. Parsing theory, Vol.II: LR( k ) & LL( k ) parsing[M]. Berlin: Springer-Verlag, 1990 [6] Donnelly C, Stallmen R. The Bison manual: using the YACC-compatible parser generator, for Bison version 1.875[M]. Boston: GNU Press, 2004 [7] Manuel Astudillo. GOLD parsing system .2007 . http://www.devincook.com/GOLDParser