Browse > Article

An Improved Incremental LL(1) Parsing Method  

Lee, Gyung-Ok (한신대학교 정보통신학과)
Abstract
Incremental parsing has been researched in the intention that the parse result of the original string is reused in the parsing of a new string. This paper proposes an improved method of the previous incremental LL(1) parser with nonterminal lookahead symbols. The previous work is time-inefficient because it repeatedly performs unnecessary steps when an error occurs. This paper gives a solution for the problem.
Keywords
incremental parsing; LL(1) parser; LL(1) grammar;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, vols. 1 & 2, Prentice- Hall, Englewood Cliffs, NJ, 1972, 1973.
2 S. Sippu and E. Soisalon-Soininen. Parsing Theory, vols. I & II, Springer, Berlin, 1990.
3 M.D. Schwartz, N.M. Delisle, and V.S. Begwani, "Incremental compilation in Magpie", Proc. SIGPLAN 84 Symp. On Compiler Construction, Montreal, Canada, 1984, ACM SIGPLAN Notices, vol.19, pp.122-131, 1984.
4 J.F. Beetem and A.F. Beetem, "Incremental scanning and parsing with Galaxy," IEEE Trans. Software Engineering, vol.17, pp.641-651, 1991.   DOI   ScienceOn
5 W. Yang, "An incremental LL(1) parsing algorithm," Information Processing Letters, vol.48, pp. 67-72, 1993.   DOI   ScienceOn
6 W. Li, "A simple and efficient incremental LL(1) parsing," Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics( SOFSEM '95). Lecture Notes in Computer Science, vol.1012, Springer, New York, pp. 399- 404, 1995.
7 W. Li, "Building efficient incremental LL parsers by augmenting LL tables and threading parse trees," Comput. Lang., vol.22, no.4, pp.225-235, 1996.   DOI   ScienceOn