Chapter 6: Programming Languages

Slides:



Advertisements
Similar presentations
Overview of programming in C C is a fast, efficient, flexible programming language Paradigm: C is procedural (like Fortran, Pascal), not object oriented.
Advertisements

ICE1341 Programming Languages Spring 2005 Lecture #6 Lecture #6 In-Young Ko iko.AT. icu.ac.kr iko.AT. icu.ac.kr Information and Communications University.
Programming Languages and Paradigms
Programming Paradigms Introduction. 6/15/2005 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved. L1:
Chapter 8 High-Level Programming Languages. 8-2 Chapter Goals Describe the translation process and distinguish between assembly, compilation, interpretation,
Introduction to Programming Languages Nai-Wei Lin Department of Computer Science and Information Engineering National Chung Cheng University.
Chapter 5: Elementary Data Types Properties of types and objects –Data objects, variables and constants –Data types –Declarations –Type checking –Assignment.
High-Level Programming Languages
Programming Languages Structure
Programming Languages
Chapter 8 High-Level Programming Languages Nell Dale John Lewis.
Chapter 8 High-Level Programming Languages (modified by Erin Chambers)
High-Level Programming Languages: C++
Chapter 8 High-Level Programming Languages. 2 Compilers High-level language A language that provides a richer (more English like) set of instructions.
CIS Computer Programming Logic
Introduction Computer science is the discipline that seeks to build a scientific foundation for a variety of topics. Computer science provides the underpinnings.
AS Computing Introduction to Programming. What is a Computer Program? A list of instructions that a computer must work through, in a logical sequence,
Programming Languages: History & Traditional Concepts CSC 2001.
1 Introduction Programming Language Design and Implementation (4th Edition) by T. Pratt and M. Zelkowitz Prentice Hall, 2001 Sections
Copyright © 2006 Addison-Wesley. All rights reserved.1-1 ICS 410: Programming Languages.
Chapter 9 Programming Languages
Chapter 6 Programming Languages. © 2005 Pearson Addison-Wesley. All rights reserved 6-2 Chapter 6: Programming Languages 6.1 Historical Perspective 6.2.
Chapter 8 High-Level Programming Languages. 8-2 Chapter Goals Describe the translation process and distinguish between assembly, compilation, interpretation,
Chapter 6 Programming Languages (2) Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Lecture on Programming Languages
Computer Programs and Programming Languages What are low-level languages and high-level languages? High-level language Low-level language Machine-dependent.
Chapter 6 Programming Languages © 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 6 Programming Languages (1) Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Data Structures Using C++ 2E1 Inheritance An “is-a” relationship –Example: “every employee is a person” Allows new class creation from existing classes.
Copyright © 2015 Pearson Education, Inc. Chapter 6: Programming Languages.
Chapter 3 Part II Describing Syntax and Semantics.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Theory of Programming Languages Introduction. What is a Programming Language? John von Neumann (1940’s) –Stored program concept –CPU actions determined.
8-1 Compilers Compiler A program that translates a high-level language program into machine code High-level languages provide a richer set of instructions.
Chapter 8 High-Level Programming Languages. 2 Chapter Goals Describe the translation process and distinguish between assembly, compilation, interpretation,
Chapter 9 ProgrammingLanguages.  Describe the evolution of programming languages from machine language to high-level languages.  Understand how a program.
CPS120: Introduction to Computer Science Variables and Constants.
Overview of Compilation Prepared by Manuel E. Bermúdez, Ph.D. Associate Professor University of Florida Programming Language Principles Lecture 2.
Chapter 1: Preliminaries Lecture # 2. Chapter 1: Preliminaries Reasons for Studying Concepts of Programming Languages Programming Domains Language Evaluation.
Programming Languages Salihu Ibrahim Dasuki (PhD) CSC102 INTRODUCTION TO COMPUTER SCIENCE.
Computer Programming - Key Concepts and Terms Computer Program – A computer program is a set of instructions for computer, arranged in logical order, using.
Compilers Principles, Techniques, & Tools Taught by Jing Zhang
Programming Languages 2nd edition Tucker and Noonan
Information and Computer Sciences University of Hawaii, Manoa
Ch. 7 Programming Languages
Representation, Syntax, Paradigms, Types
Computer Programming.
Chapter 10 Programming Fundamentals with JavaScript
CSCE Fall 2013 Prof. Jennifer L. Welch.
Elements of Programming Languages
Representation, Syntax, Paradigms, Types
High Level Programming Languages
Chap 1 Chap 2 Chap 3 Chap 5 Surprise Me
Representation, Syntax, Paradigms, Types
Chapter 6: Programming Languages
Low Level Programming Languages
CSCE Fall 2012 Prof. Jennifer L. Welch.
Overview of Programming Paradigms
Representation, Syntax, Paradigms, Types
강의 내용 및 방법 접근방법 리포트 시험 Lambda Calculus, Proof of Correctness
Programming Languages and Paradigms
Compilers Principles, Techniques, & Tools Taught by Jing Zhang
Presentation transcript:

Chapter 6: Programming Languages Computer Science: An Overview Eleventh Edition

Chapter 6: Programming Languages Historical Perspective Traditional Programming Concepts Procedural Units Language Implementation Object Oriented Programming Programming Concurrent Activities Declarative Programming (prolog)

Generations of programming languages

Second-generation: Assembly language A system for representing machine instructions Mnemonic names for op-codes Program variables or identifiers: Descriptive names for memory locations, chosen by the programmer

