1. Chapter 9 Programming Languages

2. Have a vision of computer language evolution. Distinguish between machine, assembly, and high-level languages. Understand the process of creating and running a program. After reading this chapter, the reader should be able to: O BJECTIVES Distinguish between the different categories of languages: procedural, object-oriented, functional, declarative, and special. Become familiar with elements of the procedural language C.

3. EVOLUTIONEVOLUTION 9.1

4. Evolution of computer languages Computer language – a set of predefined words that are combined into a program according to predefined rules (syntax).

5. The only language understood by a computer is machine language. Note: Each computer has its own machine language, which is made of streams of 0s and 1s.

6. 00000000000001000000000000000000 0101111000001100110000100000000000000010 11101111000101100000000000000101 11101111100111100000000000001011 1111100010101101 110111110000000000010010 01100010110111110000000000010101 1110111100000010111110110000000000010111 1111010010101101110111110000000000011110 0000001110100010110111110000000000100001 1110111100000010111110110000000000100100 011111101111010010101101 1111100010101110110001010000000000101011 0000011010100010111110110000000000110001 1110111100000010111110110000000000110100 000001000000000000111101 Program 9.1 Program in machine language 12345678910111213141516

7. Symbolic language – simply mirrored the machine languages using symbols to represent the various machine language instructions. Assembler – a special program to translate symbolic code into machine language. Assembly language

8. Entry main,^m subl2 #12,sp jsb C$MAIN_ARGS movab $CHAR_STRING_CON pushal -8(fp) pushal (r2) calls #2,read pushal -12(fp) pushal 3(r2) calls #2,read mull3 -8(fp),-12(fp),- pushal 6(r2) calls #2,print clrl r0 ret Program 9.2 Program in symbolic language 12345678910111213141516

9. High-Level language –  Portable to many different computers  Allow programmer to concentrate on application  Must be converted to machine languages (Compilation) Natural language – English, French, or Chinese

10. /* This program reads two integer numbers from the keyboard and prints their product. */ #include int main (void) { // Local Declarations int number1; int number2; int result; // Statements cin >> number1; cin >> number2; result = number1 * number2; cout << result; return 0; }// main Program 9.3 Program in C++ language 123456789101112131415161718

11. BUILDINGAPROGRAMBUILDINGAPROGRAM 9.2

12. Building a program 1. Writing and Editing 2. Compiling 3. Linking  Running 1. Load 2. Execute

13. Building a program Source file Object file Executable file Assemble all subprograms into final executable program

14. PROGRAMEXECUTIONPROGRAMEXECUTION 9.3

15. Program execution Loader – An OS program to load the program into memory for executing

16. CATEGORIESOFLANGUAGESCATEGORIESOFLANGUAGES 9.4

17. Categories of languages

18. Procedural language – a set of instructions that are executed one by one from beginning to end unless an instruction forces the control elsewhere. When programmers need to solve a problem, they should know the procedure to follow. For each problem, the programmer should carefully design an algorithm, and the algorithm should be carefully translated to instructions. Imperative language – each instruction is a command to the computer to do some specific task.

19. Fortran –  For scientific and engineering application  The first high-level language COBOL –  a business programming language Pascal –  Structured programming for teaching

20. C –  High-level instructions (Structured programming for writing UNIX)  Low-level instructions to access the hardware directly and quickly. Closer to assembly language than any other language. A good language for system programmers.  Efficient language; its instructions are short.  Standardized by ANSI and ISO

21. Procedural language –  Objects – independent from Operations  Objects – passive Object-Oriented language –  An approach to problem solving that is totally different from procedural language.  Objects – tied together with Operations  Objects – active

22. C++ -  Developed by Bell Lab.  adds object-oriented features to its predecessor, C. Java –  Developed by SUN, Based on C and C++  Java source code files are compiled into a format called bytecode, which can then be executed by a Java interpreter.  Compiled Java code can run on most computers because Java interpreters and runtime environments, known as Java Virtual Machines (VMs), exist for most operating systems.  Programs Application – a complete stand-alone program that can be run independently. Applet – embedded in HTML language, stored on a server, and run by a client browser.

23. Function in a functional language In Functional language, a program is considered a mathematical function. A function is a black box that maps a list of inputs to a list of outputs. LISP – designed by MIT

24. Extracting the third element of a list Rest – extracts all the elements except the first. First - extracts all the first elements.

25. HTML (Hypertext Markup Language)  A seudolanguage that includes marks that serve as formatting hints and links to other files.  An HTML file is made of text and tags. An HTML file (page) is stored on the server and can be download by a browser. Browser – removes the tags and interprets them as either formatting hints or links to other files.

