Browse > Article

Grammar Classes Generating Single State Parsing Automata  

Lee, Gyung-Ok (한신대학교 정보통신학부)
Publication Information
Journal of KIISE:Software and Applications / v.41, no.7, 2014 , pp. 518-522 More about this Journal
Abstract
A single state parsing automaton has the characteristics of the decision of actions which do not depend on the history of the parsing paths but on the current state. The single state parsing automaton hence has the advantage of the reduced parsing time and a small memory requirement compared to those of the conventional LR automaton. However, currently, the grammar classes generating single state parsing automata have not been known. This paper deals with the grammar classes generating single state parsing automata; in addition, this paper gives the generating method of single state parsing automata of the grammar classes.
Keywords
parsing; single state parsing automaton; LR automaton; PLR grammars; extended PLR grammars;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G.-O. Lee, "Constructing a single state parsing automaton," Journal of KIISE: Software and Applications, vol.35, no.11, pp.701-705, 2008. (in Korean)
2 D. E. Knuth, "On the translation of languages from left to right," Information and Control, vol.8, pp.607- 623, 1965.   DOI
3 E. Soisalon-Soininen and E. Ukkonen, "A method for transforming grammars into LL(k) form," Acta Informatica, vol.12, pp.338-369, 1979.
4 G.-O. Lee and K.-M. Choe, "A powerful LL(k) covering transformation," SIAM J. Computing, vol.35, no.2, pp.359-377, 2006.
5 A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, vols.1 2. P. 1002, Englewood Cliffs, NJ: Prentice-Hall, 1972, 1973.
6 S. Sippu and E. Soisalon-Soininen, Parsing theory, vols. I and II. Berlin: Springer, 1990.