A practical GLR parser generator for software reverse engineering

被引：7

作者：

Geng, Teng ^{[1
]}

Xu, Fu ^{[1
]}

Mei, Han ^{[1
]}

Meng, Wei ^{[1
]}

Chen, Zhibo ^{[1
]}

Lai, Changqing ^{[2
]}

机构：

[1] School of Information Science and Technology, Beijing Forestry University, Beijing

[2] Information Center of National Defense Science and Technology Industry Bureau, Beijing

来源：

Journal of Networks | 2014年 / 9卷 / 03期

关键词：

Error recovery; GLR; Parser generator; Parsing; Reverse engineering;

D O I：

10.4304/jnw.9.3.769-776

中图分类号：

学科分类号：

摘要：

Traditional parser generators use deterministic parsing methods. These methods can not meet the parsing requirements of software reverse engineering effectively. A new parser generator is presented which can generate GLR parser with automatic error recovery. The generated GLR parser has comparable parsing speed with the traditional LALR(1) parser and can be used in the parsing of software reverse engineering. © 2014 ACADEMY PUBLISHER.

引用

页码：769 / 776

页数：7

共 21 条

[1]

Reis A.J.D., Compiler Construction Using Java, JavaCC, and Yacc, Los Alamitos: Wiley-IEEE Computer Society Press, (2011)

[2]

Bison-GNU parser generator [EB/OL], (2012)

[3]

Tomita M., Generalized LR parsing, (2012)

[4]

Sippu S., Soisalen S.E., Parsing Theory, (2010)

[5]

David A.L., Ramming J.C., A*-A language for implementing language processors, IEEE transactions on Software Engineering, 21, 11, pp. 894-901, (1995)

[6]

Parkes A.P., Introduction to Languages, Machines and Logic: Computable Languages, Abstract Machines and Formal Logic., (2002)

[7]

Grune D., Jacobs C.J.H., Parsing Techniques: A Practical Guide (2nd edition)., (2010)

[8]

Nishida T.Y., An Extended Earley's Algorithm for Petri Net Controlled Grammars without Rules and Cyclic Rules, Theoretical Computer Science, 448, pp. 66-79, (2012)

[9]

Rekers J.G., Parser Generation for Interactive Environments, Netherlands: University of Amsterdam, (1992)

[10]

Adrian J., Elizabeth S., Giorgios E., Evaluating GLR parsing algorithms, Science of Computer Programming, 61, 3, pp. 228-244, (2006)

← 1 2 3 →