A Parsing Algorithm for Constructing Incremental Threaded Tree

Lee Dae-Sik

A Parsing Algorithm for Constructing Incremental Threaded Tree

Lee Dae-Sik, Journal of Internet Computing and Services, Vol. 7, No. 4, pp. 91-100, Aug. 2006
Full Text:

Keywords: Incremental Threaded Tree, Parsing Algorithm, Incremental Parsing algorithm

Abstract

The incremental parsing technique plays an important role in language-based environment which allows the incremental construction of a program. It improves the performance of a system by reanalyzing only the changed part of a program. The conventional incremental parsing uses the stack data structure in order to store the parsing information. In this paper, we suggest a threaded tree construction algorithm which parse by adding the threaded node address instead of using a stack data structure. We also suggest an incremental threaded tree construction which has incremental parsing process of five steps using the constructed threaded tree.

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article

[APA Style]

Dae-Sik, L. (2006). A Parsing Algorithm for Constructing Incremental Threaded Tree. Journal of Internet Computing and Services, 7(4), 91-100.

[IEEE Style]

L. Dae-Sik, "A Parsing Algorithm for Constructing Incremental Threaded Tree," Journal of Internet Computing and Services, vol. 7, no. 4, pp. 91-100, 2006.

[ACM Style]

Lee Dae-Sik. 2006. A Parsing Algorithm for Constructing Incremental Threaded Tree. Journal of Internet Computing and Services, 7, 4, (2006), 91-100.