This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Bibliography
R. C. Bose and T. A. Dowling (editors), Combinatorial Mathematics and its Applications, Proceedings of a conference held at Chapel Hill, North Carolina, April 10–14, 1967; University of North Carolina Monograph Series in Probability and Statistics 4 (1969).
J. N. Buxton (editor), Simulation Programming Languages, Proceedings of an IFIP Working Conference held at Oslo, Norway, May 22–26, 1967 (Amsterdam: North-Holland, 1968).
A. Caracciolo di Forino, “On the concept of formal linguistic systems,” in [30], 37–51.
Karel Čulík, “Well-translatable grammars and Algol-like languages,” in [30], 76–85.
Pierre Deransart, Martin Jourdan, and Bernard Lorho, “Attribute Grammars,” Lecture Notes in Computer Science 323 (1988), ix+232 pp.
F. G. Duncan, “Our ultimate metalanguage: An after dinner talk,” in [30], 295–299.
Isu Fang, FOLDS, a declarative formal language definition system. Ph.D. thesis, Stanford University, 1972; also report STAN-CS-72-329.
Robert W. Floyd, “On the nonexistence of a phrase structure grammar for ALGOL 60,” Communications of the ACM 5 (1962), 483–484.
Edgar T. Irons, “A syntax-directed compiler for ALGOL 60,” Communications of the ACM 4 (1961), 51–55.
Edgar T. Irons, “The structure and use of the syntax-directed compiler,” Annual Review in Automatic Programming 3 (1962), 207–227.
Edgar T. Irons, “Towards more versatile mechanical translators,” Proceedings of Symposia in Applied Mathematics 15 (American Mathematical Society, 1963), 41–50.
Edgar T. Irons, “'structural connections’ in formal languages,” Communications of the ACM 7 (1964), 67–72.
Mehdi Jazayeri, William F. Ogden, and William C. Rounds, “The intrinsically exponential complexity of the circularity problem for attribute grammars,” Communications of the ACM 18 (1975), 691–706.
Donald E. Knuth, The Art of Computer Programming (Reading, Mass.: Addison-Wesley). Volume 1, 1968; Volume 2, 1969; Volume 3, 1973; Volume 4, in progress.
Donald E. Knuth, “Semantics of context-free languages,” Mathematical Systems Theory 2 (1968), 127–145.
Donald E. Knuth and Peter B. Bendix, “Simple word problems in universal algebras,” in John Leech (editor), Computational Problems in Abstract Algebra, Proceedings of a conference held at Oxford, England, August 29–September 2, 1967 (Oxford: Pergamon Press, 1970), 263–297.
Donald E. Knuth, “The analysis of algorithms,” Actes du Congrès International des Mathématiciens 1970, 3 (Paris: Gauthier-Villars, 1971), 269–274.
Donald E. Knuth, “Examples of formal semantics,” in E. Engeler (editor), Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics 188 (1971), 212–235.
Donald E. Knuth, “Top-down syntax analysis,” Acta Informatica 1 (1971), 79–110.
Donald E. Knuth, “Semantics of context-free languages: Correction,” Mathematical Systems Theory 5 (1971), 95–96.
Donald E. Knuth, “An empirical study of FORTRAN programs,” Software—Practice & Experience 1 (1971), 105–133.
Donald E. Knuth, “Mathematical analysis of algorithms,” Proceedings of IFIP Congress 1971, 1 (Amsterdam: North-Holland, 1972), 19–27.
Donald E. Knuth, TEX: The Program. (Reading, Mass.: Addison-Wesley, 1986), xv+594 pp.
Donald E. Knuth, Tracy Larrabee, and Paul M. Roberts, Mathematical Writing, MAA Notes 14 (Mathematical Association of America, 1989), v+115 pp.
P. M. Lewis II and R. E. Stearns, “Syntax-directed transduction,” Journal of the ACM 15 (1968), 465–488.
John McCarthy, in “General discussion,” Communications of the ACM 7 (1964), 134–136.
Robert M. McClure, “TMG-A syntax-directed compiler,” Proceedings of the ACM National Conference 20 (1965), 262–274.
Peter Naur (editor) et al., “Report on the algorithmic language ALGOL 60,” Communications of the ACM 3 (1960), 299–314.
D. V. Schorre, “META II-A syntax-directed compiler writing language,” Proceedings of the ACM National Conference 19 (1964), D1.3.1–D.3.11.
T. B. Steel, Jr. (editor), Formal Language Description Languages for Computer Programming, Proceedings of an IFIP Working Conference held at Vienna, Austria, September 15–18, 1964 (Amsterdam: North-Holland, 1966).
T. B. Steel, Jr., “A formalization of semantics for programming language description,” in [30], 25–36.
Christopher Strachey, comment on paper by J. V. Garwick, ‘The definition of programming languages by their compilers,” in [30], 139–147.
A. van Wijngaarden, “Recursive definition of syntax and semantics,” in [30], 13–24.
Wayne Theodore Wilner, A declarative semantic definition. Ph.D. thesis, Stanford University, 1971; also report STAN-CS-71-233.
“Burroughs announces B6500,” Communications of the ACM 9 (1966), 541.
“Salton announces new departments, editors for Communications,” and “Journal changes are outlined by Gotlieb,” Communications of the ACM 9 (1966), 825.
“On FJCC 66 at the Golden Gate,” Communications of the ACM 9 (1966), 885.
“ACM National Lectures 1966–7,” Communications of the ACM 10 (1967), 68–69.
“SIAM 1967 Fall Meeting,” SIAM Review 10 (1968), 260–280.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knuth, D.E. (1990). The genesis of attribute grammars. In: Deransart, P., Jourdan, M. (eds) Attribute Grammars and their Applications. Lecture Notes in Computer Science, vol 461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53101-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-53101-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53101-2
Online ISBN: 978-3-540-46666-6
eBook Packages: Springer Book Archive