1 / 37

Figure:

Figure:. Computer Science an overview EDITION 7. J. Glenn Brookshear. C H A P T E R 5. Programming Languages. Figure 5.1: Generations of programming languages. Figure 5.2: The evolution of programming paradigms.

elijah
Download Presentation

Figure:

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. Figure: Computer Science an overview EDITION 7 J. Glenn Brookshear

  2. C H A P T E R5 Programming Languages

  3. Figure 5.1: Generations of programming languages

  4. Figure 5.2: The evolution of programming paradigms

  5. Figure 5.3: A function that computes the average of a list of numbers constructed from the simpler functions Sum, Count, and Divide

  6. Figure 5.4: The composition of a typical imperative program or program unit

  7. Figure 5.5: The same variable declarations in different languages

  8. Figure 5.6: A two-dimensional array with two rows and nine columns

  9. Figure 5.7: Declaration of heterogeneous arrays in Pascal and C (continued)

  10. Figure 5.7: Declaration of heterogeneous arrays in Pascal and C

  11. Figure 5.8: Control struc-tures and their representations in C, C++, C#, and Java (continued)

  12. Figure 5.8: Control struc-tures and their representations in C, C++, C#, and Java

  13. Figure 5.9: The for loop structure and its representation in Pascal, C++, C#, and Java (continued)

  14. Figure 5.9: The for loop structure and its representation in Pascal, C++, C#, and Java

  15. Figure 5.10: The flow of control involving a procedure

  16. Figure 5.11: The procedure Project Population written in the programming language C

  17. Figure 5.12: Executing the procedure Demo and passing parameters by value (continued)

  18. Figure 5.12: Executing the procedure Demo and passing parameters by value (continued)

  19. Figure 5.12: Executing the procedure Demo and passing parameters by value

  20. Figure 5.13: Executing the procedure Demo and passing parameters by reference (continued)

  21. Figure 5.13: Executing the procedure Demo and passing parameters by reference (continued)

  22. Figure 5.13: Executing the procedure Demo and passing parameters by reference

  23. Figure 5.14: The function CylinderVolume written in the programming language C

  24. Figure 5.15: An example of formatted output

  25. Figure 5.16: The translation process

  26. Figure 5.17: A syntax diagram of our if-then-else pseudocode statement

  27. Figure 5.18: Syntax diagrams describing the structure of a simple algebraic expression

  28. Figure 5.19: The parse tree for the string x + y  z based on the syntax diagrams in Figure 5.18

  29. Figure 5.20: Two distinct parse trees for the statement if B1 then if B2 then S1 else S2 (continued)

  30. Figure 5.20: Two distinct parse trees for the statement if B1 then if B2 then S1 else S2 (continued)

  31. Figure 5.21: An object-oriented approach to the translation process

  32. Figure 5.22: The complete program preparation process

  33. Figure 5.23: The structure of a class describing a laser weapon in a computer game

  34. Figure 5.24: A class with a constructor

  35. Figure 5.25: Our LaserClass definition using encapsulation as it would appear in a Java or C# program

  36. Figure 5.26: Resolving the statements (P OR Q) and (R OR  Q) to produce (P OR R)

  37. Figure 5.27: Resolving the statements (P OR Q), (R OR Q), R, and P

More Related