26. Table 9.1 Common tags Meaning Meaning ---------------------------- document document head document body document title different header levels boldface Italic underlined subscript superscript centered line break ordered list unordered list an item in the list an image an address (hyperlink) Beginning Tag ---------------- Ending Tag ----------------

27. Sample Document This is the picture of a book: Program 9.4 HTML Program

28. Perl (Practical Extraction and Report Language)  a programming language especially designed for processing text.  one of the most popular languages for writing CGI scripts.  CGI (Common Gateway Interface) programs are the most common way for Web servers to interact dynamically with users. Many HTML pages that contain forms, for example, use a CGI program to process the form's data once it's submitted. SQL (Structured Query Language) – a language used to answer queries about database.

29. A PROCEDURAL LANGUAGE:C LANGUAGE:C 9.5

30. Variables Variables – names for memory locations. Each memory location has an address.  Used by the computer internally  Inconvenient for the programmer

31. Constants constants – data values that cannot be changed during the execution of a program.  Literal constant – a = 2 * p * r ;  Named constant – constant pi = 3.14;  Symbolic constant - #define taxRate 0.0825

32. Table 9.2 Arithmetic operators Example Example ---------------------- 3 + 5  4 Num * 5 Sum / Count Count % 4 ----------------------- Count ++ Count  Operator ----------------   *     Definition ---------------- Addition Subtraction Multiplication Division (quotient) Division (remainder) ----------------------- Increment Decrement

33. Table 9.3 Relational operators Example Example ---------------------- Num1 < 5 Num1 <= 5 Num2 > 3 Num2 >= 3 Num1 == Num2 Num1 != Num2 Operator ---------------- <     Definition ---------------- Less than Less than or equal to Greater than Greater than or equal to Equal to Not equal to

34. Table 9.4 Logical operators Example Example ---------------------- ! ( Num1 < Num2 ) (Num1 10 ) Operator ---------------- ! && Definition ---------------- NOT AND OR

35. Table 9.5 Assignment operators Meaning ---------------------- Store 5 in Num Num = Num + 5 Num = Num  5 Num = Num * 5 Num = Num / 5 Num = Num % 5 Operator ---------------- == +=  = *= /= %= Example Example ---------------- Num = 5 Num += 5 Num  = 5 Num *= 5 Num /= 5 Num %= 5

36. label: goto label; Statement  cause an action to be performed by the program.  translates directly into one or more executable instructions.

37. Statement  Expression statement – a statement by placing a semicolon(;) after it. a++; b = 4; c = b + c * 4;  Compound statement – a unit of code consisting of zero or more statements. { x = 1; y = 20; }

38. Functions  In C, a subroutine is called a function.  A C program is made of one or more functions, one and only one of which must be called main.  The execution of the program always starts and ends with main, but this function can call other functions.  The function main is called by the operating system; main in turn calls other functions. When main is complete, control returns to the operating system.

39. Side effect of a function Side effect  Is an action that results in a change in the state of the program.  Occurs while the function is executing and before the function returns.  In general, the purpose of a function is At the same time, a function can have a side effect.

40. Parameter Passing  Pass by value  Pass by reference Function declaration Function header Function body Return type Formal parameters Actual parameters

41. Parameter Passing  Pass by value – a copy of data is created and placed in a local variable in the called function.  Pass by reference – sends the address of a variable to the called function rather than sending its value.

42. Call by Value void swap(int x, int y) { int temp; temp=x; x=y; y=temp; } ab y x 12 temp main() { int a=1,b=2; swap(a, b); } 12

43. Call by Address (Reference) void swap(int *x, int *y) { int temp; temp=*x; *x=*y; *y=temp; } ab y x 12 temp main() { int a=1,b=2; swap(&a, &b); } 1000 2000 *x *y

44. if-else statement

45. switch statement

46. while loop

47. for loop False

48. do-while loop

49. Recursion C language supports recursion. A function in C can call itself. int fac(int n) { if (n == 0) return(1); else return( n * fact(n-1) ); }

50. Recursion C language supports recursion. A function in C can call itself. int fac(int n) { if (n == 0) return(1); else return( n * fac(n-1) ); }

51. The Towers of Hanoi It is a puzzle about three poles and n disks of increasing sizes. Initially, all the of the disks (all have holes at their centers) are placed on the first pole. Our goal is to transfer all the disks from the first pole to the third. We can move only one disk at a time and it is not allowed to place a larger disk on top of a smaller one. Let T(n) denote the number of moves. Then T(n) = 2T(n-1) + 1. Finally we get T(n) = 2 n - 1. A BC

52. Recursive solution Solve(n, A, B, C) { if (n == 1) A → C else { Solve(n-1, A, C, B) Move from A → C Solve(n-1, B, A, C) } } n A → C B n-1 A → B C n-1 B → C A A → C