An Efficient Incremental Parsing for LR Parsers


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 6, pp. 1660-1669, Jun. 1998
10.3745/KIPSTE.1998.5.6.1660,   PDF Download:

Abstract

In this paper, we review the conventional incremental parsing algorithms which are too expensive in time and memory space to be of practical use, and we propose an incremental LR parsing algorithm which is more efficient than the previous ones. We apply an extended LR parsing table including grammar symbols to our incremental LR parsing algorithm. We show that the parsing steps and memory spaces in our incremental LR parsing algorithm are reduced in several sentences. Our algorithm is more effective in the case of complex and large grammars.


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]
A. H. Hak, "An Efficient Incremental Parsing for LR Parsers," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 6, pp. 1660-1669, 1998. DOI: 10.3745/KIPSTE.1998.5.6.1660.

[ACM Style]
Ahn Heui Hak. 1998. An Efficient Incremental Parsing for LR Parsers. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 6, (1998), 1660-1669. DOI: 10.3745/KIPSTE.1998.5.6.1660.