×

zbMATH — the first resource for mathematics

On the space optimizing effect of eliminating single productions from LR parsers. (English) Zbl 0442.68085

MSC:
68N20 Theory of compilers and interpreters
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling, Vol. I: Parsing. Englewood Cliffs, N.J.: Prentice Hall 1972 · Zbl 0264.68032
[2] Aho, A.V., Ullman, J.D.: Optimization of LR(k) parsers. J. Comput. System Sci. 6, 573-602 (1972) · Zbl 0264.68032 · doi:10.1016/S0022-0000(72)80031-X
[3] Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling, Vol. II: Compiling. Englewood Cliffs, N.J.: Prentice Hall 1973 · Zbl 0309.68068
[4] Aho, A.V., Ullman, J.D.: A technique for speeding up LR(k) parsers. SIAM J. Computing 2, 106-127 (1973) · Zbl 0271.68013 · doi:10.1137/0202010
[5] Anderson, T.: Syntactical analysis of LR(k) languages. University of Newcastle upon Tyne, Computing Lab., England, Ph.D. Thesis, 1972
[6] Anderson, T., Eve, J., Horning, J.J.: Efficient LR(1) parsers. Acta Informat. 2, 12-39 (1973) · Zbl 0256.68007 · doi:10.1007/BF00571461
[7] Backhouse, R.C.: An alternative approach to the improvement of LR(k) parsers. Acta Informat. 6, 277-296 (1976) · Zbl 0358.68115 · doi:10.1007/BF00288658
[8] Demers, A.J.: Elimination of single productions and merging nonterminal symbols of LR(1) grammars. Comput. Lang. 1, 105-119 (1975) · Zbl 0362.68102 · doi:10.1016/0096-0551(75)90011-9
[9] DeRemer, F.L.: Practical translators for LR(k) languages. Project MAC, Mass. Inst. of Tech., Cambridge, Tech. Report MAC TR-65, October 1969
[10] DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14, 453-460 (1971) · Zbl 0225.68038 · doi:10.1145/362619.362625
[11] Joliat, M.L.: A simple technique for partial elimination of unit productions from LR(k) parsers. IEEE Trans. Comput. C-27 (Corresp.), 763-764 (1976) · Zbl 0331.68046
[12] Knuth, D.E.: On the translation of languages from left to right. Information and Control 8, 607-639 (1965) · Zbl 0231.68027 · doi:10.1016/S0019-9958(65)90426-2
[13] Koskimies, K., Soisalon-Soininen, E.: On a method for optimizing LR parsers. Internat. J. Comput. Math. 7, 287-295 (1979) · Zbl 0418.68067 · doi:10.1080/00207167908803181
[14] LaLonde, W.R.: An efficient LALR parser generator. Computer Systems Research Group, Univ. of Toronto, Tech. Report CSRG-2, 1971
[15] LaLonde, W.R.: On directly constructing LA(k)LR(m) parsers without chain productions. Department of Systems Engineering and Computing Science, Carleton Univ., Ottawa, Tech. Report No. SE and CS 76-9, 1976
[16] LaLonde, W.R.: On directly constructing LR(k) parsers without chain reductions. Conf. Record of the Third-ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 127-133 (1976)
[17] Pager, D.: A solution to an open problem by Knuth. Information and Control 17, 462-473 (1970) · Zbl 0217.22604 · doi:10.1016/S0019-9958(70)90379-7
[18] Pager, D.: On eliminating unit productions from LR(k) parsers. In: Automata, languages and programming, 2nd Colloquium (J. Loeckx, ed.), Lecture Notes in Computer Science, Vol. 14. Berlin Heidelberg New York: Springer 1974 · Zbl 0284.68013
[19] Pager, D.: Eliminating unit productions from LR parsers, Acta Informat. 9, 31-59 (1977) · Zbl 0357.68085 · doi:10.1007/BF00263764
[20] Rushby, J.M.: LR(k) sparse parsers and their optimization. Department of Computer Science, University of Newcastle upon Tyne, England, Ph. D. Thesis, September 1977
[21] Soisalon-Soininen, E.: Elimination of single productions from LR parsers in conjunction with the use of default reductions. Conf. Record of the Fourth ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 183-193 (1977)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.