• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/
Menu

A Threaded Tree Construction Algorithm not Using Stack


Lee Dae-Sik, Journal of Internet Computing and Services, Vol. 5, No. 5, pp. 119-128, Oct. 2004
Full Text:
Keywords: Threaded Tree, Stack, Parsing

Abstract

As, the development of language-based programming environment, a study on incremental parsing has become an essential part. The purpose of this paper is to show the more efficient incremental parsing algorithm than earlier one that demands parsing speed and memorizing space too much. This paper suggests the threaded tree construction algorithm not using stack. In addition, to remove the reparsing process, it proposes the algorithm for creation node and construction incremental threaded tree not using stack.


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. (2004). A Threaded Tree Construction Algorithm not Using Stack. Journal of Internet Computing and Services, 5(5), 119-128.

[IEEE Style]
L. Dae-Sik, "A Threaded Tree Construction Algorithm not Using Stack," Journal of Internet Computing and Services, vol. 5, no. 5, pp. 119-128, 2004.

[ACM Style]
Lee Dae-Sik. 2004. A Threaded Tree Construction Algorithm not Using Stack. Journal of Internet Computing and Services, 5, 5, (2004), 119-128.