{"id":457,"date":"2018-02-01T11:58:27","date_gmt":"2018-02-01T10:58:27","guid":{"rendered":"http:\/\/wollef.org\/?p=457"},"modified":"2018-02-01T11:58:27","modified_gmt":"2018-02-01T10:58:27","slug":"histoire-de-la-programmation-24-les-langages-historiques","status":"publish","type":"post","link":"https:\/\/wollef.org\/blog\/histoire-de-la-programmation-24-les-langages-historiques\/","title":{"rendered":"Histoire de la programmation 2\/4 : Les langages historiques"},"content":{"rendered":"

Dans mon travail personnel pr\u00e9c\u00e9dent, j’ai parl\u00e9 de l’histoire des ordinateurs, des origines jusqu’aux\u00a0ordinateurs personnels\u00a0d’aujourd’hui.\u00a0<\/span><\/p>\n

Avec la deuxi\u00e8me g\u00e9n\u00e9ration de grands ordinateurs\u00a0(1960), j’avais vu que deux langages \u00e9taient apparus \u00e0 cette \u00e9poque : Fortran et Cobol.\u00a0<\/span><\/p>\n

De m\u00eame, l’invention\u00a0des micro-ordinateurs\u00a0(1970), combin\u00e9e\u00a0\u00e0\u00a0l’utilisation du Basic a permis\u00a0d’imaginer plein de nouveaux\u00a0logiciels.\u00a0<\/span><\/p>\n

Les machines et les langages de programmation \u00e9voluent en m\u00eame temps, au fil de l’inventivit\u00e9 des ing\u00e9nieurs et des informaticiens.\u00a0\u00a0<\/span><\/p>\n

Fortran\u202f:\u00a0<\/span><\/h1>\n

Le Fortran (Formula Translator) est le premier langage de programmation \u00e9volu\u00e9 de l\u2019histoire de l\u2019informatique. Cr\u00e9\u00e9 en 1957 par John\u00a0Backus\u00a0chez IBM pour simplifier le dialogue avec la machine et le rendre\u00a0 plus proche du langage humain.\u00a0<\/span><\/p>\n

Il est tr\u00e8s souvent utilis\u00e9 pour faire\u00a0faire\u00a0\u00e0 la machine des calculs compliqu\u00e9s dans les domaines scientifiques.\u00a0<\/span><\/p>\n

\u00a0<\/span>*\u00a0\u00a0\u00a0\u00a0\u00a0euclid.f\u00a0(FORTRAN 77)\u00a0<\/span>\n*\u00a0\u00a0\u00a0\u00a0\u00a0Find\u00a0greatest\u00a0common\u00a0divisor\u00a0using\u00a0the\u00a0Euclidean\u00a0algorithm\u00a0<\/span>\n\n\u00a0 \u00a0 \u00a0 PROGRAM\u00a0EUCLID\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 PRINT\u00a0*,\u00a0'A?'\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 READ\u00a0*,\u00a0NA\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 IF\u00a0(NA.LE.0)\u00a0THEN\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 PRINT\u00a0*,\u00a0'A must\u00a0be\u00a0a positive\u00a0integer.'\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 STOP\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 END IF\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 PRINT\u00a0*,\u00a0'B?'\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 READ\u00a0*,\u00a0NB\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 IF\u00a0(NB.LE.0)\u00a0THEN\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 PRINT\u00a0*,\u00a0'B must\u00a0be\u00a0a positive\u00a0integer.'\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 STOP\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 END IF\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 PRINT\u00a0*,\u00a0'The GCD of',\u00a0NA,\u00a0' and',\u00a0NB,\u00a0'\u00a0is',\u00a0NGCD<\/b>(NA,\u00a0NB), '.'\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 STOP\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 END\u00a0<\/span>\n\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0FUNCTION\u00a0NGCD<\/b>(NA,\u00a0NB)\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 IA\u00a0=\u00a0NA\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 IB\u00a0=\u00a0NB\u00a0<\/span>\n\u00a0 \u00a0\u00a0<\/b>1<\/b>\u00a0\u00a0\u00a0IF\u00a0(IB.NE.0)\u00a0THEN\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ITEMP\u00a0=\u00a0IA\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 IA\u00a0=\u00a0IB\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 IB\u00a0=\u00a0MOD<\/b>(ITEMP,\u00a0IB)\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 GOTO\u00a01<\/b>\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 END IF\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 NGCD\u00a0=\u00a0IA\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 \u00a0 RETURN\u00a0<\/span>\n\u00a0 \u00a0 \u00a0 END\u00a0<\/span><\/pre>\n
Je profite de ce premier exemple (en fortran de 1977) pour expliquer diff\u00e9rents aspects du langage de programmation :\u00a0<\/span><\/p>\n
    \n
  • Utiliser des mots cl\u00e9s pour\u00a0structurer\u00a0<\/b>le programme et donner des\u00a0instructions\u00a0<\/b>\u00e0 l’ordinateur : je les ai colori\u00e9s en bleu (PROGRAM ,\u00a0FUNCTION, THEN, etc.).\u00a0<\/span><\/li>\n
  • Mettre les\u00a0donn\u00e9es\u00a0<\/b>qu’on manipule dans des\u00a0variables\u00a0<\/b>avec un nom. Je les ai colori\u00e9s en orange.(\u00a0NA, NB, ITEMP\u00a0, etc.).\u00a0<\/span><\/li>\n
  • Permettre de saisir des\u00a0valeurs fixes<\/b>\u00a0dans le code. Je les ai colori\u00e9es en vert.\u00a0<\/span>\u00a0(‘A?’, ‘B must be\u00a0a\u00a0positive\u00a0integer.’,\u00a0etc.)\u00a0<\/span><\/li>\n
  • Permettre de cr\u00e9er des\u00a0sous-programme<\/b>s<\/b>\u00a0et de les appeler depuis le code principal.\u00a0Ici il y a le sous-programme\u00a0NGCD\u00a0<\/b>qui est appel\u00e9\u00a0depuis le programme principal\u00a0EUCLID<\/b>.\u00a0<\/span><\/li>\n<\/ul>\n
     <\/p>\n
    Cobol\u202f:\u00a0<\/span><\/h1>\n
    Cobol est un langage de programmation cr\u00e9\u00e9 en 1959. Le but \u00e9tait de cr\u00e9er\u00a0un langage naturel humain, avec des phrases compl\u00e8tes r\u00e9dig\u00e9es\u00a0en anglais, sans oublier le point \u00e0 la fin de la phrase\u202f!\u00a0<\/span><\/p>\n
    Cobol est un langage bavard.\u00a0Le langage Cobol \u00e9tait de loin le langage le plus employ\u00e9 dans les domaines de la gestion et\u00a0de\u00a0la comptabilit\u00e9 jusque dans les ann\u00e9es 1980, et reste toujours utilis\u00e9 en particulier dans les banques. C\u2019est en partie l\u2019existence de programmes\u00a0anciens\u00a0dans ce langage qui a fait craindre le bogue de l\u2019an 2000.\u00a0<\/span><\/p>\n
    Voici\u00a0un exemple de petit programme o\u00f9\u00a0j’ai colori\u00e9 avec la m\u00eame logique que pour le programme Fortran.\u00a0<\/span><\/p>\n
    $ SET SOURCEFORMAT\"FREE\"\u00a0<\/span>\nIDENTIFICATION DIVISION.\u00a0<\/span>\nPROGRAM-ID.\u00a0\u00a0Multiplier<\/b>.\u00a0<\/span>\nAUTHOR.\u00a0\u00a0Michael Coughlan.\u00a0<\/span>\n\n* Example program\u00a0using\u00a0ACCEPT, DISPLAY and MULTIPLY to\u00a0\u00a0<\/span>\n*\u00a0get\u00a0two\u00a0single digit\u00a0numbers\u00a0from\u00a0the user and\u00a0multiply\u00a0them\u00a0together\u00a0<\/span>\n\nDATA DIVISION.\u00a0<\/span>\nWORKING-STORAGE SECTION.\u00a0<\/span>\n01\u00a0\u00a0Num1\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0PIC 9\u00a0 VALUE ZEROS.\u00a0<\/span>\n01\u00a0\u00a0Num2\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0PIC 9\u00a0 VALUE ZEROS.\u00a0<\/span>\n01\u00a0\u00a0Result\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0PIC 99 VALUE ZEROS.\u00a0<\/span>\n\nPROCEDURE DIVISION.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nDISPLAY\u00a0\"Enter first\u00a0number\u00a0 (1 digit) : \"\u00a0WITH NO ADVANCING.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nACCEPT\u00a0Num1.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nDISPLAY\u00a0\"Enter second\u00a0number\u00a0(1 digit) : \"\u00a0WITH NO ADVANCING.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nACCEPT\u00a0Num2.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nMULTIPLY\u00a0Num1\u00a0BY\u00a0Num2\u00a0GIVING\u00a0Result.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nDISPLAY\u00a0\"Result\u00a0is\u00a0= \",\u00a0Result.\u00a0\u00a0\u00a0\u00a0\u00a0<\/span>\nSTOP RUN.\u00a0<\/span><\/pre>\n
    \u00a0<\/span>Pour l’histoire familiale, ma grand-m\u00e8re paternelle a appris le cobol dans les ann\u00e9es 70 et a programm\u00e9 penda<\/i>nt 2-3 ann\u00e9es ! L’ordinateur \u00e9tait<\/i>\u00a0un ordinateur de troisi\u00e8me g\u00e9n\u00e9ration dans une administration dont j’ai parl\u00e9 dans mon pr\u00e9c\u00e9dent Trape<\/i>\u00a0(comme sur la photo \u00e0 cot\u00e9.<\/i>)<\/i>.<\/i>\u00a0<\/span><\/p>\n
    Basic\u202f:\u00a0<\/span><\/h1>\n
    Basic est un langage de programmation, invent\u00e9 en 1964. Il a \u00e9t\u00e9 rendu c\u00e9l\u00e8bre car un interpr\u00e9teur Basic \u00e9quipait tous les premiers ordinateurs personnels dans les ann\u00e9es 70. Comme son nom l\u2019indique, il a \u00e9t\u00e9 con\u00e7u pour \u00eatre facilement et rapidement appris\u00a0par un d\u00e9butant.\u00a0<\/span><\/p>\n
    Ce langage est encore utilis\u00e9 de nos jours.\u00a0\u00a0<\/span><\/p>\n
    10\u00a0INPUT<\/b>\u00a0\"What\u00a0is\u00a0your\u00a0name: \";\u00a0U$\u00a0<\/span>\n20\u00a0PRINT<\/b>\u00a0\"Hello \";\u00a0U$\u00a0<\/span>\n30\u00a0INPUT<\/b>\u00a0\"How\u00a0many\u00a0stars do\u00a0you\u00a0want: \";\u00a0N\u00a0<\/span>\n40\u00a0S$\u00a0=\u00a0\"\"\u00a0<\/span>\n50\u00a0FOR<\/b>\u00a0I\u00a0=\u00a01\u00a0TO<\/b>\u00a0N\u00a0<\/span>\n60\u00a0S$\u00a0=\u00a0S$\u00a0+\u00a0\"*\"\u00a0<\/span>\n70\u00a0NEXT<\/b>\u00a0I\u00a0<\/span>\n80\u00a0PRINT<\/b>\u00a0S$\u00a0<\/span>\n90\u00a0INPUT<\/b>\u00a0\"Do\u00a0you\u00a0want more stars? \";\u00a0A$\u00a0<\/span>\n100\u00a0IF<\/b>\u00a0LEN<\/b>(A$)\u00a0=\u00a00\u00a0THEN<\/b>\u00a0GOTO<\/b>\u00a090\u00a0<\/span>\n110\u00a0A$\u00a0=\u00a0LEFT$<\/b>(A$,\u00a01)\u00a0<\/span>\n120\u00a0IF<\/b>\u00a0A$\u00a0=\u00a0\"Y\"\u00a0OR<\/b>\u00a0A$\u00a0=\u00a0\"y\"\u00a0THEN<\/b>\u00a0GOTO<\/b>\u00a030\u00a0<\/span>\n130\u00a0PRINT<\/b>\u00a0\"Goodbye \";\u00a0U$\u00a0<\/span>\n140\u00a0END<\/b>\u00a0<\/span><\/pre>\n
    \u00a0<\/span>En Basic toutes les lignes ont un num\u00e9ro (rouge); Le mot GOTO permet d’aller directement \u00e0 la ligne qui\u00a0a ce num\u00e9ro. Si vous allez voir l’exemple Fortran il y avait aussi un GOTO, je vous laisse le trouver \ud83d\ude09\u00a0<\/span><\/p>\n
    Pour un autre clin d’\u0153il \u00e0 l’histoire familiale, c’est en<\/i>\u00a0basic que mon p\u00e8re a commenc\u00e9 \u00e0 programmer<\/i>\u00a0quand il\u00a0<\/i>\u00e9tait<\/i>\u00a0en 2<\/i>\u00e8me ann\u00e9e<\/i>\u00a0de lyc\u00e9e. Les ordinateurs \u00e9taient un TO7-70 et un TRS-80<\/i>, comme sur les photos ci-dessous.<\/i>\u00a0<\/span><\/p>\n
    Dans mon pr\u00e9c\u00e9dent\u00a0<\/i>Trape<\/i>, j’ai expliqu\u00e9 que ces ordinateurs \u00e9taient au d\u00e9but de la micro informatique. Bien loin du PC de gamer que j’ai construit pour mon\u00a0<\/i>Trape<\/i>\u00a0!<\/i>\u00a0<\/span><\/p>\n
    \u00a0<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"
    Dans mon travail personnel pr\u00e9c\u00e9dent, j’ai parl\u00e9 de l’histoire des ordinateurs, des origines jusqu’aux\u00a0ordinateurs personnels\u00a0d’aujourd’hui.\u00a0 Avec la deuxi\u00e8me g\u00e9n\u00e9ration de grands ordinateurs\u00a0(1960), j’avais vu que deux langages \u00e9taient apparus \u00e0 cette \u00e9poque : Fortran et Cobol.\u00a0 De m\u00eame, l’invention\u00a0des micro-ordinateurs\u00a0(1970), combin\u00e9e\u00a0\u00e0\u00a0l’utilisation du Basic a permis\u00a0d’imaginer plein de nouveaux\u00a0logiciels.\u00a0 Les machines et les langages de programmation Continue Reading<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[28,36,38,41,4,14],"tags":[54],"class_list":["post-457","post","type-post","status-publish","format-standard","hentry","category-histoire-programmation-java","category-basic","category-cobol","category-fortran","category-histoire","category-programmation","tag-fortran"],"_links":{"self":[{"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/posts\/457","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/comments?post=457"}],"version-history":[{"count":0,"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/posts\/457\/revisions"}],"wp:attachment":[{"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/media?parent=457"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/categories?post=457"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wollef.org\/blog\/wp-json\/wp\/v2\/tags?post=457"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}