Information AboutAlgol |
|
ALGOL (short for '''ALGO'''rithmic '''L'''anguage) is a family of Imperative Computer Programming Language s originally developed in the mid 1950s which became the ''de facto'' standard way to report algorithms in print for almost the next 30 years. It was designed to avoid some of the perceived problems with FORTRAN and eventually gave rise to many other programming languages (including Pascal ). ALGOL uses bracketed statement blocks and was the first language to use '''begin''' '''end''' pairs for delimiting them. Fragments of ALGOL-like syntax are sometimes still used as a notation for Algorithm s, so-called Pidgin Algol . There are three official main branches of ALGOL family: ALGOL 58 , ALGOL 60, and ALGOL 68 . Of these, ALGOL 60 was the most widely known in the United States . Niklaus Wirth based his own Algol-W on ALGOL 60, before moving to develop Pascal . Algol-W was intended to be the next generation ALGOL, but the ALGOL 68 committee decided on a design that was more complex and advanced rather than a cleaned, simplified ALGOL 60. The official ALGOL versions are named after the year they were first published. ALGOL 58 was originally known as the '''IAL''' (for '''I'''nternational '''A'''lgorithmic '''L'''anguage.) ''Note: '' throughout its effective life, the name of the programming language ALGOL was always presented in all-uppercase letters, and this is the practice adopted here. HISTORY ALGOL was developed jointly by a committee of European and American computer scientists. It specified three different syntaxes: a reference syntax, a publication syntax, and an implementation syntax. The different syntaxes permitted it to use different keyword names and conventions for decimal points (commas vs. periods) for different languages. John Backus developed the Backus Normal Form method of describing programming languages specifically for ALGOL 58. It was revised and expanded by Peter Naur to the Backus-Naur Form for ALGOL 60. Both John Backus and Peter Naur served on the committee which created ALGOL 60, as did Wally Feurzeig who later created Logo . ALGOL 60 inspired many languages that followed it; , also known for his pointed comments, who helped to implement an early ALGOL 60 Compiler .) True ALGOL 60 s Specification and Implementation Timeline There were about 70 augmented, extensions, derivations and sublanguages of Algol 60 {Link without Title} The Burroughs Corporation 's B5000 and its successors were Stack Machine s designed to be programmed in an extended variant of ALGOL 60, known as Elliott ALGOL ; indeed their Operating System the MCP , was written in Elliott ALGOL as far back as 1961. The Unisys Corporation still markets machines descended from the B5000 today, running the MCP and supporting a diverse set of Elliott ALGOL compilers. PROPERTIES ALGOL 60 as officially defined had no I/O facilities; implementations defined their own in ways that were rarely compatible with each other. In contrast, ALGOL 68 offered an extensive library of ''transput'' (ALGOL 68 parlance for Input/Output) facilities. ALGOL 60 allowed for two s" that are used to implement it. ALGOL 68 was defined using a two-level grammar formalism invented by Adriaan Van Wijngaarden and which bears his name. ''Van Wijngaarden grammars'' use a Context-free Grammar to generate an infinite set of productions that will recognize a particular ALGOL 68 program; notably, they are able to express the kind of requirements that in many other programming language standards are labelled "semantics" and have to be expressed in ambiguity-prone natural language prose, and then implemented in compilers as ''ad hoc'' code attached to the formal language parser. CODE SAMPLE (ALGOL 60) (The way the bolded text has to be written depends on the implementation, e.g. 'INTEGER' (including the quotation marks) for integer.) procedure Absmax(a) Size:(n, m) Result:(y) Subscripts:(i, k); value n, m; '''array''' a; '''integer''' n, m, i, k; '''real''' y; comment The absolute greatest element of the matrix a, of size n by m is transferred to y, and the subscripts of this element to i and k; begin '''integer''' p, q; y := 0; i := k := 1; for p:=1 '''step''' 1 '''until''' n '''do''' for q:=1 '''step''' 1 '''until''' m '''do''' if abs(a q ) > y '''then''' begin y := abs(a q ); i := p; k := q end end Absmax Here's an example of how to produce a table using Elliott 803 ALGOL. FLOATING POINT ALGOL TEST' BEGIN REAL A,B,C,D' READ D' FOR A:= 0.0 STEP D UNTIL 6.3 DO BEGIN PRINT PUNCH(3),££L??' B := SIN(A)' C := COS(A)' PRINT PUNCH(3),SAMELINE,ALIGNED(1,6),A,B,C' END' END' PUNCH(3) sends output to the teleprinter rather than the tape punch. SAMELINE suppresses the carriage return + line feed normally printed between arguments. ALIGNED(1,6) controls the format of the output with 1 digit before and 6 after the decimal point. HELLO WORLD Since ALGOL 60 had no I/O facilities, there is no portable "Hello World" program in ALGOL. The following code could run on an ALGOL implementation for a Burroughs A-Series mainframe, and is taken from this site . BEGIN FILE F (KIND=REMOTE); EBCDIC ARRAY E {Link without Title} ; REPLACE E BY "HELLO WORLD!"; WHILE TRUE DO BEGIN
END; END. An alternative example, using Elliott Algol I/O is as follows. In fact, Elliott Algol used different characters for 'open-string-quote' and 'close-string-quote', but ASCII does not allow these to be shown here. program HiFolks; begin print "Hello world"; end; Here's a version for the Elliott 803 Algol (A104) The standard Elliott 803 used 5 hole paper tape and thus only had upper case. The code lacked any quote characters so £ (UK Pound Sign) was used for open quote and ? (Question Mark) for close quote. Special sequencies were placed in double quotes e.g. ££L?? produced a new line on the teleprinter. HIFOLKS’ BEGIN PRINT £HELLO WORLD£L??’ END’ RESERVED WORDS AND RESTRICTED IDENTIFIERS There are 35 such reserved words in the standard Burroughs B6700 sub-language: ALPHA, ARRAY, BEGIN, BOOLEAN, COMMENT, CONTINUE, DIRECT, DO, DOUBLE, ELSE, END, EVENT, FALSE, FILE, FOR, FORMAT, GO, IF, INTEGER, LABEL, LIST, LONG, OWN, POINTER, PROCEDURE, REAL, STEP, SWITCH, TASK, THEN, TRUE, UNTIL, VALUE, WHILE, ZIP.There are 71 such restricted identifiers in the standard Burroughs B6700 sub-language: ACCEPT, AND, ATTACH, BY, CALL, CASE, CAUSE, CLOSE, DEALLOCATE, DEFINE, DETACH, DISABLE, DISPLAY, DIV, DUMP, ENABLE, EQL, EQV, EXCHANGE, EXTERNAL, FILL, FORWARD, GEQ, GTR, IMP, IN, INTERRUPT, IS, LB, LEQ, LIBERATE, LINE, LOCK, LSS, MERGE, MOD, MONITOR, MUX, NEQ, NO, NOT, ON, OPEN, OR, OUT, PICTURE, PROCESS, PROCURE, PROGRAMDUMP, RB, READ, RELEASE, REPLACE, RESET, RESIZE, REWIND, RUN, SCAN, SEEK, SET, SKIP, SORT, SPACE, SWAP, THRU, TIMES, TO, WAIT, WHEN, WITH, WRITE and also the names of all the intrinsic functions.SEE ALSO
EXTERNAL LINKS
|