1 / 34

CS 150 lecture 2

CS 150 lecture 2. Review. Reasons for studying programming languages Language evaluation criteria Readability Simplicity? Orthogonality? Writability Influences on language design Language design trade offs Implementation methods.

amelia
Download Presentation

CS 150 lecture 2

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 150 lecture 2

  2. Review • Reasons for studying programming languages • Language evaluation criteria • Readability • Simplicity? • Orthogonality? • Writability • Influences on language design • Language design trade offs • Implementation methods

  3. “those that forget their history are doomed to repeat it.”

  4. Thanks to Google images…

  5. Plankakul • Konrad Zuse • Why did this come to be?

  6. Speedcoding • John Backus

  7. Univac Compiling System • Grace Murray Hooper

  8. Von Neumann Machines

  9. Fortran • John Backus and group

  10. LISP1958 (defun append (L M) (cond ((null L) M) (T (cons (car l) (append (cdr L) M)) ))) John McCarthy

  11. ML (Meta Language) 1980’s • Robin Milner fun size Empty = 0 (* size of b_tree = # nodes *) | size (Node (lft, _, rht)) = 1 + size lft + size rht;

  12. Peter Naur : ACM and GAMMALGOL ALGOL 58 Program // the main program, calculate the mean of // some numbers begin integer N; Read Int(N); begin real array Data[1:N]; real sum, avg; integer i; sum:=0; for i:=1 step 1 until N do begin real val; Read Real(val); Data[i]:=if val<0 then -val else val end; for i:=1 step 1 until N do sum:=sum Data[i]; avg:=sum/N; Print Real(avg) end end

  13. Grace Murray Hopper, againCOBOL 1959 PROCEDURE DIVISION. MAIN-PARAGRAPH. MOVE X TO Y IF Y > Z THEN ADD Z TO X MOVE X TO Z ELSE DISPLAY END-IF STOP RUN.

  14. John Kemeny of DartmouthBASIC Dartmouth 1960’s LET X=5 DIM INTLIST(99) INPUT LISTLEN

  15. PL/I • Because of?

  16. Ken Iverson --APL 1960

  17. Ralph GriswoldSNOBOL 1960’s • String pattern matching

  18. SIMULA 1967 • Basic idea of class • Nygaard and Dahl

  19. Niklaus WirthPascal • Simplicity by design • Then Modula • Then Oberon

  20. Ada 1970’s to 1983 • What is ADA for?

  21. Alan Kay : Smalltalk • OOP • Xerox Parc

  22. C • Dennis Ritchie • Based on the language B • At Bell labs – used in the UNIX project

  23. C++ • Bjarne Stroustrup

  24. Bertran Meyer : Eiffel • hybrid

  25. Jame Gosling : Java • SUN

  26. C# • Anders Hejlsberg • Designer of Turbo Pascal • Microsoft product

  27. For all you Linux buffs

  28. Class discussion • Continuation of evolution? What would be the ideal programming language today?

  29. Assignment • How/In what terms did the speaker discuss evolution in the video? • Is he an advocate of functional programming languages or no?

More Related