Koskimies, Kai; Soisalon-Soininen, Eljas On a method for optimizing LR parsers. (English) Zbl 0418.68067 Int. J. Comput. Math. 7, 287-295 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 3 Documents MSC: 68N20 Theory of compilers and interpreters Keywords:eliminating single productions; Lr parsing; Slr parsing; optimization PDF BibTeX XML Cite \textit{K. Koskimies} and \textit{E. Soisalon-Soininen}, Int. J. Comput. Math. 7, 287--295 (1979; Zbl 0418.68067) Full Text: DOI References: [1] Aho A.V., The Theory of Parsing, Translation, and Compiling 1 (1972) [2] Aho A.V., The Theory of Parsing, Translation, and Compiling 2 (1973) [3] DOI: 10.1137/0202010 · Zbl 0271.68013 · doi:10.1137/0202010 [4] DOI: 10.1007/BF00571461 · Zbl 0235.68009 · doi:10.1007/BF00571461 [5] DOI: 10.1007/BF00288658 · Zbl 0358.68115 · doi:10.1007/BF00288658 [6] DOI: 10.1016/0096-0551(75)90011-9 · Zbl 0362.68102 · doi:10.1016/0096-0551(75)90011-9 [7] DeRemer F.L., Project MAC, Mass. Inst. of Tech (1969) [8] DOI: 10.1145/362619.362625 · Zbl 0225.68038 · doi:10.1145/362619.362625 [9] DOI: 10.1145/361227.361232 · Zbl 0318.68052 · doi:10.1145/361227.361232 [10] LaLonde W.R., Computer Systems Research Group (1971) [11] LaLonde W.R., Department of Systems Engineering and Computing Science 76 (1976) [12] 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. pp.127–133. [13] Pager D., Automata, Languages and Programming. Second Colloquium (1974) [14] DOI: 10.1007/BF00263764 · Zbl 0349.68009 · doi:10.1007/BF00263764 [15] Rushby J.M., Department of Computer Science (1977) [16] SoisalonSoininen, E. 1977. 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. 1977. pp.183–193. 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.