Assembly Language Characteristics One-to-one correspondence between machine instructions and assembly instructions Programmer must think like the machine Inherently machine-dependent Converted to machine language by a program called an assembler

Program Example Machine language 156C 166D 5056 30CE C000 Assembly language LD R5, Price LD R6, ShipCharge ADDI R0, R5 R6 ST R0, TotalCost HLT

Third Generation Language Uses high-level primitives Examples: FORTRAN, COBOL Each primitive corresponds to a sequence of machine language instructions Converted to machine language by a program called a compiler Machine-independent

Interpreter An interpreter is a computer program that directly executes, i.e. performs, instructions written in a programming or scripting language, without compiling them into a machine language program.

Quiz…

The evolution of programming paradigms

An imperative program consists of commands for the computer to perform An imperative program consists of commands for the computer to perform. Imperative programming focuses on describing how a program operates.

A function for checkbook balancing constructed from simpler functions

The composition of a typical imperative program or program unit

Data Types Integer: Whole numbers Real (float): Numbers with fractions Character: Symbols Boolean: True/false

Variables and Data types float Length, Width; int Price, Total, Tax; char Symbol; int WeightLimit = 100;

Data Structure Conceptual shape or arrangement of data A common data structure is the array In C int Scores[2][9]; In FORTRAN INTEGER Scores(2,9)

A two-dimensional array with two rows and nine columns

The conceptual structure of the aggregate type Employee struct { char Name[25]; int Age; float SkillRating; } Employee;

Assignment Statements In C, C++, C#, Java Z = X + y; In Ada Z := X + y; In APL (A Programming Language) Z ← X + y

Control Statements Go to statement As a single statement goto 40 20 Evade() goto 70 40 if (KryptoniteLevel < LethalDose) then goto 60 goto 20 60 RescueDamsel() 70 ... As a single statement if (KryptoniteLevel < LethalDose): RescueDamsel() else: Evade()

Control Statements If in Python In C, C++, C#, and Java In Ada if (condition): statementA else: statementB In C, C++, C#, and Java if (condition) statementA; else statementB; In Ada IF condition THEN statementA; ELSE statementB; END IF;

Control Statements (continued) While in Python while (condition): body In C, C++, C#, and Java while (condition) { body } In Ada WHILE condition LOOP END LOOP;

Control Statements (continued) Switch statement in C, C++, C#, and Java switch (variable) { case 'A': statementA; break; case 'B': statementB; break; case 'C': statementC; break; default: statementD; } In Ada CASE variable IS WHEN 'A'=> statementA; WHEN 'B'=> statementB; WHEN 'C'=> statementC; WHEN OTHERS=> statementD; END CASE;

The for loop structure and its representation in C++, C#, and Java

Comments Explanatory statements within a program Helpful when a human reads a program Ignored by the compiler /* This is a comment. */ // This is a comment

Procedural Units Many terms for this concept: Subprogram, subroutine, procedure, method, function Unit begins with the function’s header Local versus Global Variables Formal versus Actual Parameters

Procedural Units Passing parameters by value vs reference Call by value Call by reference (arrays, pointers)

The flow of control involving a function

The function ProjectPopulation written in the programming language C

Executing the function Demo and passing parameters by value

Executing the function Demo and passing parameters by reference

The fruitful function CylinderVolume written in the programming language C

The translation process the process of converting a program written in a high-level language into a machine-executable form.

A syntax diagram of Python’s if-then-else statement

Syntax diagrams describing the structure of a simple algebraic expression

The parse tree for the string x + y * z

Two distinct parse trees for the statement if B1 then if B2 then S1 else S2

An object-oriented approach to the translation process

Objects and Classes Object: Active program unit containing both data and procedures Class: A template from which objects are constructed An object is called an instance of the class.

The structure of a class describing a laser weapon in a computer game

Components of an Object Instance Variable: Variable within an object Holds information within the object Method: Procedure within an object Describes the actions that the object can perform Constructor: Special method used to initialize a new object when it is first constructed

A class with a constructor

Object Integrity Encapsulation: A way of restricting access to the internal components of an object Private Public Protected

Our LaserClass definition using encapsulation as it would appear in a Java or C# program

Additional Object-oriented Concepts Inheritance: Allows new classes to be defined in terms of previously defined classes Polymorphism: Allows method calls to be interpreted by the object that receives the call

Programming Concurrent Activities Parallel (or concurrent) processing: simultaneous execution of multiple processes True concurrent processing requires multiple CPUs Can be simulated using time-sharing with a single CPU

Creating threads

Controlling Access to Data Mutual Exclusion: A method for ensuring that data can be accessed by only one process at a time Monitor: A data item with the ability to control access to itself

Declarative Programming Resolution: Combining two or more statements to produce a new statement (that is a logical consequence of the originals). Example: (P OR Q) AND (R OR Q) resolves to (P OR R) Resolvent: A new statement deduced by resolution Clause form: A statement whose elementary components are connected by the Boolean operation OR Unification: Assigning a value to a variable so that two statements become “compatible.”

Resolving the statements (P OR Q) and (R OR ¬Q) to produce (P OR R)

Resolving the statements (P OR Q), (R OR ¬Q), ¬R, and ¬P Inconsistent

Prolog Fact: A Prolog statement establishing a fact Consists of a single predicate Form: predicateName(arguments). Example: parent(bill, mary). Rule: A Prolog statement establishing a general rule Form: conclusion :- premise. :- means “if” Example: wise(X) :- old(X). Example: faster(X,Z) :- faster(X,Y), faster(Y,Z).