Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Dartmouth ALGOL 30 was an implementation, firstly of ALGOL 58, then of ALGOL 60 for the LGP-30 at Dartmouth College, hence the name. Since the limited size of the LGP-30 precluded a full implementation of ALGOL 60, certain of its features (arrays called by value, own arrays, strings, variable array bounds, and recursion) were omitted; but the implementors did include parameters called by name, using "thunks" (Ingerman, 1961; Irons and Wally Feurzeig, 1961), and integer labels. They dubbed their work ALGOL 30, since it was for the LGP-30 (Kurtz, 1962a, Feb., 1962b, Mar.). From this project emerged a small group of undergraduate students who were well equipped to perform further work in the development of computer languages. For instance, one student (Steve Garland) discovered that compound statements and blocks could be included in the Samelson and Bauer scanning algorithm. This simple fact was not published until some years later. (The author has been unable to identify the source that he clearly remembers; the closest is Gries, 1968.)

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.