Browse > Article
http://dx.doi.org/10.5626/JOK.2015.42.3.361

A One-Gap Parsing with Extended PLR(1) Grammars  

Lee, Gyung-Ok (Hanshin Univ.)
Publication Information
Journal of KIISE / v.42, no.3, 2015 , pp. 361-366 More about this Journal
Abstract
Gap parsing is an algorithm for parsing incomplete input strings which include some gaps. Gap parsing is different from conventional parsing, and as known results, one-gap parsing algorithms for arbitrary context-free grammar and LL(1) grammar have $O(n^3)$ and $O(n^2)$ time complexity, respectively. This paper presents a one-gap parsing algorithm for extended PLR(1) grammars. Extended PLR(1) grammars are the class of grammars smaller than LR(1) but much larger than LL(1). The one-gap parsing algorithm of the grammar class is shown to have the time complexity of $O(n^2)$, which is equal to the complexity of one-gap parsing algorithms for LL(1) grammars.
Keywords
parsing; gap parsing; LL grammars; extended PLR grammars;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 G.-O. Lee and K.-M. Choe, "A powerful LL(k) covering transformation," SIAM J. Computing, Vol. 35, No. 2, pp. 359-377, 2006.   DOI
2 G.-O. Lee, "Grammar classes generating single state parsing automata," Journal of KIISE: Software and Applications, Vol. 41, No. 7, pp. 518-522, 2014. (in Korean)
3 D. E. Knuth, "On the translation of languages from left to right," Information and Control, Vol. 8, pp. 607-623, 1965.   DOI
4 A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vols. 1 & 2, Prentice- Hall, Englewood Cliffs, NJ, 1972, 1973.
5 S. Sippu and E. Soisalon-Soininen, Parsing Theory, Vols. I & II, Springer, Berlin, 1990.
6 E. Bertsch and M.-J. Nederhof, "Gap parsing with LL(1) grammars," Grammars, Vol. 8, pp. 1-16, 2005.
7 E. Bertsch, "An asymptotically optimal algorithm for non-correcting LL(1) error recovery," Bericht nr. 176, Fakultat fur Mathematik, Ruhr-Universitat Bochum, Apr. 1994.
8 H. Richter, "Noncorrecting syntax error recovery," ACM Transactions on Programming Languages and Systems, Vol. 7, No. 3, pp. 478-489, Jul. 1985.   DOI
9 G.V Cormack, "An LR substring parser for noncorrecting syntax error recovery," SIGPLAN Notices, Vol. 24, No. 7, pp. 161-169, 1989.   DOI
10 B. van Deudekom and P. Kooiman, "Top-down noncorrecting error recovery in LLgen," Report IR-338, Vrije Universiteit Amsterdam, 1993.
11 J. Bates and A. Lavie, "Recognizing substrings of LR(k) languages in linear time," ACM Transactions on Programming Languages and Systems, Vol. 16, No. 3, pp. 1051-1077, 1994.   DOI
12 M.-J. Nederhof and E. Bertsch, "Linear-time suffix parsing for deterministic languages," Journal of the ACM, Vol. 43, No. 3, pp. 524-554, 1996.   DOI