Frank DeRemer
Thomas Pennello
- 1 AHo, A.V., ANO JOHNSON, S.C. LR Parsing. Comput. Surv. 6, 2 (June 1974), 99-124. Google Scholar
- 2 AHO, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1976. Google Scholar
- 3 AHo, A.V., ANO ULLMAN, J.D. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977. Google Scholar
- 4 AHO, A.V., AND ULLMAN, J.D. The Theory of Parsing, Translation, and Compiling, vols. 1 and 2. Prentice-Hall, Englewood Cliffs, N.J., 1972. Google Scholar
- 5 ALPERN, B., CHANEY, M., FAY, M., PENNELLO, T., ANO RAOIN, R. Translator writing system for the Burroughs B5700. Computer and Information Sciences, Univ. California, Santa Cruz, Calif., 1976.Google Scholar
- 6 ANDERSON, T., Ev~, J., AND HORNINC, J. Efficient LR(1) parsers. Acta Inf. 2 (1973), 12-39.Google Scholar
- 7 BARRETT, W., AND COUCH, g. Compiler Construction: Theory and Practice. Science Research Associates, Chicago, II1., 1979. Google Scholar
- 8 BARRETT, W., MEYERS, R., AND ROBERTS, D.D. Systems programming language/300. General Systems Div., Hewlett-Packard Co., Cupertino, Calif., 1979.Google Scholar
- 9 DEREMER, F.L. Practical translators for LR(k) languages. Ph.D. dissertation, Dep. Electrical Engineering, Massachusetts Institute of Technology, Cambridge, 1969.Google Scholar
- 10 DEREMER, F.L. Simple LR(k) grammars. Commun. ACM 14, 7 (July 1971), 453-460. Google Scholar
- 11 DEREM~R, F. XPL distribution tape containing NQLALR translator writing system. Computer and Information Sciences, Univ. California, Santa Cruz, 1972.Google Scholar
- 12 DEREMER, F., AND PENNELLO, T.J. The MetaWareTM TWS User's Manual. MetaWare, 412 Liberty St., Santa Cruz, Calif., 1981.Google Scholar
- 13 DEREMER, F., PENNELLO, T.J., AND MEYERS, R. A syntax diagram for (preliminary) Ada. SIGPLAN Notices (ACM) 15, 7, 8 (July-Aug. 1980), 36-47. Google Scholar
- 14 EVE, J., AND KURKi-SuoNiO, R. On computing the transitive closure of a relation. Acta Inf. 8 (1977), 303-314.Google Scholar
- 15 JENSEN, K., ANO WIRTH, N. Pascal User Manual and Report, 2nd ed. Springer-Verlag, New York, 1974. Google Scholar
- 16 JOHNSON, S.C. YACC--Yet another compiler compiler. Tech. Rep. CSTR 32, Bell Labs., Murray Hill, N.J., 1974.Google Scholar
- 17 KNUTH, D.E. On the translation of languages from left to right. Inf. Control 8 (1965), 607-639.Google Scholar
- 18 KR~STENSEN, B.B., AND MADSEN, O.L. Diagnostics on LALR(k) conflicts based on a method for LR(k) testing. BIT, to appear.Google Scholar
- 19 KRISTENSEN, B.B., ANO MADSEN, O.L. Methods for computing LALR(k) lookahead. ACM Trans. Program. Lang. Syst. 3, I (Jan. 1981), 60-82. Google Scholar
- 20 LALONOE, W.R., LEE, E.S., ANO HORNING, J.j. An LALR(k) parser generator. In Proc. IFIP Congress 71. Elsevier Science, New York, pp. 151-153.Google Scholar
- 21 MCKEEMAN, W.M., HORNING, J.J., AND WORTMAN, D.B. A Compiler Generator. Prentice-Hall, Englewood Cliffs, N.J., 1970.Google Scholar
- 22 PAGER, D. The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency. Inf. Sci. 12 (1977), 19-42.Google Scholar
- 23 WATT, D.A. Personal communication, 1974.Google Scholar
- 24 WATT, D.A. Personal communication (class notes), 1976.Google Scholar
- 25 WETHERELL, C. A correction to DeRemer's SLR(1) parser constructor algorithm. Unpublished manuscript. Lawrence Livermore Labs., Livermore, Calif., 1977.Google Scholar
Index Terms
- Efficient Computation of LALR(1) Look-Ahead Sets
Recommendations
Efficient computation of LALR(1) look-ahead sets
20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A SelectionWe define two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets, and present an efficient algorithm to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, ...
Efficient computation of LALR(1) look-ahead sets
Proceedings of the 1979 SIGPLAN symposium on Compiler constructionWe define two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets, and present an efficient algorithm to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, ...
Efficient computation of LALR(1) look-ahead sets
SIGPLAN '79: Proceedings of the 1979 SIGPLAN symposium on Compiler constructionWe define two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets, and present an efficient algorithm to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, ...
Comments