[1] Cleverand L. A Program Understanding Support Environ- ment[J]. IBM Systems Journal, 1989, 28(2): 324-344.
[2] Nelson M L. A Survey of Reverse Engineering and Program Comprehension[EB/OL]. [2012-09-20]. http://www.arisa.se/ files/LL-03b.pdf.
[3] Free Software Foundation. Bison-GNU Parser Genera- tor[EB/OL]. [2012-10-12]. http://www.gnu.org/software/bison/.
[4] Sippu S, Soisalen-Soininen E. Parsing Theory[M]. Berlin, Germany: Springer, 1990.
[5] Warwick I, Neville C. A Generated Parser of C++[EB/OL]. [2012-08-25]. http://citeseerx.ist.psu.edu/viewdoc/download? doi=10.1.1.28.4282&rep=rep1&type=pdf.
[6] Capers J. The Year 2000 Software Problem——Quantifying the Costs and Assessing the Consequences[M]. New York, USA: ACM Press, 1998.
[7] Bernt K, Andreas W, Peter D, et al. Program Comprehension in Multi-language Systems[C]//Proceedings of the 5th Working Conference on Reverse Engineering. Honolulu, USA: [s. n.], 1998.
[8] Kienle H M, Muller H A. Leveraging Program Analysis for Web Site Reverse Engineering[C]//Proceedings of the 3rd International Workshop on Web Site Evolution. Florence, Italy: [s. n.], 2001.
[9] Parkes A. Introduction to Languages, Machines and Logic: Computable Languages, Abstract Machines and Formal Logic[M]. Berlin, Gremany: Springer, 2002.
[10] Unger S H. A Global Parser for Context-free Phrase Structure Grammars[J]. Communications of the ACM, 1968, 11(4): 240-247.
[11] Grune D, Jacobs C J H. Parsing Techniques: A Practical Guide[M]. New York, USA: Ellis Horwood, 1990.
[12] Brand M V D, Sellink A, Verhoed C. Current Parsing Techniques in Software Renovation Considered Harmful[C]// Proceedings of the 6th International Workshop on Program Comprehension. Ischia, Italy: [s. n.], 1998.
[13] Tomita M. Generalized LR Parsing[M]. Boston, USA: Kluwer Academic Publishers, 1991.
[14] Earley J. An Efficient Context-free Parsing Algorithm[J]. Communications of the ACM, 1970, 13(2): 94-102.
[15] Nozohoor F R. GLR Parsing for ε-grammars[M]. Amsterdam, Netherlands: Kluwer Academic Publishers, 1991.
[16] Rekers J. Parser Generation for Interactive Environments[D]. Amsterdam, Netherlands: University of Amsterdam, 1992.
[17] Aycock J D. Practical Earley Parsing and the SPARKs Toolkit[D]. Victoria, NewZealand: University of Victoria, 2001.
[18] 高仲仪, 金茂忠. 编译原理与编译程序构造[M]. 北京: 北京航空航天大学出版社, 1990.
[19] Lankhorst M M. An Empirical Comparison of Generalized LR Tables[C]//Proceedings of Workshop on Tomita’s Algorithm- extensions and Applications. Enschede, Netherlands: [s. n.], 1991.
[20] Ouyang Shih-Ting, Wu Pei-Chi, Wang Feng-Jian. Locating Free Positions in LR(k) Grammars[J]. Journal of Information Science and Engineering, 2002, 18(3): 411-423.
[21] Parr T J. Obtaining Practical Variants of LL(k) and LR(k) for k>1 by Splitting the Atomic k-tuple[D]. West Lafayette, USA: Purdue University, 1993.
[22] Aho A V, Sethi R, Ullman J D. Compilers, Principles, Techniques, and Tools[M]. [S. 1.]: Addison-Wesley, 1986.
[23] Johnson S C. YACC-Yet Another Compiler-compiler, Technical Report[M]. [S. 1.]: Bell Laboratories, 1975.
[24] Deremer F, Pennello T. Efficient Computation of LALR(1) Look-ahead Sets[J]. ACM Transactions on Programming Languages and Systems, 1982, 4(4): 615-649.
[25] 李 虎, 金茂忠, 许 福. VPGE: 一个LALR(1)分析器的可视化生成和断点调试系统[J]. 计算机研究与发展, 2007, 44(5): 823-828.
编辑 索书志