1 / 43

Hack Your Language CS164: Introduction to Programming Languages and Compilers Lecture 1, Fall 2009

2. Before we start. Lectures are not mandatory. In case you decide to attend,turn off your cell phone ringers, andclose your laptops.Seriously.. 1. You work in a little web search company. Your boss says: We will conquer the world only if our search box answers all questions the user may ask." So you build gcalc:Then you remember cs164 and easily add unit conversion:This is how long a brain can live on six beers, energy-wise. CS164 helps you answer questions your boss really cares about..

mercury
Download Presentation

Hack Your Language CS164: Introduction to Programming Languages and Compilers Lecture 1, Fall 2009

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. 1 Hack Your Language! CS164: Introduction to Programming Languages and Compilers Lecture 1, Fall 2009 Instructor: Ras Bodik GSI: Joel Galenson UC Berkeley

    2. 2 Before we start Lectures are not mandatory. In case you decide to attend, turn off your cell phone ringers, and close your laptops. Seriously.

    3. 1. You work in a little web search company Your boss says: “We will conquer the world only if our search box answers all questions the user may ask.” So you build gcalc: Then you remember cs164 and easily add unit conversion: This is how long a brain can live on six beers, energy-wise. CS164 helps you answer questions your boss really cares about. 3 How may Cliff Bars are needed to keep your brain sufficiently fed during an exam: 25W * 80 minutes / 240 Calories --> 0.119502868069 How long will your brain last on the beer you have after the exam: half a dozen pints * (110 Calories per 12 fl oz) / 25W in days --> 1.70459259187 * days How may Cliff Bars are needed to keep your brain sufficiently fed during an exam: 25W * 80 minutes / 240 Calories --> 0.119502868069 How long will your brain last on the beer you have after the exam: half a dozen pints * (110 Calories per 12 fl oz) / 25W in days --> 1.70459259187 * days

    4. 2. Then you work in a tiny browser outfit You observe JavaScript programmers and take pity. Instead of var nodes = document.getElementsByTagName('a'); for (var i = 0; i < nodes.length; i++) { var a = nodes[i]; a.addEventListener('mouseover', function(event) { event.target.style.backgroundColor=‘orange'; }, false ); a.addEventListener('mouseout', function(event) { event.target.style.backgroundColor=‘white'; }, false ); } you let them write this, abstracting from iteration and events jQuery('a').hover( function() { jQuery(this).css('background-color', 'orange'); }, function() { jQuery(this).css('background-color', 'white'); } ); jQuery was developed by John Resig, now at Mozilla 4 The jQuery code The jQuery code

    5. … and the fame follows 5

    6. 3. Then you write visual scripting for musicians Allowing non-programmers produce interactive music by “patching” visual metaphors of electronic blocks: Guitair Zeros: a S.F. band enabled by the Max/MSP language. Max/MSP was created by Miller Puckette and is now developed by Cycling ’74. 6 Radiohead guitarist uses Max/MSP “all the time”. Patch copied from the GZ web pageRadiohead guitarist uses Max/MSP “all the time”. Patch copied from the GZ web page

    7. 4. Then you live in open source You see Linux developers suffer from memory bugs, such as buffer overruns, and dangling pointers (i.e., accesses to freed memory). x = new Foo() … y=x … free(y) … x.f = 5 You design a tool that associates each bit in memory with a valid bit, set by new and reset by free. When a location is accessed, you check its validity. To add these checks, the implementation rewrites the binary of the program, and adds shadow memory. Valgrind was developed by Julian Seward 7

    8. 5. Then you decide to get a PhD You get tired of the PowerPoint and its animations. Or you simply are not a WYSIWIG person. You embed a domain-specific language (DSL) into Ruby. see slide 8 in http://cs164fa09.pbworks.com/f/01-rfig-tutorial.pdf 8

    9. The animation in rfig, a Ruby-based language slide!('Overlays', 'Using overlays, we can place things on top of each other.', 'The pivot specifies the relative positions', 'that should be used to align the objects in the overlay.', overlay('0 = 1', hedge.color(red).thickness(2)).pivot(0, 0), staggeredOverlay(true, # True means that old objects disappear 'the elements', 'in this', 'overlay should be centered', nil).pivot(0, 0), cr, pause, # pivot(x, y): -1 = left, 0 = center, +1 = right staggeredOverlay(true, 'whereas the ones', 'here', 'should be right justified', nil).pivot(1, 0), nil) { |slide| slide.label('overlay').signature(8) } rfig was developed by Percy Liang, now a Berkeley student 9

    10. More examples of how cs164 will help 10 make (see Bill McKloskey), lisp startup (language extensibility) Rails (framework) Java vs. Python vs. ML (choice of suitable language) Test configurations scripting (Chris) js --> classes Prototype make (see Bill McKloskey), lisp startup (language extensibility) Rails (framework) Java vs. Python vs. ML (choice of suitable language) Test configurations scripting (Chris) js --> classes Prototype

    11. 11 Take cs164. Become unoffshorable.

    12. How is this compiler class different? Not a compiler class at all. It’s about: foundations of programming langauges but also how to design your own languages how to implement them and about PL tools, such as analyzers Ans also learn about some classical C.S. algorithms. 12

    13. How is this PL/compiler class different? Not intended for future compiler engineers there are few among our students ... but for software developers raise your hand if you plan to be one But why does a developer or hacker need a PL class? we’ll take a stab at this question today 13

    14. 14 Why a software engineer/developer needs PL New languages will keep coming Understand them, choose the right one. Write code that writes code Be the wizard, not the typist. Develop your own language. Are you kidding? No. Learn about compilers and interpreters. Programmer’s main tools.

    15. 15 Overview how many languages does one need? trends in programming languages ... and why they matter to you course logistics

    16. New Languages will Keep Coming

    17. 17 A survey: how many languages did you use? Let’s list them here:

    18. 18 Be prepared to program in new languages Languages undergo constant change FORTRAN 1953 ALGOL 60 1960 C 1973 C++ 1985 Java 1995 Evolution steps: 12 years per widely adopted language are we overdue for the next big one? ... or is the language already here? Hint: are we going through a major shift in what computation programs need to express? your answer here:

    19. 19 Develop your own language Are you kidding? No. Guess who developed: PHP Ruby JavaScript perl Done by smart hackers like you in a garage not in academic ivory tower Our goal: learn good academic lessons so that your future languages avoid known mistakes

    20. Trends in Programming Languages

    21. 21 Trends in programming languages programming language and its interpreter/compiler: programmer’s primary tools you must know them inside out languages have been constantly evolving ... what are the forces driving the change? ... and will keep doing so to predict the future, let’s examine the history…

    22. 22 ENIAC (1946, University of Philadelphia) 1946 ENIAC was unveiled in Philadelphia. ENIAC represented still a stepping stone towards the true computer, for differently than Babbage, Eckert and Mauchly, although they knew that the machine was not the ultimate in the state-of-the-art technology, completed the construction. ENIAC was programmed through the rewiring the interconnections between the various components and included the capability of parallel computation. ENIAC was later to be modified into a stored program machine, but not before other machines had claimed the claim to be the first true computer. 1946 was the year in which the first computer meeting took place, with the University of Pennsylvania organizing the first of a series of "summer meetings" where scientists from around the world learned about ENIAC and their plans for EDVAC. Among the attendees was Maurice Wilkes from the University of Cambridge who would return to England to build the EDSAC. Later that year Eckert and Mauchly, in a patent dispute with the University of Pennsylvania, left the University to establish the first computer company -- Electronic Control Corp. with a plan to build the Universal Automatic Computer (UNIVAC). After many crises they built the BINAC for Northrup Aviation, and were taken over by Remington-Rand before the UNIVAC was completed. At the same time the Electronic Research Associates (ERA) was incorporated in Minneapolis and took their knowledge of computing devices to create a line of computers; later ERA was also assimilated into Remington-Rand. 1946 ENIAC was unveiled in Philadelphia. ENIAC represented still a stepping stone towards the true computer, for differently than Babbage, Eckert and Mauchly, although they knew that the machine was not the ultimate in the state-of-the-art technology, completed the construction. ENIAC was programmed through the rewiring the interconnections between the various components and included the capability of parallel computation. ENIAC was later to be modified into a stored program machine, but not before other machines had claimed the claim to be the first true computer. 1946 was the year in which the first computer meeting took place, with the University of Pennsylvania organizing the first of a series of "summer meetings" where scientists from around the world learned about ENIAC and their plans for EDVAC. Among the attendees was Maurice Wilkes from the University of Cambridge who would return to England to build the EDSAC. Later that year Eckert and Mauchly, in a patent dispute with the University of Pennsylvania, left the University to establish the first computer company -- Electronic Control Corp. with a plan to build the Universal Automatic Computer (UNIVAC). After many crises they built the BINAC for Northrup Aviation, and were taken over by Remington-Rand before the UNIVAC was completed. At the same time the Electronic Research Associates (ERA) was incorporated in Minneapolis and took their knowledge of computing devices to create a line of computers; later ERA was also assimilated into Remington-Rand.

    23. 23 Programming the ENIAC

    24. 24 ENIAC (1946, University of Philadelphia) 1946 ENIAC was unveiled in Philadelphia. ENIAC represented still a stepping stone towards the true computer, for differently than Babbage, Eckert and Mauchly, although they knew that the machine was not the ultimate in the state-of-the-art technology, completed the construction. ENIAC was programmed through the rewiring the interconnections between the various components and included the capability of parallel computation. ENIAC was later to be modified into a stored program machine, but not before other machines had claimed the claim to be the first true computer. 1946 was the year in which the first computer meeting took place, with the University of Pennsylvania organizing the first of a series of "summer meetings" where scientists from around the world learned about ENIAC and their plans for EDVAC. Among the attendees was Maurice Wilkes from the University of Cambridge who would return to England to build the EDSAC. Later that year Eckert and Mauchly, in a patent dispute with the University of Pennsylvania, left the University to establish the first computer company -- Electronic Control Corp. with a plan to build the Universal Automatic Computer (UNIVAC). After many crises they built the BINAC for Northrup Aviation, and were taken over by Remington-Rand before the UNIVAC was completed. At the same time the Electronic Research Associates (ERA) was incorporated in Minneapolis and took their knowledge of computing devices to create a line of computers; later ERA was also assimilated into Remington-Rand. 1946 ENIAC was unveiled in Philadelphia. ENIAC represented still a stepping stone towards the true computer, for differently than Babbage, Eckert and Mauchly, although they knew that the machine was not the ultimate in the state-of-the-art technology, completed the construction. ENIAC was programmed through the rewiring the interconnections between the various components and included the capability of parallel computation. ENIAC was later to be modified into a stored program machine, but not before other machines had claimed the claim to be the first true computer. 1946 was the year in which the first computer meeting took place, with the University of Pennsylvania organizing the first of a series of "summer meetings" where scientists from around the world learned about ENIAC and their plans for EDVAC. Among the attendees was Maurice Wilkes from the University of Cambridge who would return to England to build the EDSAC. Later that year Eckert and Mauchly, in a patent dispute with the University of Pennsylvania, left the University to establish the first computer company -- Electronic Control Corp. with a plan to build the Universal Automatic Computer (UNIVAC). After many crises they built the BINAC for Northrup Aviation, and were taken over by Remington-Rand before the UNIVAC was completed. At the same time the Electronic Research Associates (ERA) was incorporated in Minneapolis and took their knowledge of computing devices to create a line of computers; later ERA was also assimilated into Remington-Rand.

    25. 25 UDSAC (1947, Cambridge University) the first real computer large-scale, fully functional, stored-program electronic digital computer (by Maurice Wilkes) problem: Wilkes realized: “a good part of the remainder of my life was going to be spent in finding errors in ... programs” solution: procedures (1951) procedure: abstracts away the implementation reusable software was born From http://www.computer.org/history/: Maurice Wilkes had realized quickly after the completion of the work on EDSAC at Cambridge University that "a good part of the remainder of [his] life was going to be spent in finding errors in ... programs." With Stanley Gill and David Wheeler he developed the concept of subroutines in programs to create re-usable modules; together they produced the first textbook on "The Preparation of Programs for an Electronic Digital Computer", (Addison-Wesley Publ. Co., New York, 1951). The formalized concept of software development (not to be named for a decade) had its beginning. From http://www.computer.org/history/: Maurice Wilkes had realized quickly after the completion of the work on EDSAC at Cambridge University that "a good part of the remainder of [his] life was going to be spent in finding errors in ... programs." With Stanley Gill and David Wheeler he developed the concept of subroutines in programs to create re-usable modules; together they produced the first textbook on "The Preparation of Programs for an Electronic Digital Computer", (Addison-Wesley Publ. Co., New York, 1951). The formalized concept of software development (not to be named for a decade) had its beginning.

    26. 26 Assembly – the language (UNIVAC 1, 1950) Idea: mnemonic (assembly) code Then translate it to machine code by hand (no compiler yet) write programs with mnemonic codes (add, sub), with symbolic labels, then assign addresses by hand Example of symbolic assembler clear-and-add a add b store c translate it by hand to something like this (understood by CPU) B100 A200 C300 Drop this slide? With assemblers and compilers not yet developed, for the Univac to access a number in memory required that I first give it a specific address out of the 1,000 available locations. For example, to add two numbers together that were found in locations 100 and 200, the following code would have to be executed: Bring the contents of location 100 into the add register. Add the contents of location 200 to the add register. Store the sum, which was in the add register, into location 300. Thus it took three instructions, or one and a half words, to add two numbers together and save the result. The coding would look like this: B100 A200 C300 If we could use symbolic locations and assign the actual locations later, it would help to organize the memory more efficiently. Also, if we changed some record or code, it would not be so tedious to correct the code. After training, we manually coded symbolically such as clear and add a, add b, store c and supplied the exact addresses at the end of coding. Drop this slide? With assemblers and compilers not yet developed, for the Univac to access a number in memory required that I first give it a specific address out of the 1,000 available locations. For example, to add two numbers together that were found in locations 100 and 200, the following code would have to be executed: Bring the contents of location 100 into the add register. Add the contents of location 200 to the add register. Store the sum, which was in the add register, into location 300. Thus it took three instructions, or one and a half words, to add two numbers together and save the result. The coding would look like this: B100 A200 C300 If we could use symbolic locations and assign the actual locations later, it would help to organize the memory more efficiently. Also, if we changed some record or code, it would not be so tedious to correct the code. After training, we manually coded symbolically such as clear and add a, add b, store c and supplied the exact addresses at the end of coding.

    27. 27 Assembler – the compiler (Manchester, 1952) it was assembler nearly as we know it, called AutoCode a loop example, in MIPS, a modern-day assembly code: loop: addi $t3, $t0, -8 addi $t4, $t0, -4 lw $t1, theArray($t3) # Gets the last lw $t2, theArray($t4) # two elements add $t5, $t1, $t2 # Adds them together... sw $t5, theArray($t0) # ...and stores the result addi $t0, $t0, 4 # Moves to next "element“ # of theArray blt $t0, 160, loop # If not past the end of # theArray, repeat jr $ra

    28. 28 Assembly programming caught on, but Problem: Software costs exceeded hardware costs! John Backus: “Speedcoding” An interpreter for a high-level language Ran 10-20 times slower than hand-written assembly way too slow

    29. 29 FORTRAN I (1954-57) Langauge, and the first compiler Produced code almost as good as hand-written Huge impact on computer science (laid foundations for cs164) Modern compilers preserve its outlines FORTRAN (the language) still in use today By 1958, >50% of all software is in FORTRAN Cut development time dramatically 2 weeks ? 2 hrs that’s more than 100-fold

    30. 30 FORTRAN I (IBM, John Backus, 1954) Example: nested loops in FORTRAN a big improvement over assembler, but annoying artifacts of assembly remain: labels and rather explicit jumps (CONTINUE) lexical columns: the statement must start in column 7 The MIPS loop from previous slide, in FORTRAN: DO 10 I = 2, 40 A[I] = A[I-1] + A[I-2] 10 CONTINUE

    31. 31 Side note: designing a good language is hard Good language protects against bugs, but lessons take a while. An example that caused a failure of a NASA planetary probe: buggy line: DO 15 I = 1.100 what was intended (a dot had replaced the comma): DO 15 I = 1,100 because Fortran ignores spaces, compiler read this as: DO15I = 1.100 which is an assignment into a variable DO15I, not a loop. This mistake is harder to make (if at all possible) with the modern lexical rules (white space not ignored) and loop syntax for (i=1; i < 100; i++) { … }

    32. 32 Goto considered harmful L1: statement if expression goto L1 statement Dijkstra says: gotos are harmful use structured programming lose some performance, gain a lot of readability how do you rewrite the above code into structured form?

    33. 33 Object-oriented programming (1970s) The need to express that more than one object supports draw() : draw(2DElement p) { switch (p.type) { SQUARE: … // draw a square break; CIRCLE: … // draw a circle break; } } Problem: unrelated code (drawing of SQUARE and CIRCLE) mixed in same procedure Solution: Object-oriented programming with inheritance

    34. 34 Object-oriented programming In Java, the same code has the desired separation: class Circle extends 2DElement { void draw() { <draw circle> } } class Square extends 2DElement { void draw() { <draw circle> } } the dispatch is now much simpler: p.draw()

    35. 35 Review of historic development wired interconnects ? stored program (von Neuman machines) lots of common bugs in repeated code ? procedures machine code ? symbolic assembly (compiled by hand) tedious compilation ? assembler (the assembly compiler) assembly ? FORTRAN I gotos ? structured programming hardcoded “OO” programming ? inheritance, virtual calls Do you see a trend? Removal of boilerplate code also called plumbing, meaning it conveys no application logic Done by means of new abstractions, such as procedures They abstract away from details we don’t wish to reason about

    36. 36 Where will languages go from here? The trend is towards higher-level abstractions express the algorithm concisely! which means hiding often repeated code fragments new language constructs hide more of these low-level details. Also, detect more bugs when the program is compiled with stricter type checking with tools that loom for bugs in eth program or in its execution

    37. … and why the trends matter to you

    38. 38 Take cs164. Become unoffshorable.

    39. 39 Don’t be a boilerplate programmer Build tools for others libraries frameworks code generators small languages (such as configuration languages) big languages

    40. course logistics (see course info on the web for more)

    41. Administrativia Wed section at 5pm We’ll try to move it Can you suggest times that would work for you? Waitlist Hopefully all of you will get in 41

    42. 42 Academic (Dis)honesty Read the policy at: http://www.eecs.berkeley.edu/Policies/acad.dis.shtml We’ll be using a state-of-the art plagiarism detector. Before you ask: yes, it works very well. You are allowed to discuss the assignment but you must acknowledge (and describe) help in your submission.

    43. 43 Grading Grades will follow department guidelines course average GPA will be around 2.9 (before extra credit for the optimization contest) more at http://www.eecs.berkeley.edu/Policies/ugrad.grading.shtml this has proven to be fair A lot of grade comes from a project form a strong team use the course newsgroup to find a partner

    44. Conclusion

More Related