Skip header Section
Skip Bibliometrics Section
Compiler construction: an advanced courseJanuary 1974
- Authors:
- F. L. Bauer,
- F. L. De Remer,
- M. Griffiths,
- U. Hill,
- J. J. Horning,
- C. H. A. Koster,
- W. M. McKeeman,
- P. C. Poole,
- W. M. Waite,
- Editor:
- J. Eickel,
- Series Editors:
- G. Goos,
- J. Hartmanis
Skip Abstract Section
Abstract
The Advanced Course took place from March 4 to 15, 1974 and was organized by the Mathematical Institute of the Technical University of Munich and the Leibniz Computing Center of the Bavarian Academy of Sciences, in co-operation with the European Communities, sponsored by the Ministry for Research and Technology of the Federal Republic of Germany and by the European Research Office, London.
Skip Table Of Content Section
Chapters
- Bratman, H., An alternate form of the UNCOL diagram, CACM 4 (March 1961), 142.Google Scholar
Digital Library
- DeRemer, F. L., Practical translators for LR(k) languages, Ph.D. Thesis, MIT, Cambridge, Massachusetts (1969).Google Scholar
- DeRemer, F. L., Transformational grammars for languages and compilers, TR50, Computing Laboratory, University of Newcastle-on-Tyne, England (submitted for publication).Google Scholar
- Evans, A., PAL, A language for teaching programming linguistics, Proc. 23rd National Conf. of the ACM (1968) 395--403.Google Scholar
- Feldman, J. A., A formal semantics for computer languages and its application in a compiler-compiler, CACM 9 (January 1966).Google Scholar
- Gries, D., Compiler construction for digital computers, John Wiley & Sons (1971) 452.Google Scholar
- Knuth, D. E., Semantics of context-free languages, Math Systems Theory J., 2 No. 2 (1968) 127--146.Google Scholar
- Louis, P. M. and Sterns, R. E., Syntax-directed transduction, JACM 15, No. 3 (July 1968) 465--493.Google Scholar
- Lucas, P., Die strukturanalyse van formelubersetzern, Elektron. Rechenanl, 3 (1961) 159--167.Google Scholar
- McClure, R. M., An appraisal of Compiler Technology, Proc. SJCC (1972) 1--9.Google Scholar
- McKeeman, W. M., Compiler Structure, Proc. USA-Japan Computer Conference, Tokyo (October 1972) 448--455.Google Scholar
- McKeeman, W. M. and DeRemer, F. L., Feedback-free modularization of compilers, Proc. Third Congress on Programming Languages, Kiel (March 1974).Google Scholar
- McKeeman, W. M., Horning, J. J., Wortman, D. B., A compiler generator, Prentice Hall (1970).Google Scholar
- Parnas, D. L., Information distribution aspects of design methodology, Computer Software, IFIP (1971) 26.Google Scholar
- van Wijngaarden, A. (ed.), Report on the algorithmic language algol 68, Numerische Mathematick 14 (1969).Google Scholar
- Wilner, W. T., Declarative semantic definition, STAN-CS-233-71, Ph.D. Thesis, Stanford, California (1971).Google Scholar
- Wirth, The programming language PASCAL, Acta Informatica, 1, 1.Google Scholar
- Wozencraft, J. M. and Evans, A., Notes on programming linguistics, Dept. E.E., MIT, Cambridge, Massachusetts (1971).Google Scholar
- Aho, A. V., Ullman, J. D.: The theory of parsing, translation, and compiling. Englewood Cliffs (N.J.): Prentice-Hall 1972Google Scholar
- DeRemer, F. L.: Practical translators for LR(k) languages. Ph.D. Thesis, M.I.T. Cambridge (Mass.) 1969Google Scholar
- Earley, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94--102 (1970)Google Scholar
- Eickel, J., Paul, M., Bauer, F. L., Samelson, K.: A syntax controlled generator of formal language processors. Comm. ACM 6, 451--455 (1963)Google Scholar
- Feldman, J. A., Gries, D.: Translator writing systems. Comm. ACM 11, 77--113 (1968)Google Scholar
- Floyd, R. W.: On ambiguity in phrase-structure languages. Comm. ACM 5, 526 (1962)Google Scholar
- Floyd, R. W.: Syntactic analysis and operator precedence. J. ACM 10, 316--333 (1963)Google Scholar
- Floyd, R. W.: The syntax of programming languages - a survey. IEEE Trans. Electronic Computers 13, 346--353 (1964)Google Scholar
- Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969Google Scholar
- Ichbiah, J., Morse, S.: A technique for generating almost optimal Floyd-Evans productions of precedence grammars. Comm. ACM 13, 501--508 (1970)Google Scholar
- Knuth, D. E.: On the translation of languages from left to right. Information and Control 8, 607--639 (1965)Google Scholar
- Lewis, P. M., Stearns, R. E.: Syntax-directed transductions. J. ACM 15, 465--488 (1968)Google Scholar
- McKeeman, W. M.: An approach to computer language design. Ph.D. Thesis, Stanford University 1966Google Scholar
- Wirth, N., Weber, H.: EULER - A generalization of ALGOL and its definition. Comm. ACM 9, 13--25, 89--99 (1966)Google Scholar
- K. Alber- P. Oliva- G. Urschler Concrete Syntax of PL/1 IBM Vienna Laboratory, TR 25.084, 1968Google Scholar
- J. W. Backus et al Report on the Algorithmic Language ALGOL 60 CACM, Vol.3, N°5, May 1960Google Scholar
- M. Berthaud- M. Griffiths Incremental Compilation and Conversational Interpretation Ann. Rev. in Aut. Prog., 7, 1973Google Scholar
- J. Bordier Methodes pour la mise au point de grammaires LL(1) Thesis, University of Grenoble, 1971Google Scholar
- M. E. Conway Design of a Separable Transition Diagram Compiler CACM, Vol.6, N°7, July 1963Google Scholar
- I. F. Currie, M. Griffiths A Self-Transferring Compiler R.R.E. Malvern, Memo 2358, 1957Google Scholar
- J. M. Foster A Syntax Improving Device Computer Journal, May 1968Google Scholar
- S. A. Greibach Formal Parsing Systems CACM, Vol.7, N°8, Aug. 1964Google Scholar
- S. A. Greibach A New Normal Form Theorem for Context-Free Phrase Structure Grammars JACM, 12, pps. 42--52, 1965Google Scholar
- M. Griffiths Analyse Déterministe et Compilateurs Thesis, University of Grenoble, Oct. 1969Google Scholar
- M. Griffiths- G. Terrine Submitted for publication, 1974Google Scholar
- D. E. Knuth Top-Down Syntax Analysis Acta Informatica, Vol.1, pp. 79-110, 1971Google Scholar
- R. Kurki- Suonio Notes on Top-Down Languages BIT 9, N°3, 1969Google Scholar
- P. Lucas Die Struckturanalyse vom Formelübersetzen Elektron. Rechenanl. 3, 1961Google Scholar
- D. J. Rosenkrantz, R. E. Stearns Properti es of Deterministic Top-Down Grammars ACM Symposium, Marina del Rey, 1969Google Scholar
- A. Salomaa Theory of Automata Pergamon, 1969Google Scholar
- S. Warshall A Theorem on Boolean Matrices JACM, Vol.9, N°I, Jan. 1962Google Scholar
- P. M. Woodward- P. R. Wetherall- B. Gorman Official Definition of CORAL 66 H.M.S.O. London, 1970Google Scholar
- Aho, A. V., Johnson, S. C.: LR parsing. Computing Surveys (to appear 1974).Google Scholar
- Aho, A. V., Ullman, J. D.: The theory of parsing, translation and compiling. Volume 1: Parsing 1972. Volume 2: Compiling 1973. Prentice-Hall.Google Scholar
- Aho, A. V., Ullman, J. D.: Optimization of LR(k) parsers. J. Computer and System Sciences 6, 6 573--602 (1972).Google Scholar
- Aho, A. V., Ullman, J. D.: A technique for speeding up LR(k) parsers. SIAM J. Computing 2, 2 106--127 (1973).Google Scholar
- Anderson, T., Eve, J., Horning, J. J.: Efficient LR(1) parsers. Acta Informatica 2, 12--39 (1973).Google Scholar
- DeRemer, F. L.: Simple LR(k) grammars. Comm. ACM 14, 453--460 (1971).Google Scholar
- Feldman, J. A., Gries, D.: Translator writing systems. Comm. ACM 11, 77--113 (1968).Google Scholar
- Joliat, M. L.: On the reduced matrix representation of LR(k) parser tables. University of Toronto, Computer Systems Research Group Techn. Rep. CSRG-28, 1973.Google Scholar
- Knuth, D. E.: On the translation of languages from left to right. Information and Control 8, 607--639 (1965).Google Scholar
- Lalonde, W. R.: An efficient LALR parser generator. University of Toronto, Computer Systems Research Group Tech. Rep. CSRG - 2, 1971.Google Scholar
- McKeeman, W. M., Horning, J. J., Wortman, D. B.: A compiler generator. Prentice-Hall 1970.Google Scholar
- Pager, D.: A solution to an open problem by Knuth. Information and Control 17, 462--473 (1970).Google Scholar
- Wirth, N., Weber, H.: Euler: a generalization of Algol 60 and its formal description. Comm. ACM 9, 13--25, 89--99 (1966).Google Scholar
- DeRemer, F. L.: Transformational grammars for languages and compilers, Technical Report No. 50, Computing Laboratory, University of Newcastle upon Tyne, England, July 1973Google Scholar
- Early, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94--102 (1970)Google Scholar
- Gries, D.: Compiler construction for digital computers. New York: John Wiley and Sons 1971Google Scholar
- Hopcroft, J. E., Ullman, J. D.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969Google Scholar
- Johnson, W. R., Porter J. S., Ackley S. I., Ross D. T.: Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11, 805--813 (1968)Google Scholar
- Kleene, S.: Representation of events in nerve-sets. In: Automata Studies, Princeton (N.J.): Princeton Univ. Press 1956, pp. 3--42Google Scholar
- Aho, A. V., Ullman, J. D.: The theory of parsing, translation, and compiling. Englewood Cliffs (N.J.): Prentice-Hall 1972Google Scholar
- Chomsky, N.: On certain formal properties of grammars. Information and Control 2 (2), pp. 137--167, 1959Google Scholar
- DeRemer, F. L.: Simple LR(k) grammars. Comm. ACM 14 (7), pp. 453--460, 1971Google Scholar
- DeRemer, F. L.: Transformational grammars for languages and compilers. Technical Report No. 50, Computing Laboratory. University of Newcastle upon Tyne, England, July, 1973Google Scholar
- Evans, Jr., A.: A language designed for teaching programming linguistics. Proc ACM 23rd Natl. Conf., Princeton, NJ, pp. 395--403, 1968Google Scholar
- Feldman, J. A., Gries, D.: Translator writing systems. Comm. ACM 11 (2), pp. 77--113, 1968Google Scholar
- Ginsburg, S., Partee, B.: A mathematical model of transformational grammars. Information and Control 15 (4), pp. 297--334, 1969Google Scholar
- Hennie, F. C.: Finite-state models for logical machines. John Wiley & Sons, NY, 1968Google Scholar
- Johnson, W. R., Porter J. S., Ackley S. I., Ross D. T.: Automatic generation of efficient lexical processors using finite state techniques. Comm. ACM 11, 805--813 (1968)Google Scholar
- Kimball, J.: The formal theory of grammar. Prentice-Hall, Englewood Cliffs, NJ, 1973Google Scholar
- Knuth, D. E.: On the translation of languages from left to right. Information and Control 8 (October), pp. 607--639, 1965Google Scholar
- Knuth, D. E.: Semantics of context-free languages. Mathematical Systems Theory 2 (2), pp. 127--146, 1968Google Scholar
- Knuth, D. E.: An empirical study of FORTRAN programs. Software Practice and Experience 1 (2), pp. 105--134, 1971Google Scholar
- Lewis, P. M., Stearns, R. E.: Syntax-directed transduction. J. Assoc. Comp. Mach. 15, 1968Google Scholar
- Peters, P. S., Ritchie, R. W.: On the generative power of transformational grammars. Info. Sci. 6, 1973Google Scholar
- Rosen, B. K.: Tree-manipulation systems and Church-Rosser theorems. J. Assoc. Comp. Mach. 20 (1), pp. 160--187, 1973Google Scholar
- Rounds, W. C.: Mappings and grammars on trees. Mathematical Systems Theory 4 (3), pp. 257--287, 1971Google Scholar
- Wozencraft, J. M., Evans, Jr., A.: Notes on programming linguistics. Dept. of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, MA 1969Google Scholar
- G. V. Bochmann, Semantics evaluated from left to right, Publ 135, department d'Informatique, Université de Montreal (1973).Google Scholar
- M. Griffiths, Relationship between Definition and Implementation of a language, in: Advanced Course on Software Engineering, Springer Verlag, 1973.Google Scholar
- D. Knuth, Semantics of Context-Free Languages, Math. Systems Theory 2 (1968).Google Scholar
- P. M. Lewis, P. J. Rosenkrantz, R. E. Stearns, Attributed Translations, Proc. Fifth Annual ACM Symposium on Theory of Computing (1973).Google Scholar
- P. Naur (Editor), Revised Report on the Algorithmic Language ALGOL 60, Regnecentralen, Copenhagen (1962).Google Scholar
- Rosenkrantz et al., Compiler Design Theory, to appear at Prentice Hall, Englewood Cliffs, N.J. (1975).Google Scholar
- M. Sintzoff, Existence of a van Wijngaarden syntax for every recursive enumerable set, Ann. Soc. Sci. de Bruxelles, 81 (1967).Google Scholar
- M. Sintzoff, Grammaires superposées et autres systeGmes formels, presented at the Journée d'Etude sur l'analyse syntaxique, Paris (1969).Google Scholar
- R. Uzgalis, What every programmer should know about syntax, Lecture Notes UCLA (1972).Google Scholar
- A. van Wijngaarden, Orthogonal Design and description of a Formal Language, Mathematisch Centrum Report MR 76, Amsterdam (1965).Google Scholar
- A. van Wijngaarden (Editor), Report on the Algorithmic Language ALGOL 68, Numerische Mathematik, 14 (1969).Google Scholar
- A. van Wijngaarden (Editor), Almost the Revised Report on the Algorithmic Language ALGOL 68, WG 2.1 Working Paper (1973).Google Scholar
- ANSI: FORTRAN. X3.9-1966, American National Standards Institute 1966.Google Scholar
- Hext, J. B.: Programming Languages and Compiling Techniques. Ph.D. Dissertation, University of Cambridge 1965.Google Scholar
- Hext, J. B.: Compile-time type matching. Computer J. 9, 365--369 (1967).Google Scholar
- Hopgood, F. R. A.: Compiling Techniques. MacDonald, 1969.Google Scholar
- Jorrand, P.: Data types and extensible languages. SIGPLAN Notices 6, 75--83 (1971).Google Scholar
- Naur, P. (ed.): Revised report on the algorithmic language ALGOL 60. CACM 6, 1--17 (1963).Google Scholar
- Newey, M. C., Poole, P. C., Waite, W. M.: Abstract machine modelling to produce portable software. Software, Practice and Experience 2, 107--136 (1972).Google Scholar
- Scheidig, H.: Anpassungsoperationen in ALGOL 68. Ph.D. Dissertation, Technical University of Munich 1970.Google Scholar
- Scheidig, H.: Syntax and mode check in an ALGOL 68 compiler. In Peck, J. E. L. (ed.) ALGOL 68 Implementation. North-Holland 1971.Google Scholar
- van Wijngaarden, A. (ed.): Report on the algorithmic language ALGOL 68. Num. Math. 14, 29--218 (1969).Google Scholar
- Woessner, H.: Operatoridentifizierung in ALGOL 68. Ph.D. Dissertation, Technical University of Munich 1970.Google Scholar
- Woessner, H.: An identification of operators in ALGOL 68. In Peck, J. E. L. (ed.): ALGOL 68 Implementation. North-Holland 1971.Google Scholar
- ANSI: FORTRAN. X3.9-1966, American National Standards Institute 1966.Google Scholar
- Dunn, R. C.: SNOBOL4 as a language for bootstrapping a compiler. SIGPLAN Notices 8, 28--32 (1973).Google Scholar
- IBM: IBM System/360 Principles of Operation. Sixth Edition, IBM Corp. 1967.Google Scholar
- Iliffe, J. K.: Basic Machine Principles. Second Edition, MacDonald 1972.Google Scholar
- Naur, P. (ed.): Revised report on the algorithmic language ALGOL 60. CACM 6, 1--17 (1963).Google Scholar
- van Wijngaarden, A. (ed.): Report on the algorithmic language ALGOL 68. Num. Math. 14, 29--218 (1969).Google Scholar
- J. W. Backus et al. Report on the Algorithmic Language ALGOL60 CACM, Vol.3, N°5, May 1960Google Scholar
- E. W. Dijkstra ALGOL60 Translation Supplement, ALGOL Bulletin 10, 1960Google Scholar
- D. Gries Compiler Construction for Digital Computers Wiley, 1971Google Scholar
- M. Griffiths Languages Algorithmiques et Compilateurs Course Notes, University of Grenoble, 1971Google Scholar
- I. B. M. PL/1 Language Specifications IBM Form C28 - 6571, 1965Google Scholar
- B. Randell, L. J. Russell ALGOL60 Implementation Academic Press, 1964Google Scholar
- B. A. Wichmann ALGOL60 Compilation and Assessment Academic Press, 1973Google Scholar
- A. van Wijngaarden et al. Report on the Algorithmic Language ALGOL68 Num. Math. 14, pp. 79--218, 1969Google Scholar
- N. Wirth, C. A. R. Hoare A Contribution to the Development of ALGOL CACM, Vol.9, N° 6, June 1966Google Scholar
- Branquart, P., Lewi, J.: On the implementation of local names in ALGOL 68. MBLE Research Lab., Brussels, Report R121, 1969Google Scholar
- Branquart, P., Lewi, J.: A scheme of storage allocation and garbage collection for ALGOL 68. MBLE Research Lab., Brussels, Report R133, 1970Google Scholar
- Branquart, P., Lewi, J., Cardinael, J. P.: Local generators and the ALGOL 68 working stack. MBLE Research Lab., Brussels, Technical Note N62, 1970Google Scholar
- Fites, P. E.: Storage organization and garbage collection in ALGOL 68. In [12]Google Scholar
- Goos, G.: Eine Implementierung von ALGOL 68. TU München, Report Nr. 6906, 1969Google Scholar
- Goos, G.: Some problems in compiling ALGOL 68. In [13]Google Scholar
- Grau, A. A., Hill, U., Langmaack, H.: Translation of ALGOL 60. Handbook for Automatic Computation, Vol. 1/Part b. Berlin-Heidelberg-New York: Springer 1967Google Scholar
- Gries, D.: Compiler Construction for Digital Computers. New York: John Wiley & Sons 1971Google Scholar
- Hill, U., Scheidig, H., Wössner, H.: An ALGOL 68 Compiler. TU München. Internal Report, 1973Google Scholar
- Knuth, D. E.: The Art of Computer Programming, Vol. 1. Reading (Mass.): Addison-Wesley 1968Google Scholar
- Marshall, S.: An ALGOL 68 garbage collector. In [13]Google Scholar
- Peck, J. E. L. (Ed.): Proceedings of an Informal Conference on ALGOL 68 Implementation. University of British Columbia, Vancouver (B.C.) 1969Google Scholar
- Peck, J. E. L. (Ed.): ALGOL 68 Implementation. Amsterdam: North-Holland 1971Google Scholar
- van Wijngaarden, A., Mailloux, B. J., Peck, J. E. L., Koster, C. H. A.: Report on the Algorithmic Language ALGOL 68. Numerische Mathematik 14, 79--218 (1969)Google Scholar
- Wodon, P. L.: Methods of garbage collection for ALGOL 68. In [13]Google Scholar
- Arden, B. W., Galler, B. A., Graham, R. M.: The MAD definition facility. CACM 12, 432--439 (1969).Google Scholar
- Beatty, J. C.: Register assignment algorithm for generation of highly optimized object code. IBM J. Res. Dev. 18, 20--39 (1974).Google Scholar
- Capon, P. C., Morris, D., Rohl, J. S., Wilson, I. R.: The MU5 compiler target language and autocode. Computer J. 15, 109--112 (1972).Google Scholar
- Conway, R. W., Wilcox, T. R.: Design and implementation of a diagnostic compiler for PL/I. CACM 16, 169--179 (1973).Google Scholar
- Elson, M., Rake, S. T.: Code Generation Techniques for large-language compilers. IBM Systems J. 9, 166--188 (1970).Google Scholar
- IBM: IBM System/360 Principles of Operation. Sixth Edition, IBM Corp. 1967.Google Scholar
- IBM: IBM System/360 Operating System FORTRAN IV (H) Compiler Program Logic Manual, Fourth Edition, IBM Corp. 1968.Google Scholar
- Mealy, G. H.: A generalized assembly system. In Rosen, S. (ed.) Programming Systems and Languages. McGraw-Hill 1967.Google Scholar
- Naur, P.: The design of the GIER ALGOL compiler. Ann. Rev. in Automatic Programming 4, 49--85 (1964).Google Scholar
- van Wijngaarden, A. (ed.): Report on the algorithmic language ALGOL 68. Num. Math. 14, 29--218 (1969).Google Scholar
- Wilcox, T. R.: Generating Machine Code for High-Level Programming Languages. Ph.D. Thesis, Cornell University 1971.Google Scholar
- Barron, D. W.: Assemblers and Loaders. Second Edition, MacDonald 1972.Google Scholar
- Richards, D. L.: How to keep the addresses short. CACM 14, 346--348 (1971).Google Scholar
- Wilkes, M. V., Wheeler, D. J., Gill, S.: The Preparation of Programs for an Electronic Digital Computer. Second Edition, Addison-Wesley 1957.Google Scholar
- A. Brooker - D. Morris - J. S. Rohl The Compiler Compiler Ann. Rev. in Aut. Prog., 1962Google Scholar
- J. Feldman - D. Gries Translator Writing Systems CACM, Vol 11, N°2, Feb. 1968Google Scholar
- R. W. Floyd A Descriptive Language for Symbol Manipulation JACM, Vol. 8, April 1961Google Scholar
- R. W. Floyd Bounded Context Syntax Analysis CACM, Vol 7, N°2, Feb. 1964Google Scholar
- J. M. Foster - E. W. Elcock ABSYS 1: An Incremental Compiler for Assertions Machine Intelligence 4, Edinburgh Univ. Press, 1969Google Scholar
- M. Griffiths The Relationship between Language Definition and Implementation In Advanced Course in Software Engineering, Ed. F. L. Bauer. Notes in Economic and Mathematical System, Springer Verlag, 1973Google Scholar
- D. E. Knuth The Semantics of Context-Free Languages Mathematical Systems Theory, Vol.2, 1967Google Scholar
- P. Lucas - K. Walk On the Formal Definition of PL/1 Ann. Rev. in Aut. Prog., 1971Google Scholar
- M. Rain (editor) Machine-Oriented Languages Bulletin.Google Scholar
- S. A. Schumann Specifications de langages de Programmation et de leurs Traducteurs au moyen de Macros-Syntaxiques Proc. Congrès AFCET, 1970.Google Scholar
- Proceeding of the Extensible Languages Symposium SIGPLAN Notices, Aug. 1969.Google Scholar
- Proceedings of an Extensible Languages Symposium SlGPLAN Notices, Dec. 1971.Google Scholar
- W. L. van der Poel (editor) Proceedings of a Conference on Machine-Oriented Language, Trondheim, 1973 North Holland, 1974.Google Scholar
- N. Wirth, C. A. R. Hoare An Axiomatic Definition of the Programming Language PASCAL International School, Marktoberdorf, 1973.Google Scholar
- Crowe, D.: Generating parsers for affix grammars. Comm. ACM 15, 728--734 (1972)Google Scholar
- Bosch, R., Grune, D., Meertens, L.: ALEPH, a language encouraging program hierarchy. Proc. Intern. Computing Symposium Davos 1973. Amsterdam: North-Holland 1974, p. 73--79Google Scholar
- Koster, C. H. A.: Affix grammars. In: Peck, J. E. L. (ed.): ALGOL 68 implementation. Amsterdam: North-Holland 1971Google Scholar
- Koster, C. H. A.: A compiler compiler. Mathematisch Centrum Amsterdam, Report MR 127, 1971Google Scholar
- Koster, C. H. A.: Portable compilers and the UNCOL problem. In: Proc. of a Working Conference on Machine Oriented High Level Languages. Amsterdam: North-Holland 1974Google Scholar
- Calderbank, V. J., Calderbank, M.: LSD Manual. CLM-PDN 9/71, Culham Laboratory UKAEA, Abingdon, Berkshire (1971).Google Scholar
- Coleman, S. S., Poole, P. C., Waite, W. M.: The Mobile Programming System: Janus National Technical Information Center PB220322, U.S. Dept. of Commerce, Springfield, Va., 1973. (To appear in Software, Practice and Experience.)Google Scholar
- Dennis, J. B.: Modularity. Advanced Course on Software Engineering. Bauer, F. L. (ed.), Springer-Verlag, Berlin, 1973.Google Scholar
- USA Standard FORTRAN (USAS X3.9-1966), USA Standards Institute, New York, 1966.Google Scholar
- IBM FORTRAN IV (G) COMPILER, Program Logic Manual, 1967.Google Scholar
- Clarification of FORTRAN Standards: Initial Progress, CACM, 12 (May, 1969).Google Scholar
- Griffiths, M.: 4.A. Introduction to Compiler-Compilers, Advanced Course on Compiler Construction, 1974.Google Scholar
- Halstead, M. H.: Machine Independent Computer Programming, Spartan Books, Washington, D.C., 1962.Google Scholar
- Koster, C. H. A.: 4.B. Using the CDL Compiler-Compiler, Advanced Course on Compiler Construction, 1974.Google Scholar
- Poole, P. C., Waite, W. M.: A Machine Independent Program for the Manipulation of Text. Tech. Rept. 69-4. Computing Center, University of Colorado, 1969.Google Scholar
- Poole, P. C.: Hierarchical Abstract Machines. Proc. Culham Symposium on Software Engineering (April 1971).Google Scholar
- Poole, P. C., Waite, W. M.: Portability and Adaptability, Advanced Course on Software Engineering, Springer-Verlag, 81, 183--278 (1973).Google Scholar
- Richards, M.: BCPL: A Tool for Compiler Writing and Systems Programming, Proceedings of the Spring Joint Computer Conference, 34, 557--566 (1969).Google Scholar
- Richards, M.: The Portability of the BCPL Compiler, Software, Practice and Experience, 1, 135--146 (1971).Google Scholar
- Ross, D. T.: Introduction to Software Engineering with the AED-O Language, Report ESL-R-405, Softech (October 1969).Google Scholar
- Waite, W. M.: The STAGE2 Macroprocessor, Tech. Report 69-3-B, Computing Center, University of Colorado, 1969.Google Scholar
- Waite, W. M.: The mobile programming system: STAGE2. CACM, 13, 415--421 (July 1970).Google Scholar
- Waite, W. M.: Implementing Software for Non-Numeric Applications. Prentice-Hall, Englewood Cliffs, N.J., 1973.Google Scholar
- Weber, L. B.: A Machine Independent Pascal Compiler. MS Thesis, University of Colorado, Boulder, 1973.Google Scholar
- Wirth, N.: The Programming Language Pascal. Acta Informatica, 1, 35--63 (1971).Google Scholar
- Aron, J. D.: Estimating resources for large programming systems. In Buxton, J. N., Randell, B. (eds.): Software engineering techniques 68--79. NATO Science Committee, Brussels 1970.Google Scholar
- Baker, F. T., Mills, H. D.: Chief programmer teams. Datamation December 1973 58--61.Google Scholar
- Belady, L. A., Lehman, M. M.: Programming system dynamics or the meta-dynamics of systems in maintenance and growth. IBM Research Report RC3546, Yorktown Heights, 1971.Google Scholar
- Bemer, R. W.: Checklist for planning software system production. In Naur, P., Randell, B. (eds.): Software engineering 165--180. NATO Science Committee, Brussels 1969.Google Scholar
- Conway, M. E.: Design of a separable transition-diagram compiler. Comm ACM 6, 7 396--408 (1963).Google Scholar
- Conway, M. E.: How do committees invent? Datamation April 1968.Google Scholar
- Dahl, O.-J., Dijsktra, E. W., Hoare, C. A. R.: Structured programming. Academic Press 1972.Google Scholar
- Feldman, J. A., Gries, D.: Translator writing systems. Comm ACM 11 2 77--113 (1968).Google Scholar
- Graham, R. M.: Performance prediction. In Bauer, F. L. (ed.): Advanced course on software engineering 395--463. Springer-Verlag 1973.Google Scholar
- Gries, D.: Compiler construction for digital computers. John Wiley & Sons, Inc. 1971.Google Scholar
- Liskov, B. H.: A design methodology for reliable software systems. Proc FJCC 41 191--199 (1972).Google Scholar
- McClure, R. M.: An appraisal of compiler technology. Proc SJCC 40 1--9 (1972).Google Scholar
- McKeeman, W. M.: Peephole optimisation. Comm ACM 8 443--444 (1965).Google Scholar
- McKeeman, W. M., Horning, J. J., Wortman, D. B.: A compiler generator. Prentice-Hall 1970.Google Scholar
- Metzger, P. W.: Managing a programming project. Prentice-Hall 1973.Google Scholar
- Mills, H. D.: Mathematical foundations of structured programming. IBM Federal Systems Division, Report FSC72-6012, Gaithersburg 1972.Google Scholar
- Naur, P.: Programming by action clusters. BIT 9 3 250--258 (1969).Google Scholar
- Parnas, D. L.: Information distribution aspects of design methodology. Computer Software 26--31 IFIP Congress, Ljubljana 1971.Google Scholar
- Peck, J. E. L. (ed.): Algol 68 implementation. North Holland 1971.Google Scholar
- Poole, P. C.: Debugging and testing. In Bauer, F. L. (ed.): Advanced course on software engineering 278--318. Springer-Verlag 1973.Google Scholar
- Randell, B., Russell, L. J.: Algol 60 implementation. Academic Press 1964.Google Scholar
- SIGPLAN: Special issue on control structures in programming languages. SIGPLAN Notices 7 11 (1972).Google Scholar
- van der Poel, W. (ed.): Machine-oriented languages. Proceedings of an IFIP working conference, to appear 1974.Google Scholar
- Weinberg, G. M.: The psychology of computer programming. Van Nostrand 1971.Google Scholar
- Weinberg, G. M.: The psychology of improved programming performance. Datamation November 1972 82--85.Google Scholar
- Wirth, N.: Program development by stepwise refinement. Comm ACM 14 4 221--227 (1971).Google Scholar
- Zurcher, F. W., Randell, B.: Iterative multilevel modelling - a methodology for computer system design. Proc. IFIP Congress 1968 138--142.Google Scholar
- W. M. McKeeman, Algol 60 Reference Language Editor, Comm. ACM, Vol. 8, No. 1 November 1965, pg 667.Google Scholar
- W. M. McKeeman, An Approach to Computer Language Design, Ph.D. Thesis, Stanford University, April 1966.Google Scholar
- Aho, A. V., Johnson, S. C.: LR parsing. Computing Surveys (to appear 1974).Google Scholar
- Conway, R. W., Wilcox, T. R.: Design and implementation of a diagnostic compiler for PL/I. Comm ACM 16 169--179 (1973).Google Scholar
- Gordon, H. E.: Paragraphing computer programs: M.Sc. thesis, University of Toronto expected 1974.Google Scholar
- Graham, S. L., Rhodes, S. P.: Practical suntactic error recovery in compilers. Conference record of ACM symposium on principles of programming languages, Boston, 52--58 (1973).Google Scholar
- Gries, D.: Compiler construction for digital computers. John Wiley & Sons, Inc. 1971.Google Scholar
- Hoare, C. A. R.: The use of high level languages in large program construction. In Turski, W. M. (ed.): Efficient production of large programs. Warszawa 1971Google Scholar
- Holt, R. C., Wortman, D. B.: Structured subsets of PL/I. Computer Systems Research Group Technical Report CSRG-27. University of Toronto 1973.Google Scholar
- Koster, C. H. A.: Error reporting, error treatment, and error correction in Algol translation, part 1. Second annual conference of Gesellschaft für Informatik, Karlsruhe 1972.Google Scholar
- Leinius, R. P.: Error detection and recovery for syntax directed compiler systems. Ph.D. thesis, University of Wisconsin, Madison 1970.Google Scholar
- Morgan, H. L.: Spelling correction in system programs. Comm ACM 13 90--94 (1970)Google Scholar
- Poole, P. C.: Debugging and testing. In Bauer, F. L. (ed.): Advanced course on software engineering. Springer-Verlag, 1973.Google Scholar
- Satterthwaite, E.: Debugging tools for high level languages. Computer software - practice and experience 2 (1972).Google Scholar
- Wirth, N.: A programming language for the 360 computers. Journal ACM 15 37--74 (1968).Google Scholar
- Aho, A. V., Sethi, R., Ullman, J. D.: A formal approach to code optimization. SIGPLAN Notices 5. 86--100 (July, 1970).Google Scholar
- Aho, A. V., Ullman, J. D.: The theory of parsing, translation, and compiling. Prentice-Hall 1973.Google Scholar
- Allen, F. E.: Control flow analysis. SIGPLAN Notices 5, 1--19 (July, 1970).Google Scholar
- Allen, F. E.: A basis for program optimization. Information Processing 71, 385--391, North-Holland 1972.Google Scholar
- Allen, F. E., Cocke, J.: A catalogue of optimizing transformations. In Rustin, R. (Ed.): Design and Optimization of Compilers. Prentice-Hall 1972.Google Scholar
- ANSI: FORTRAN. X3.9-1966, American National Standards Institute 1966.Google Scholar
- Backus, J. W., Heising, W. P.: FORTRAN. IEEE Transactions EC-13, 382--385 (1964).Google Scholar
- Bagwell, J. T.: Local optimizations. SIGPLAN Notices 5, 52--66 (July, 1970).Google Scholar
- Bauer, F. L., Samuelson, K.: Comment in ALGOL Bulletin 10 (1961).Google Scholar
- Beatty, J. C.: Register assignment algorithm for generation of highly optimized object code. IBM J. Res. Develop. 18, 20--39 (1974).Google Scholar
- Clark, B. L., Horning, J. J.: Reflections on a language designed to write an operating system. ACM SIGPLAN/SIGOPS Interface Meeting, Savannah, 9--12 April 1973.Google Scholar
- Cocke, J.: Global common subexpression elimination. SIGPLAN Notices 5, 20--24 (July, 1970).Google Scholar
- Cocke, J., Schwartz, J. T.: Programming languages and their compilers: preliminary notes. New York University 1970.Google Scholar
- Earnest, C.: Some topics in code optimization. JACM 21, 76--102 (1974).Google Scholar
- Forsythe, A. I., Keenan, T. A., Organick, E. I., Stenberg, W.: Computer science: a first course. John Wiley 1969.Google Scholar
- Frailey, D. J.: Expression optimization using unary complement operators. SIGPLAN Notices 5, 67--85 (July, 1970).Google Scholar
- GE: GE-400 Series Basic Language. CPB-1470 (1968).Google Scholar
- Gear, C. W.: High speed compilation of efficient object code. CACM 8, 483--488 (1965).Google Scholar
- Gries, D.: Compiler Construction for Digital Computers. John Wiley, 1967.Google Scholar
- Hall, A. D.: Private Communication 1974.Google Scholar
- Hext, J. B.: Programming Languages and Compiling Techniques. Ph.D. Dissertation, University of Cambridge 1965.Google Scholar
- Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. CACM 16, 372--378 (1973).Google Scholar
- IBM Corp.: IBM system/360 operating system FORTRAN IV (H) compiler program logic manual. Y28-6642-3 (1968).Google Scholar
- Kildall, G. A.: Global expression optimization during compilation. Ph.D. Thesis, University of Washington 1972.Google Scholar
- Knuth, D. E.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison Wesley 1969.Google Scholar
- Knuth, D. E.: An empirical study of FORTRAN programs. Software - Practice and Experience 1, 105--133 (1971).Google Scholar
- Lee, J. A. N.: A formal definition of the BASIC language. Computer J. 15, 37--41 (1972).Google Scholar
- Lowry, E. S., Medlock, C. W.: Object code optimization. CACM 12, 13--22 (1969).Google Scholar
- McKeeman, W. M.: Peephole optimization. CACM 8, 443--444 (1965).Google Scholar
- Rohl, J. S., Linn, J. A.: A note on compiling arithmetic expressions. Computer J. 15, 13--14 (1972).Google Scholar
- Sethi, R., Ullman, J. D.: The generation of optimal code for arithmetic expressions. JACM 17, 715--728 (1970).Google Scholar
- Sheridan, P. B.: The FORTRAN arithmetic-compiler of the IBM FORTRAN automatic coding system. CACM 2, 9- (1959).Google Scholar
- Spillman, T. C.: Exposing side-effects in a PL/I optimizing compiler. Information Processing 71, 376--381, North-Holland 1972.Google Scholar
- Ullman, J. D.: Fast algorithms for the elimination of common subexpressions. Acta Informatica 2, 191--213 (1973).Google Scholar
- Wilcox, T. R.: Generating Machine Code for High-Level Programming Languages. Ph.D. Thesis, Cornell University 1971.Google Scholar
- The A-2 Compiler System: Automatic Programming. Computers and Automation 4, 25--31 (Sept. 1955) and 4, 15--23 (Oct. 1955)Google Scholar
- Adams, Ch. W., Laning, J. H. jr.: The MIT systems of automatic coding: Comprehensive, Summer Session, and Algebraic. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13--14, 1954, p. 30--33Google Scholar
- Adams, E. S., Schlesinger, S. I.: Simple automatic coding systems. Comm. ACM 1:7, 5--9 (1958)Google Scholar
- Angstl, H.: Seminar Über Logistik. Prof. W. Britzelmayr, Univesität München, 1950Google Scholar
- Arden, B. W., Graham, R. M.: On GAT and the construction of translators. Comm. ACM 2:7, 24--26 (1959)Google Scholar
- Arden, B. W., Galler, B. A., Graham, R. M.: The internal organization of the MAD translator. Comm. ACM 4, 28--31 (1961)Google Scholar
- Automatic Programming: The IT translator. In: E. M. Grabbe et al. (eds.): Handbook of Automation, Computation, and Control 2, 2·200-2·228. New York: John Wiley and Sons 1959Google Scholar
- Backus, J. W., Herrick, H.: IBM 701 speedcoding and other automatic programming systems. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13--14, 1954, p. 106--113Google Scholar
- Backus, J. W.: Automatic Programming: Properties and performance of FORTRAN Systems I and II. Symposium Mechanisation of Thought Processes, National Physical Lab., Teddington, November 24--27, 1958, p. 231--255Google Scholar
- Backus, J. W. et al.: The FORTRAN automatic coding system. Proc. AFIPS 1957 WJCC 11, p. 188--198Google Scholar
- Barnett, M. P., Futrelle, R. P.: Syntactic analysis by digital computer. Comm. ACM 5, 515--526 (1962)Google Scholar
- Barton, R. S.: Another (nameless) compiler for the Burroughs 220. Comm. ACM 4, A 11 (1961)Google Scholar
- Bastian, A. L. jr.: A phrase-structure language translator. Air Force Cambridge Res. Labs., Hanscom Field (Mass.), Rep. No. AFCRL-69-549, August 1962Google Scholar
- Bauer, F. L.: The formula-controlled logical computer "Stanislaus". Mathematics of Computation (MTAC) 14, 64--67 (1960)Google Scholar
- Bauer, F. L., Bottenbruch, H., Rutishauser, H., Samelson, K.: Proposal for a universal language for the description of computing processes. Zürich, Mainz, München, Darmstadt (ZMMD-Projekt), April 1958Google Scholar
- Bauer, F. L., Samelson, K.: Verfahren zur automatischen Verarbitung von kodierten Daten und Rechenmaschine zur Ausübung des Verfahrens. Deutsche Patent-auslegeschrift 1094019. Anm.: 30. März 1957; Bek.: 1. Dez. 1960Google Scholar
- Bauer, F. L., Samelson, K.: The cellar principle for formula translation. Proc. ICIP Paris 1959, p. 154Google Scholar
- Bauer, F. L., Samelson, K.: Maschinelle Verarbeitung von Programmsprachen. In: Hoffmann, W. (Hrsg.): Digitale Informationswandler. Braunschweig: Vieweg 1962Google Scholar
- Böhm, C.: Calculatrices digitales. Du déchiffrage de formules logico-mathématiques par la machine même dans la conception du programme (Dissertation, Zürich 1952). Annali Mathematica pura applicata, Ser. 4, 37, 5--47 (1954)Google Scholar
- Bottenbruch, H.: Einige Überlegungen zur Übersetzung einer algorithmischen Sprache in Maschinenprogramme. Manuskript, Institut für Praktische Mathematik (IPM) der Techn. Hochschule Darmstadt, 1957Google Scholar
- Brooker, R. A.: Some technical features of the Manchester Mercury Autocode Programme. Symposium Mechanisation of Thought Processes, National Physical Lab., Teddington, November 24-27, 1958, p. 201--229Google Scholar
- Brooker, R. A., Morris, D.: An assembly program for a phrase structure language. Computer J. 3, 168--174 (1960)Google Scholar
- Brooker, R. A., Morris, D.: Some proposals for the realization of a certain assembly program. Computer J. 3, 220--231 (1961)Google Scholar
- Brooker, R. A., Morris, D.: A description of Mercury Autocode in terms of a phrase structure language. In: Goodman, R. (ed.): Second Annual Review of Automatic Programming. New York: Pergamon 1961Google Scholar
- Brooker, R. A., Morris, D.: A general translation program for phrase-structure languages. J. ACM 9, 1--10 (1962)Google Scholar
- Brooker, R. A. Morris, D.: A compiler for a self-defining phrase structure language. University of Manchester, England (undated)Google Scholar
- Brown, J. H. Carr III, J. W.: Automatic programming and its development on the MIDAC. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13--14, 1954, p. 84--97Google Scholar
- Burks, A. W., Warren, D. W., Wright, J. B.: An analysis of a logical machine using paranthesis-free notation. Math. Tables and other Aids to Computation (MTAC) 8:46, 53--57 (1954)Google Scholar
- Burroughs B5000. In: Data Processing Encyclopedia. Detroit 1961, p. 50--55Google Scholar
- Cheatham, T. E.: The TGS-II translator-generator system. Proc. IFIP Congr. 65, New York. Washington (D.C.): Spartan 1965Google Scholar
- Cheatham, T. E., Sattley, K.: Syntax-directed compiling. Proc. AFIPS 1964 SJCC 25. Washington (D.C.): Spartan 1964, p. 31--57Google Scholar
- Chomsky, N.: Syntactic structures. Den Haag: Mouton 1957Google Scholar
- Chomsky, N.: On certain formal properties of grammars. Information and Control 2, 137--167 (1959). Addendum: A note on phrase structure grammars. Information and Control 2, 393--395 (1959)Google Scholar
- Chomsky, N.: Formal properties of grammars. In: Luce, R. D., Bush, R., Galanter, E. (eds.): Handbook of Mathematical Psychology, Vol. 2. New York: John Wiley and Sons 1963, p. 323--418Google Scholar
- Chomsky, N., Schützenberger, M. P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.): Computer Programming and Formal Systems. Amsterdam: North-Holland 1963, p. 118--161Google Scholar
- Church, A.: The calculi of lambda-conversion. In: Annals of Mathematics Studies No. 6. Princeton (N.J.): Princeton University Press 1941Google Scholar
- Conway, M. E.: Design of a separable transition-diagram compiler. Comm. ACM 6, 396--408 (1963)Google Scholar
- Dijkstra, E. W.: Making a translator for ALGOL 60. Annual Review in Automatic Programming 3, 347--356 (1963)Google Scholar
- Eickel, J.: Generation of parsing algorithms for Chomsky 2 - type languages. Mathematisches Institut der Technischen Universität München, Bericht Nr. 6401, 1964Google Scholar
- Eickel, J., Paul, M., Bauer, F. L., Samelson, K.: A syntax-controlled generator of formal language processors. Comm. ACM 6, 451--455 (1963)Google Scholar
- Ershov, A. P.: On programming of arithmetic operations (Russ.). Doklady AN SSSR 118:3, 427--430 (1958). (Eng1. Trans1. in: Comm. ACM 1:8, 3--6 (1958))Google Scholar
- Ershov, A. P.: The work of the computing centre of the Academy of Sciences of the USSR in the field of automatic programming. Symposium Mechanisation of Thought Processes. National Physical Lab., Teddington, November 24--27, 1958, p. 257--278Google Scholar
- Ershov, A. P.: Programming Programme for the BESM Computer (Russ.). Moskau: Verlag der Akademie der Wissenschaften der UdSSR 1958 und London: Pergamon Press 1960Google Scholar
- Fischer, P. C.: A proposal for a term project for applied mathematics 205. Manuscript, 1959Google Scholar
- Flow-Matic Programming System. Remington-Rand Univac Div. of Sperry Rand Corp. New York 1958Google Scholar
- Floyd, R. W.: An algorithm defining ALGOL statement analysis with validity checking. Comm. ACM 3, 418--419 (1960)Google Scholar
- Floyd, R. W.: An algorithm for coding efficient arithmetic operations. Comm. ACM 4, 42--51 (1961)Google Scholar
- Floyd, R. W.: Syntactic analysis and operator precedence, J. ACM 10, 316--333 (1963)Google Scholar
- Floyd, R. W.: Bounded context syntactic analysis. Comm. ACM 7, 62--67 (1964)Google Scholar
- Floyd, R. W.: Syntactic analysis and operator precedence. In: Pollack, B. W. (ed.): Compiler Techniques. Princeton (N.J.): Auerbach Publishers 1972Google Scholar
- Floyd, R. W.: The syntax of programming languages - a survey. In: Pollack, B. W. (ed.): Compiler Techniques. Princeton (N.J.): Auerbach Publishers 1972Google Scholar
- Foster, J. M.: A syntax improving device. Computer J. 11, 31--34 (1968)Google Scholar
- GAMM Fachausschuß Programmieren (Hrsg.): Vorschläge für eine algorithmische Schreibweise zur Formelübersetzung. Zürich, Mainz, München, Darmstadt, Oktober 1957Google Scholar
- Glennie, A.: On the syntax machine and the construction of a universal compiler. Carnegie-Mellon University, Techn. Report No. 2 (AD-240512), July 1960Google Scholar
- Goldfinger, R.: New York University Compiler System. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13--14, 1954, p. 30--33Google Scholar
- Gorn, S.: Planning universal semi-automatic coding. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13--14, 1954, p. 74--83Google Scholar
- Gorn, S.: On the logical design of formal mixed languages. Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, 1959Google Scholar
- Graham, R. M.: Bounded context translation. Proc. AFIPS 1964 SJCC 25. Baltimore (Md.): Spartan 1964, p. 17--29Google Scholar
- Grau, A. A.: Recursive processes and ALGOL translation. Comm. ACM 4, 10--15 (1961)Google Scholar
- Grau, A. A.: The structure of an ALGOL translator. Oak Ridge Nat. Lab., Oak Ridge (Tenn.), Report No. ORNL-3054, February 9, 1961Google Scholar
- Greibach, S. A.: Inverses of phrase structure generators. Harvard University, Cambridge (Mass.), Ph. D. dissertation, June 1963Google Scholar
- Gries. D.: Compiler construction for digital computers. New York: John Wiley and Sons 1971Google Scholar
- Gries, D.: Use of transition matrices in compiling. Comm. ACM 11, 26--34 (1968)Google Scholar
- Gries, D. et al.: Some techniques used in the ALCOR-Illinois 7090. Comm. ACM 8, 496--500 (1965)Google Scholar
- Haley, A. C. D.: The KDF 9 computer system. Proc. AFIPS 1962 FJCC 22. Washington (D.C.): Spartan 1962, p. 108--120Google Scholar
- Halstead, M. H.: Machine independent computer programming. Washington (D.C.): Spartan 1962, p. 37 ffGoogle Scholar
- Hopper, G. M.: Automatic programming, definitions. Symposium Automatic Programming Digital Computers, Office of Naval Research, PB 111 607. May 13--14, 1954, p. 1--5Google Scholar
- Hopper, G. M.: First glossary of programming terminology. Report to the Association for Computing Machinery (ACM), June 1954Google Scholar
- Huskey, H. D.: Compiling techniques for algebraic expressions. Computer J. 4, 10--19 (1961)Google Scholar
- Huskey, H. D., Wattenburg, W. H.: A basic compiler for arithmetic expressions. Comm. ACM 4, 3--9 (1961)Google Scholar
- Ingerman, P. Z.: A new algorithm for algebraic translation. Reprints of papers presented at the 14th National Meeting of the Association for Computing Machinery, 1959, p. 22.1--22.2Google Scholar
- Ingerman, P. Z.: A syntax oriented compiler.. . Moore School of Electr. Engineering. University of Pennsylvania, Philadelphia, April 1963Google Scholar
- Irons, E. T.: A syntax directed compiler for ALGOL 60. Comm. ACM 4, 51--55 (1961)Google Scholar
- Irons, E. T.: The structure and use of the syntax-directed compiler. In: Annual Review in Automatic Programming 3, 207--227 (1963)Google Scholar
- Irons, E. T.: 'Structural connections' in formal languages. Comm. ACM 7, 67--72 (1964)Google Scholar
- Janov, Y. J.: On the equivalence and transformation of program schemes (Russ.). Doklady AN SSSR 113:1, 39--42 (1957). Engl. transl. in: Comm. ACM 1:10, 8--12 (1958)Google Scholar
- Janov, Y. J.: On matrix program schemes (Russ.). Doklady AN SSSR 113:2, 283--286 (1957). Engl. transl. in: Comm. ACM 1:12, 3--6 (1958)Google Scholar
- Kanner, J.: An algebraic translator. Comm. ACM 2:10, 19--22 (1959)Google Scholar
- Kantorovich, L. V.: On a mathematical symbolism convenient for performing machine calculations (Russ.). Doklady AN SSSR 113:4, 738--741 (1957)Google Scholar
- Kleene, S. C.: Proof by cases in formal logic. Annals of Mathematics 35, 529--544 (1934)Google Scholar
- Knuth, D. E.: Runcible: Algebraic translation on a limited computer. Comm. ACM 2, 18--21 (1959)Google Scholar
- Knuth, D. E.: A history of writing compilers. Computers and Automation 11, 8--14 (1962)Google Scholar
- Kolloquium über Sprachen und Algorithmen. Berlin, 8. - 11. Juni 1960. Math. Logik 7, 299--308, 1961Google Scholar
- Kuno, S., Oettinger, A. G.: Multiple-path syntactic analyzer. Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland 1962, p. 306--312Google Scholar
- Laning, J. H., Zierler, N.: A program for translation of mathematical equations for Whirlwind I. Massachusetts Institute of Technology, Cambridge (Mass.), Engineering Memorandum E-364, January 1954Google Scholar
- Ledley, R. S., Wilson, J. B.: Autmatic-programming-language translation through syntactical analysis. Comm. ACM 5, 145--155 (1962)Google Scholar
- Ljapunov, A. A.: On logical schemes of programming (Russ.) Problemi Kibernetiki 1, 46--74 (1958). Deutsche Übers. in: Ljapunov, A. A. (Hrsg.): Probleme der Kybernetik, Bd.1. Berlin: Akademie Verlag 1962, p. 53--86Google Scholar
- Lucas, P.: The structure of formula-translators. Mailüfterl, Vianna, Austria. ALGOL Bulletin Suppl. No. 16, September 1961 und Elektronische Rechenanlagen 3, 159--166 (1961)Google Scholar
- Lukasiewicz, J.: O znaczeniu i potrzebach logiki matematycznej (On the importance and needs of mathematical logic). Nauka Polska 10, 604--620 (1929)Google Scholar
- Lukasiewicz, J.: Elementy logiki matematycznej (Elements of mathematical logic). Lecture Notes, 2nd edition (1929) - Warszawa, 1958, PWN, p. 40Google Scholar
- Lukasiewicz, J.: Elements of mathematical logic. Oxford: Pergamon Press 1963Google Scholar
- Lukasiewicz, J., Tarski, A.: Untersuchungen Über den Aussagenkalkül. C.R.Soc. Sci. Lett. Varsovie, Ch. III, 23, 31 (1930)Google Scholar
- Menger, K.: Eine elementare Bemerkung Über die Struktur logischer Formeln. In: Menger, K. (Hrsg.): Ergebnisse eines mathematischen Kolloquiums 3, (1932). Leipzig und Wien: Deutige 1935, p. 22--23Google Scholar
- Namur, P.: Entwurf eines Hochgeschwindigkeits-Rechenautomaten mit Leucht-punktabtastung als Grundelement. Technische Hochschule Darmstadt, Dissertation, November 1964Google Scholar
- Oettinger, A. G.: Automatic syntactic analysis and the push-down store. Proc. Symp. Appl. Math. 12, Providence (R.I.): Amer. Math. Soc. 1961, p. 104--129Google Scholar
- Paul, M.: Zur Struktur formaler Sprachen. Universität Mainz, Dissertation D77, 1962Google Scholar
- Paul, M.: A general processor for certain formal languages. Proc. Symp. Symbolic Languages in Data Processing, Rome, 1962. New York - London: Gordon and Breach 1962, p. 65--74Google Scholar
- Paul, M.: ALGOL 60 processors and a processor generator. Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland 1962, p. 493--497Google Scholar
- Perlis, A. J. et al.: Internal translator (IT), a compiler for the 650. Carnegie Institute of Technology, Computation Center, Pittsburgh 1956. Reproduced by Lincoln Lab. Div. 6, Document 6D--327Google Scholar
- van der Poel, W. L.: Dead programmes for a magnetic drum automatic computer. Applied Scientific Research (B) 3, 190--198 (1953)Google Scholar
- Post, E. L.: Formal reduction of the general combinatorial decision problem. Amer. J. Math. 65, 197--215 (1943)Google Scholar
- Reynolds, J. C.: A compiler and generalized translator. Applied Math. Div., Argonne Natl. Lab., Argonne, Ill., 1962Google Scholar
- Rice, H. G.: The APS III compiler for the Datatron 204. Westinghouse Research Lab., Pittsburgh, Manuscript, 1957Google Scholar
- Rich, B.: APT common computer language. Manuscript, Appl. Phys. Lab. Johns Hopkins University, Baltimore (Md.) 1957 and Annual Review in Automatic Programming 2, 141--159 (1961)Google Scholar
- Rosenbloom, P. C.: The elements of mathematical logic. New York: Dover 1950Google Scholar
- Rutishauser, H.: Ober automatische Rechenplananfertigung bei programmge-steuerten Rechenmaschinen. Z. angew. Math. Mech. 31, 255 (1951)Google Scholar
- Rutishauser, H.: Automatische Rechenplananfertigung bei programmgesteuerten Rechenmaschinen. Inst. f. Angew. Mathematik ETH Zürich, Mitteil. Nr. 3. Basel: Verlag Birkhäuser 1952Google Scholar
- Rutishauser, H.: Automatische Rechenplananfertigung bei programmgesteuerten Rechenmaschinen. Z. angew. Math. Mech. 32, 312--313 (1952)Google Scholar
- Samelson, K.: Probleme der Programmierungstechnik. Aktuelle Probleme der Rechentechnik. Ber. Internat. Mathematiker-Kolloquium, Dresden November 22--27, 1955. Berlin: VEB Deutscher Verlag der Wissenschaften 1957, p. 61--68Google Scholar
- Samelson, K.: Programming languages and their processors. Proc. IFIP Congr. 62, Munich. Amsterdam: North-Holland 1963, p. 487--492Google Scholar
- Samelson, K., Bauer, F. L.: Sequentielle Formelübersetzung. Elektron. Rechenanlagen 1, 176--182 (1959)Google Scholar
- Samelson, K., Bauer, F. L.: Sequential formula translation. Comm. ACM 3, 76--83 (1960)Google Scholar
- Samelson, K., Bauer, F. L.: The ALCOR project. Proc. Symp. Symbolic Languages in Data Processing, Rome, 1962. New York - London: Gordon and Breach 1962, p. 207--217Google Scholar
- Schorre, D. V.: A syntax oriented compiler writing language. Proc. 19th ACM Conf. 1964, Philadelphia, D1.3-1--D1.3-11Google Scholar
- Schröter, K.: Axiomatisierung der Frege'schen Aussagenkalküle. Forschungen zur Logik und zur Gundlegung der exakten Wissenschaften. Neue Serie Bd. 8, Leipzig 1943Google Scholar
- Schützenberger, M. P.: On context-free languages and pushdown automata. Information and Control 6, 246--264 (1963)Google Scholar
- Share Assembly Program (SAP). In: Grappe, E. M. et al. (eds.): Handbook of Automation, Computation and Control Vol. 2. New York: John Wiley and Sons 1959, p. 2·165--2·167Google Scholar
- Sheridan, P. B.: The arithmetic translator-compiler of the IBM FORTRAN automatic coding system. Comm. ACM 2:3, 9--21 (1959)Google Scholar
- Slutz, R. J.: Engineering experience with the SEAC. Proc. AFIPS 1961 EJCC 1. New York: Amer. Inst. Electr. Engineers 1951, p. 90--93Google Scholar
- UNIVAC Generalized Programming. Remington Rand Univac Div. of Sperry Rand Corp., New York 1957Google Scholar
- UNIVAC Math-Matic Programming System. Remington Rand Univac Div. of Sperry Rand Corp., New York 1958Google Scholar
- Waldburger, H.: Gebrauchsanweisung für die ERMETH. Institut für Angew. Math. and der ETH Zürich, 1958Google Scholar
- Warshall, S.: A syntax-directed generator. Proc. AFIPS 1961 EJCC 20. Baltimore (Md.): Spartan 1961, p. 295--305Google Scholar
- Warshall, S., Shapiro, R. M.: A general table-driven compiler. Proc. AFIPS 1964 SJCC 25. Washington (D.C.): Spartan 1964, p. 59--65Google Scholar
- Watt, J. B., Wattenburg, W. H.: A NELIAC-generated 7090--1401 compiler. Comm. ACM 5, 101--102 (1962)Google Scholar
- Wegstein, J. H.: From formulas to computer oriented language. Comm. ACM 2:3, 6--8 (1959)Google Scholar
- Wells, R.: Immediate constituents. Language 23, 81--117 (1947)Google Scholar
- Wilkes, M. V.: The use of a floating address system for orders in an automatic digital computer. Proc. Cambridge Philos. Soc. 49, 84--89 (1953)Google Scholar
- Wilkes, M. V. et al.: The preparation of programs for an electronic digital computer. Cambridge (Mass.): Addison-Wesley 1951 (1957)Google Scholar
- Wirth, N., Weber, H.: EULER: A generalization of ALGOL and its formal definition, Part I. Comm. ACM 9, 13--25 (1966)Google Scholar
- Zuse, K.: Ober den allgemeinen Plankalkül als Mittel zur Formalisierung schematisch-kombinatorischer Aufgaben. Archiv der Math. 1:6, 441--449 (1948/49)Google Scholar
- Zuse, K.: Ober den Plankalkül. Elektron. Rechenanlagen 1:2, 68--71 (1959)Google Scholar
Cited By
- Ganty P, Ranzato F and Valero P (2021). Complete Abstractions for Checking Language Inclusion, ACM Transactions on Computational Logic, 22:4, (1-40), Online publication date: 31-Oct-2021.
- Pumplin B (1987). Compiling LISP procedures, ACM SIGSMALL/PC Notes, 13:1, (16-30), Online publication date: 1-Feb-1987.
- Tai K (1982). Comments on parameter passing techniques in programming languages, ACM SIGPLAN Notices, 17:2, (24-27), Online publication date: 1-Feb-1982.
- Filipski G, Moore D and Newton J Ada as a software transition tool Proceedings of the ACM-SIGPLAN symposium on The ADA programming language, (176-182)
- Nordström B Programming with abstract data types, some examples Proceedings of the 1978 annual conference - Volume 2, (646-654)
- Hunter R, McGettrick A and Patel R LL versus LR parsing with illustrations from ALGOL 68 Proceedings of the Strathclyde ALGOL 68 conference, (49-53)
- Hunter R, McGettrick A and Patel R (1977). LL versus LR parsing with illustrations from ALGOL 68, ACM SIGPLAN Notices, 12:6, (49-53), Online publication date: 1-Jun-1977.
Please enable JavaScript to view thecomments powered by Disqus.