A study on the effectively optimized algorithm for an incremental attribute grammar


The KIPS Transactions:PartA, Vol. 8, No. 3, pp. 209-216, Sep. 2001
10.3745/KIPSTA.2001.8.3.209,   PDF Download:

Abstract

The effective way to apply incremental attribute grammar to a complex language process is the use of optimized algorithm. In optimized algorithm for incremental attribute grammar, the new input attribute tree should be exactly compared with the previous input attribute tree, in order to determine which subtrees from the old should be used in constructing the new one. In this paper the new optimized algorithm was reconstructed by analyzing the algorithm suggested by Carle and Pollock, and a generation process of new attribute tree d'copy was added. Through the performance evaluation for the suggested matching algorithm, the run time is approximately improved by 19.5%, compared to the result of existing algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 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
[IEEE Style]
J. C. Jang and H. H. Ahn, "A study on the effectively optimized algorithm for an incremental attribute grammar," The KIPS Transactions:PartA, vol. 8, no. 3, pp. 209-216, 2001. DOI: 10.3745/KIPSTA.2001.8.3.209.

[ACM Style]
Jae Chun Jang and Heui Hak Ahn. 2001. A study on the effectively optimized algorithm for an incremental attribute grammar. The KIPS Transactions:PartA, 8, 3, (2001), 209-216. DOI: 10.3745/KIPSTA.2001.8.3.209.