|
H ?
«
‹
←
→
›
»
Language peer sets for Atlas Autocode: United Kingdom↑ United Kingdom/1964↑ Designed 1964 ↑ 1960s languages ↑ Third generation↑ Early Cold War↑ Genus Early Autocodes ↑ Multi-purpose ↑ Early Autocodes↑ Autocodes↑ UK historic algorithmic systems ↑ Early Autocodes/1964↑ Autocodes/1964↑ UK historic algorithmic systems/1964↑ Early Autocodes/United Kingdom↑ Autocodes/United Kingdom↑ UK historic algorithmic systems/United Kingdom↑ Multi-purpose ↑ Multi-purpose/1964↑ Multi-purpose/uk ↑ Atlas Autocode(ID:1840/atl003)Algol-like high-level Autocodealternate simple viewCountry: United Kingdom Designed 1964 Genus: Early Autocodes Sammet category: Multi-purpose Atlas Autocode (AA) was a programming language developed at Manchester University for the Atlas Computer. It was developed by Tony Brooker as an improvement on the ALGOL programming languages, removing some of Algol's poorer features such as passing parameters by name. It featured explicitly typed variables, subroutines and functions. The AA compiler generated range-checking for array accesses, and the language allowed an array to have dimensions that were determined at run-time (i.e. you could declare an array as %integer %array Thing (i:j), where i and j were calculated values). Atlas Autocode included a "%complex" data type which would support imaginary numbers (eg the square root of -1), a feature which was dropped when the language later morphed into the Edinburgh IMP programming language. (Imp was an extension of AA and was notable for being used to write the EMAS operating system.) Keywords in AA were represented as being underlined, however for the sake of easy typing it was possible to strop keywords by placing a "%" sign in front of them. There were no reserved words in the language. For example "%if token=if %then %result = token" refers to a variable called "if". Because of this keyword stropping, it was possible for AA to allow spaces in variable names, such as "%integer previous value". Spaces were not significant and were removed prior to parsing. The syntax for expressions was very close to mathematical standards and allowed implicit multiplication such as "z = 3x + y" as an alternative to the more common "z = x * 3 + y". Atlas Autocode's syntax was influenced by the output device which the author had available, a Flexowriter. Consequently it allowed symbols like "1\over 2" and superscripts for "i^2". The flexowriter supported overstriking and therefore AA did as well - up to three characters could be overstruck as a single symbol. For example the character set had no "^" symbol, so exponentiation was an overstrike of "|" and "*". (The underlining of keywords mentioned above could also be done using overstriking.) When AA was ported to the KDF-9 computer, the character set was changed to ISO and that compiler has actually been recovered from an old paper tape by the Edinburgh Computer History Project and is available online, as is a high-quality scan of the original Atlas Autocode manual. Atlas Autocode's second-greatest claim to fame (after being the progenitor of Imp and EMAS) was that it was the original "Compiler Compiler" of which "Yacc" was a later derivative. A variant of the AA compiler included run-time support for a top-down recursive descent parser. The style of parser used in the Compiler Compiler was in use continuously at Edinburgh from the 60's until almost the turn of the millennium. Autocode for the Ferranti Atlas, which may have been the first commercial machine with hardware-paged virtual memory. The Atlas was based on the Manchester MUSE (for MIcroSEcond) computer, which was designed to put British large-scale back to international competitivity. Whereas other autocodes were basically symbolic assembly languges, Atlas Autocode was high-level and block-structured, resembling a cross between FORTRAN and ALGOL 60. It had call-by value, loops, declarations, complex numbers, pointers, heap and stack storage generators, dynamic arrays, extensible syntax, etc. Not an Algol though - drew heavily on the other Autocodes and the experience they gave Had first complier compiler extensions thanks to Tony Brooker Structures: Related languages
References: in (1961) The Computer Journal 4(3) October 1961 in (1961) The Computer Journal 4(3) October 1961 in (1961) The Computer Journal 4(3) October 1961 in (1961) The Computer Journal 4(3) October 1961 in (1961) The Computer Journal 4(3) October 1961 in (1967) The Computer Journal 9(4) 1967 in (1967) The Computer Journal 9(4) 1967 in (1967) The Computer Journal 9(4) 1967 in (1967) The Computer Journal 9(4) 1967 in [ACM] (1968) [ACM] CACM 11(02) (February 1968) in (1970) The Computer Journal 13(1) January 1970 in (1971) The Computer Journal 14(1) 1971 in [ACM] (1978) [ACM] CACM 21(01) (January 1978) in [ACM] (1978) [ACM] CACM 21(01) (January 1978) in [ACM] (1978) [ACM] CACM 21(01) (January 1978) Resources Search in: Google Google scholar World Cat Yahoo Overture DBLP Monash bib NZ IEEE ACM portal CiteSeer CSB ncstrl jstor Bookfinder |