# 9/21/17. Outline. Expression Evaluation and Control Flow. Arithmetic Expressions. Operators. Operators. Notation & Placement

Save this PDF as:

Size: px
Start display at page:

Download "9/21/17. Outline. Expression Evaluation and Control Flow. Arithmetic Expressions. Operators. Operators. Notation & Placement"

## Transcription

1 Outline Expression Evaluation and Control Flow In Text: Chapter 6 Notation Operator evaluation order Operand evaluation order Overloaded operators Type conversions Short-circuit evaluation of conditions Control structures N. Meng, S. Arthur 2 Arithmetic Expressions Design issues for arithmetic expressions Notation form? What are the operator precedence rules? What are the operator associativity rules? What is the order of operand evaluation? Are there restrictions on operand evaluation side effects? Does the language allow user-defined operator overloading? Operators A unary operator has one operand A binary operator has two operands A ternary operator has three operands Functions can be viewed as unary operators with an operand of a simple list N. Meng, S. Arthur 3 N. Meng, S. Arthur 4 Operators Argument lists (or parameter lists) treat separators (comma, space) as stacking or append operators A keyword in a language statement can be viewed as functions in which the remainder of the statement is the operand Notation & Placement Prefix op a b op(a,b) (op a b) Infix a op b Postfix a b op N. Meng, S. Arthur 5 N. Meng, S. Arthur 6 1

2 Notation & Placement Most imperative languages use infix notation for binary and prefix for unary operators Lisp: prefix (op a b) Operator Evaluation Order Precedence Associativity Parentheses N. Meng, S. Arthur 7 N. Meng, S. Arthur 8 Operator Precedence Define the order in which adjacent operators of different precedence levels are evaluated Parenthetical groups (...) Exponentiation ** Mult & Div *, / Add & Sub +, - Assignment := Where to put the parentheses? E.g., A * B + C ** D / E - F Only Fortran, Ruby, Visual Basic, and Ada have the exponentiation operator. In all four, exponentiation operator has higher precedence than unary operators Where to place the parentheses in A**B? N. Meng, S. Arthur 9 N. Meng, S. Arthur 10 Operator Associativity The precedence of the arithmetic operators of Ruby and the C-based languages (e.g., C, C++, Java, Python) Ruby C-Based Languages Highest ** postfix ++, -- unary +, - prefix ++, --, unary +, - *, /, % *, /, % Lowest binary +, - binary +, - Define the order in which adjacent operators with the same precedence level are evaluated: Left associative *, /, +, - Right associative ** (exponentiation) Where to put the parentheses? E.g., B ** C ** D - E + F * G / H N. Meng, S. Arthur 11 N. Meng, S. Arthur 12 2

3 Operator Associativity EFFECTIVELY Most programming languages evaluate expressions from left to right LISP uses parentheses to enforce evaluation order APL is strictly RIGHT to LEFT, taking note only of parenthetical groups Operator Associativity Associativity For some operators, the evaluation order does not matter, i.e., (A + B) + C = A + (B + C) However, in a computer when floatingpoint numbers are represented approximately, the mathematical associativity does not always hold E.g., A = 200, B = Float.MIN_VALUE, C = -10 N. Meng, S. Arthur 13 N. Meng, S. Arthur 14 Parentheses Programmers can alter the precedence and associativity rules by placing parentheses in expressions A parenthesized part of an expression has precedence over its adjacent peers without parentheses Parentheses Advantages Allow programmers to specify any desired order of evaluation Do not require author or reader of programs to remember any precedence or association rules Disadvantages Can make writing expressions more tedious May seriously compromise code readability N. Meng, S. Arthur 15 N. Meng, S. Arthur 16 Expression Conversion Although we need parentheses in infix expressions, we don t need parentheses in prefix and postfix expressions The operators are no longer ambiguous with respect to the operands that they work on in prefix and postfix expressions Infix Expression Prefix Expression Pos.ix Expression A+B + A B A B + A+B*C?? (A+B)*C?? N. Meng, S. Arthur 17 N. Meng, S. Arthur 18 3

4 A Motivating Example What is the value of the following expression? * How do you automate the calculation of a postfix expression? Assuming operators include: Highest * / Lowest binary + - Input: a string of a postfix expression Output: a value Algorithm? N. Meng, S. Arthur 19 N. Meng, S. Arthur 20 Project 1 Create an evaluator for logical expressions written in postfix notation Assuming operators include: Highest not! RIGHT associative and & not equal /, equal = Lowest or LEFT associative Operand Evaluation Order If none of the operands of an operator has side effects, then the operand evaluation order does not matter What are side effects? Referential transparency and side effects N. Meng, S. Arthur 21 N. Meng, S. Arthur 22 Side Effects Often discussed in the context of functions A side effect is some permanent state change caused by execution of functions The subsequent computation is influenced other than by the return value for use j = i++ a = 10, b = a + fun(&a) (assume the function can change its parameter value) N. Meng, S. Arthur 23 Side Effects Many imperative languages distinguish between expressions, which always produce values, and may or may not have side effects, and statements, which are executed solely for their side effects, and return no useful value Imperative programming is sometimes called computing via side effects N. Meng, S. Arthur 24 4

5 Side Effects Pure functional languages have no side effects The value of an expression depends only on the referencing environment in which the expression is evaluated, not the time at which the evaluation occurs If an expression yields a certain value at one point in time, it is guaranteed to yield the same value at any point in time How to avoid side effects? Design the language to disallow functional side effects No pass-by-reference parameters in functions Disallow global variable access in functions Concerns Programmers need the flexibility to return more than one value from a function Passing parameters is inefficient compared with accessing global variables N. Meng, S. Arthur 25 N. Meng, S. Arthur 26 How to avoid side effects? Design the language with a strictly fixed evaluation order between operands Concerns Disallow some optimizations which involve reordering operand evaluations Referential Transparency and Side Effects A program has the property of referential transparency if any two expressions having the same value can be substituted for one another E.g., result1 = (fun(a) + b) / (fun(a) c); ó temp = fun(a); result2 = (temp + b) / (temp - c), given that the function fun has no side effect N. Meng, S. Arthur 27 N. Meng, S. Arthur 28 Key points of referentially transparent programs Semantics is much easier to understand Being referentially transparent makes a function equivalent to a mathematical function Programs written in pure functional languages are referentially transparent The value of a referentially transparent function depends on its parameters, and possibly one or more global constants N. Meng, S. Arthur 29 Overloaded Operators The multiple use of an operator is called operator overloading E.g., + is used to specify integer addition, floating-point addition, and string catenation Do not use the same symbol for two completely unrelated operations, because that can decrease readability In C, & can represent a bitwise AND operator, and an address-of operator N. Meng, S. Arthur 30 5

6 Type Conversion Narrowing conversion To convert a value to a type that cannot store all values of the original type E.g., double->float, float->int Widening conversion To convert a value to a type that can include all values belong to the original type E.g., int->float, float->double N. Meng, S. Arthur 31 Narrowing Conversion vs. Widening Conversion Narrowing conversion are not always safe The magnitude of the converted value can be changed E.g., float->int with 1.3E25, the converted value is distantly related to the original one Widening conversion is always safe However, some precision may be lost E.g., int->float, integers have at least 9 decimal digits of precision, while floats have 7 decimal digits of precision 32 Implicit Type Conversion A coercion is an implicit type conversion Arithmetic expressions with operators that can have differently typed operands are called mixed-mode expressions Languages allowing such expressions must define implicit operand type conversions Implicit Type Conversion var x, y: integer; z: real;... y := x * z; /* x is automancally converted to real */ Implicit type conversion can be achieved by narrowing or widening one or more operators It is better to widen when possible E.g., x = 3, z = 5.9, what is y s value if x is widened? How about z narrowed? N. Meng, S. Arthur 33 N. Meng, S. Arthur 34 Key Points of Implicit Coercions They decrease the type error detection ability of compilers Did you really mean to use mixed-mode expressions? In most languages, all numeric types are coerced in expressions, using widening conversions Explicit Type Conversion Also called casts Ada example FLOAT(INDEX)-- INDEX is an INTEGER C example: (int) speed /* speed is a float */ N. Meng, S. Arthur 35 N. Meng, S. Arthur 36 6

7 Short-Circuit Evaluation A short-circuit evaluation of an expression is one in which the result is determined without evaluating all of the operands and/or operators Consider (a < b) && (b < c): If a >= b, there is no point evaluating b < c because (a < b) && (b < c) is automatically false (x && y) if x then y else false (x y) if x then true else y Short-Circuit Evaluation Short-circuit evaluation may lead to unexpected side effects and cause error E.g., (a > b) ((b++) / 3) C, C++, and Java: Use short-circuit evaluation for Boolean operations (&& and ) Also provide bitwise operators that are not short circuit (& and ) N. Meng, S. Arthur 37 N. Meng, S. Arthur 38 Short-Circuit Evaluation Ada: programmers can specify either Non-SC eval SC eval (x or y) ( x or else y ) (x and y) ( x and then y ) Control Structures Selection Iteration Iterators Recursion Concurrency & non-determinism Guarded commands N. Meng, S. Arthur 39 N. Meng, S. Arthur 40 Iteration Based on Data Structures A data-based iteration statement uses a user-defined data structure and a userdefined function to go through the structure s elements The function is called an iterator The iterator is invoked at the beginning of each iteration Each time it is invoked, an element from the data structure is returned Elements are returned in a particular order A Java Implementation for Iterator N. Meng, S. Arthur

8 Guarded Commands New and quite different forms of selection and loop structures were suggested by Dijkstra (1975) We cover guarded commands because they are the basis for two linguistic mechanisms developed later for concurrent programming in two languages: CSP and Ada Motivations of Guarded Commands To support a program design methodology that ensures correctness during development rather than relying on verification or testing of completed programs afterwards Also useful for concurrency Increased clarity in reasoning N. Meng, S. Arthur 43 N. Meng, S. Arthur 44 Guarded Commands Two guarded forms Selection (guarded if) Iteration (guarded do) N. Meng, S. Arthur 45 Guarded Selection if <boolean> -> <statement> [] <boolean> -> <statement>... [] <boolean> -> <statement> fi Sementics When this construct is reached Evaluate all boolean expressions If more than one is true, choose one nondeterministically If none is true, it is a runtime error Idea: Forces one to consider all possibilities N. Meng, S. Arthur 46 An Example if i = 0 -> sum := sum + i [] i > j -> sum := sum + j [] j > i -> sum := sum + i fi If i = 0 and j > i, the construct chooses nondeterministically between the first and the third assignment statements If i == j and i 0, none of the conditions is true and a runtime error occurs N. Meng, S. Arthur 47 Guarded Selection The construction can be an elegant way to state that the order of execution, in some cases, is irrelevant if x >= y -> max := x [] y >= x -> max := y fi E.g., if x == y, it does not matter which we assign to max This is a form of abstraction provided by the nondeterministic semantics N. Meng, S. Arthur 48 8

9 Guarded Iteration Semantics: For each iteration do <boolean> -> <statement> [] <boolean> -> <statement>... [] <boolean> -> <statement> od Evaluate all boolean expressions If more than one is true, choose one nondeterministically, and then start loop again If none is true, exit the loop Idea: if the order of evaluation is not important, the program should not specify one N. Meng, S. Arthur 49 An Example do q1 > q2 -> temp := q1; q1 := q2; q2 := temp; [] q2 > q3 -> temp := q2; q2 := q3; q3 := temp; [] q3 > q4 -> temp := q3; q3 := q4; q4 := temp; od Given four integer variables: q1, q2, q3, and q4, rearrange the values so that q1 q2 q3 q4 Without guarded iteration, one solution is to put the values into an array, sort the array, and then assigns the value back to the four variables N. Meng, S. Arthur 50 An Example While the solution with guarded iteration is not difficult, it requires a good deal of code There is considerably increased complexity in the implementation of the guarded commands over their conventional deterministic counterparts N. Meng, S. Arthur 51 9

### Software II: Principles of Programming Languages. Why Expressions?

Software II: Principles of Programming Languages Lecture 7 Expressions and Assignment Statements Why Expressions? Expressions are the fundamental means of specifying computations in a programming language

### Chapter 7. Expressions and Assignment Statements

Chapter 7 Expressions and Assignment Statements Chapter 7 Topics Introduction Arithmetic Expressions Overloaded Operators Type Conversions Relational and Boolean Expressions Short-Circuit Evaluation Assignment

### Chapter 7. Expressions and Assignment Statements (updated edition 11) ISBN

Chapter 7 Expressions and Assignment Statements (updated edition 11) ISBN 0-321-49362-1 Chapter 7 Topics Introduction Arithmetic Expressions Overloaded Operators Type Conversions Relational and Boolean

### Programming Languages Third Edition. Chapter 9 Control I Expressions and Statements

Programming Languages Third Edition Chapter 9 Control I Expressions and Statements Objectives Understand expressions Understand conditional statements and guards Understand loops and variation on WHILE

### Chapter7 Expression and Assignment Statement. Introduction

Chapter7 Expression and Assignment Statement Arithmetic Expressions Overloaded Operators Boolean Expressions Short-Circuit Evaluation Assignment Statements Mixed-Mode Assignment Introduction Fundamental

### Chapter 8. Statement-Level Control Structures ISBN

Chapter 8 Statement-Level Control Structures ISBN 0-321-49362-1 Chapter 8 Topics Introduction Selection Statements Iterative Statements Unconditional Branching Guarded Commands Conclusions Copyright 2012

### Chapter 8. Statement-Level Control Structures

Chapter 8 Statement-Level Control Structures Chapter 8 Topics Introduction Selection Statements Iterative Statements Unconditional Branching Guarded Commands Conclusions 1-2 Levels of Control Flow Within

Lecture Set 4: More About Methods and More About Operators Methods Definitions Invocations More arithmetic operators Operator Side effects Operator Precedence Short-circuiting main method public static

Lecture Set 4: More About Methods and More About Operators Methods Definitions Invocations More arithmetic operators Operator Side effects Operator Precedence Short-circuiting main method public static

### Java Primer 1: Types, Classes and Operators

Java Primer 1 3/18/14 Presentation for use with the textbook Data Structures and Algorithms in Java, 6th edition, by M. T. Goodrich, R. Tamassia, and M. H. Goldwasser, Wiley, 2014 Java Primer 1: Types,

### Lecture 1. Types, Expressions, & Variables

Lecture 1 Types, Expressions, & Variables About Your Instructor Director: GDIAC Game Design Initiative at Cornell Teach game design (and CS 1110 in fall) 8/29/13 Overview, Types & Expressions 2 Helping

### Operators and Expressions in C & C++ Mahesh Jangid Assistant Professor Manipal University, Jaipur

Operators and Expressions in C & C++ Mahesh Jangid Assistant Professor Manipal University, Jaipur Operators and Expressions 8/24/2012 Dept of CS&E 2 Arithmetic operators Relational operators Logical operators

### Lecture 2: Variables & Assignments

http://www.cs.cornell.edu/courses/cs1110/2018sp Lecture 2: Variables & Assignments (Sections 2.1-2.3,2.5) CS 1110 Introduction to Computing Using Python [E. Andersen, A. Bracy, D. Gries, L. Lee, S. Marschner,

### Programming Languages Third Edition. Chapter 7 Basic Semantics

Programming Languages Third Edition Chapter 7 Basic Semantics Objectives Understand attributes, binding, and semantic functions Understand declarations, blocks, and scope Learn how to construct a symbol

### HANDLING NONLOCAL REFERENCES

SYMBOL TABLE A symbol table is a data structure kept by a translator that allows it to keep track of each declared name and its binding. Assume for now that each name is unique within its local scope.

### Control Structures. Outline. In Text: Chapter 8. Control structures Selection. Iteration. Gotos Guarded statements. One-way Two-way Multi-way

Control Structures In Text: Chapter 8 1 Control structures Selection One-way Two-way Multi-way Iteration Counter-controlled Logically-controlled Gotos Guarded statements Outline Chapter 8: Control Structures

### More Programming Constructs -- Introduction

More Programming Constructs -- Introduction We can now examine some additional programming concepts and constructs Chapter 5 focuses on: internal data representation conversions between one data type and

### Unit-II Programming and Problem Solving (BE1/4 CSE-2)

Unit-II Programming and Problem Solving (BE1/4 CSE-2) Problem Solving: Algorithm: It is a part of the plan for the computer program. An algorithm is an effective procedure for solving a problem in a finite

CS313D: ADVANCED PROGRAMMING LANGUAGE Computer Science department Lecture 2 : C# Language Basics Lecture Contents 2 The C# language First program Variables and constants Input/output Expressions and casting

### Java: framework overview and in-the-small features

Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer Java: framework overview and in-the-small features Chair of Software Engineering Carlo A. Furia, Marco Piccioni, Bertrand Meyer

### Arithmetic Operators. Portability: Printing Numbers

Arithmetic Operators Normal binary arithmetic operators: + - * / Modulus or remainder operator: % x%y is the remainder when x is divided by y well defined only when x > 0 and y > 0 Unary operators: - +

### ! Non-determinacy (unspecified order) Maria Hybinette, UGA 2. 1 Landin adding sugar to a language to make it easier to read (for humans)

Maria Hybinette, UGA Big Picture: Control Flow Ordering in Program Execution CSCI: 4500/6500 Programming Languages Control Flow Chapter 6 1 Ordering/Flow Mechanisms:! Sequencing (statements executed (evaluated)

### Concepts Introduced in Chapter 6

Concepts Introduced in Chapter 6 types of intermediate code representations translation of declarations arithmetic expressions boolean expressions flow-of-control statements backpatching EECS 665 Compiler

### Programming in C++ 6. Floating point data types

Programming in C++ 6. Floating point data types! Introduction! Type double! Type float! Changing types! Type promotion & conversion! Casts! Initialization! Assignment operators! Summary 1 Introduction

### Ruby: Introduction, Basics

Ruby: Introduction, Basics Computer Science and Engineering College of Engineering The Ohio State University Lecture 4 Ruby vs Java: Similarities Imperative and object-oriented Classes and instances (ie

### Introduction to Visual Basic and Visual C++ Arithmetic Expression. Arithmetic Expression. Using Arithmetic Expression. Lesson 4.

Introduction to Visual Basic and Visual C++ Arithmetic Expression Lesson 4 Calculation I154-1-A A @ Peter Lo 2010 1 I154-1-A A @ Peter Lo 2010 2 Arithmetic Expression Using Arithmetic Expression Calculations

### Program Fundamentals

Program Fundamentals /* HelloWorld.java * The classic Hello, world! program */ class HelloWorld { public static void main (String[ ] args) { System.out.println( Hello, world! ); } } /* HelloWorld.java

### Introduction Primitive Data Types Character String Types User-Defined Ordinal Types Array Types. Record Types. Pointer and Reference Types

Chapter 6 Topics WEEK E FOUR Data Types Introduction Primitive Data Types Character String Types User-Defined Ordinal Types Array Types Associative Arrays Record Types Union Types Pointer and Reference

### Type Bindings. Static Type Binding

Type Bindings Two key issues in binding (or associating) a type to an identifier: How is type binding specified? When does the type binding take place? N. Meng, S. Arthur 1 Static Type Binding An explicit

### Chapter 3 Structure of a C Program

Chapter 3 Structure of a C Program Objectives To be able to list and describe the six expression categories To understand the rules of precedence and associativity in evaluating expressions To understand

### Variables and literals

Demo lecture slides Although I will not usually give slides for demo lectures, the first two demo lectures involve practice with things which you should really know from G51PRG Since I covered much of

### Linear Data Structure

Linear Data Structure Definition A data structure is said to be linear if its elements form a sequence or a linear list. Examples: Array Linked List Stacks Queues Operations on linear Data Structures Traversal

### Operators & Expressions

Operators & Expressions Operator An operator is a symbol used to indicate a specific operation on variables in a program. Example : symbol + is an add operator that adds two data items called operands.

### Data types for mcrl2

Data types for mcrl2 Aad Mathijssen April 5, 2018 We provide a syntax for the standard data types of the mcrl2 language. This syntax is intended to be a practical mix between standard mathematical notation

### Objects and Types. COMS W1007 Introduction to Computer Science. Christopher Conway 29 May 2003

Objects and Types COMS W1007 Introduction to Computer Science Christopher Conway 29 May 2003 Java Programs A Java program contains at least one class definition. public class Hello { public static void

### Chapter 2 Elementary Programming

Chapter 2 Elementary Programming Part I 1 Motivations In the preceding chapter, you learned how to create, compile, and run a Java program. Starting from this chapter, you will learn how to solve practical

### Operators. Lecture 3 COP 3014 Spring January 16, 2018

Operators Lecture 3 COP 3014 Spring 2018 January 16, 2018 Operators Special built-in symbols that have functionality, and work on operands operand an input to an operator Arity - how many operands an operator

### Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups:

Basic Operators Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators

### CMSC 4023 Chapter 9. Fundamentals of Subprograms Introduction

9. 9.1. Introduction Two fundamental abstraction facilities Process abstraction Emphasized from early days Data abstraction Emphasized in the1980s 9.2. 9.2.1. General Subprogram Characteristics Each subprogram

### 7.1 Optional Parameters

Chapter 7: C++ Bells and Whistles A number of C++ features are introduced in this chapter: default parameters, const class members, and operator extensions. 7.1 Optional Parameters Purpose and Rules. Default

### Chapter 5 Names, Binding, Type Checking and Scopes

Chapter 5 Names, Binding, Type Checking and Scopes Names - We discuss all user-defined names here - Design issues for names: -Maximum length? - Are connector characters allowed? - Are names case sensitive?

### Ruby: Introduction, Basics

Ruby: Introduction, Basics Computer Science and Engineering College of Engineering The Ohio State University Lecture 4 Ruby vs Java: Similarities Imperative and object-oriented Classes and instances (ie

### Concepts Introduced in Chapter 6

Concepts Introduced in Chapter 6 types of intermediate code representations translation of declarations arithmetic expressions boolean expressions flow-of-control statements backpatching EECS 665 Compiler

### Principles of Programming Languages. Lecture Outline

Principles of Programming Languages CS 492 Lecture 1 Based on Notes by William Albritton 1 Lecture Outline Reasons for studying concepts of programming languages Programming domains Language evaluation

### Chapter 9. Subprograms

Chapter 9 Subprograms Chapter 9 Topics Introduction Fundamentals of Subprograms Design Issues for Subprograms Local Referencing Environments Parameter-Passing Methods Parameters That Are Subprograms Calling

### cs1114 REVIEW of details test closed laptop period

python details DOES NOT COVER FUNCTIONS!!! This is a sample of some of the things that you are responsible for do not believe that if you know only the things on this test that they will get an A on any

### Unit-2 (Operators) ANAND KR.SRIVASTAVA

Unit-2 (Operators) ANAND KR.SRIVASTAVA 1 Operators in C ( use of operators in C ) Operators are the symbol, to perform some operation ( calculation, manipulation). Set of Operations are used in completion

### 3. EXPRESSIONS. It is a sequence of operands and operators that reduce to a single value.

3. EXPRESSIONS It is a sequence of operands and operators that reduce to a single value. Operator : It is a symbolic token that represents an action to be taken. Ex: * is an multiplication operator. Operand:

### Conversion vs. Subtyping. Lecture #23: Conversion and Type Inference. Integer Conversions. Conversions: Implicit vs. Explicit. Object x = "Hello";

Lecture #23: Conversion and Type Inference Administrivia. Due date for Project #2 moved to midnight tonight. Midterm mean 20, median 21 (my expectation: 17.5). In Java, this is legal: Object x = "Hello";

### ESc101 : Fundamental of Computing

ESc101 : Fundamental of Computing I Semester 2008-09 Lecture 9+10 Types Range of numeric types and literals (constants) in JAVA Expressions with values of mixed types 1 I : Range of numeric types and literals

Sir Muhammad Naveed Arslan Ahmed Shaad (1163135 ) Muhammad Bilal ( 1163122 ) www.techo786.wordpress.com CHAPTER: 2 NOTES:- VARIABLES AND OPERATORS The given Questions can also be attempted as Long Questions.

### Computer Components. Software{ User Programs. Operating System. Hardware

Computer Components Software{ User Programs Operating System Hardware What are Programs? Programs provide instructions for computers Similar to giving directions to a person who is trying to get from point

### Operators And Expressions

Operators And Expressions Operators Arithmetic Operators Relational and Logical Operators Special Operators Arithmetic Operators Operator Action Subtraction, also unary minus + Addition * Multiplication

### Funk Programming Language Reference Manual

Funk Programming Language Reference Manual Naser AlDuaij, Senyao Du, Noura Farra, Yuan Kang, Andrea Lottarini {nya2102, sd2693, naf2116, yjk2106, al3125} @columbia.edu 26 October, 2012 1 Introduction This

### Fundamentals of Programming

Fundamentals of Programming Lecture 3 - Constants, Variables, Data Types, And Operations Lecturer : Ebrahim Jahandar Borrowed from lecturer notes by Omid Jafarinezhad Outline C Program Data types Variables

### Control Flow. CSE 307 Principles of Programming Languages Stony Brook University

Control Flow CSE 307 Principles of Programming Languages Stony Brook University http://www.cs.stonybrook.edu/~cse307 1 Specifying the Semantics of Programs Operational Semantics: Give how a program would

### Chapter 2: Data and Expressions

Chapter 2: Data and Expressions CS 121 Department of Computer Science College of Engineering Boise State University January 15, 2015 Chapter 2: Data and Expressions CS 121 1 / 1 Chapter 2 Part 1: Data

### CSC 1214: Object-Oriented Programming

CSC 1214: Object-Oriented Programming J. Kizito Makerere University e-mail: jkizito@cis.mak.ac.ug www: http://serval.ug/~jona materials: http://serval.ug/~jona/materials/csc1214 e-learning environment:

### Operators. Java Primer Operators-1 Scott MacKenzie = 2. (b) (a)

Operators Representing and storing primitive data types is, of course, essential for any computer language. But, so, too, is the ability to perform operations on data. Java supports a comprehensive set

### MIDTERM EXAMINATION Spring 2010 CS301- Data Structures

MIDTERM EXAMINATION Spring 2010 CS301- Data Structures Question No: 1 Which one of the following statement is NOT correct. In linked list the elements are necessarily to be contiguous In linked list the

### Selection Statements. Pseudocode

Selection Statements Pseudocode Natural language mixed with programming code Ex: if the radius is negative the program display a message indicating wrong input; the program compute the area and display

### Organization of Programming Languages CS3200/5200N. Lecture 11

Organization of Programming Languages CS3200/5200N Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu Functional vs. Imperative The design of the imperative languages

### CSCE 314 Programming Languages

CSCE 314 Programming Languages Haskell 101 Dr. Hyunyoung Lee 1 Contents 1. Historical Background of Haskell 2. Lazy, Pure, and Functional Language 3. Using ghc and ghci 4. Functions 5. Haskell Scripts

### MIDTERM EXAM (Solutions)

MIDTERM EXAM (Solutions) Total Score: 100, Max. Score: 83, Min. Score: 26, Avg. Score: 57.3 1. (10 pts.) List all major categories of programming languages, outline their definitive characteristics and

### Type Conversion. and. Statements

and Statements Type conversion changing a value from one type to another Void Integral Floating Point Derived Boolean Character Integer Real Imaginary Complex no fractional part fractional part 2 tj Suppose

### Objectives. Chapter 2: Basic Elements of C++ Introduction. Objectives (cont d.) A C++ Program (cont d.) A C++ Program

Objectives Chapter 2: Basic Elements of C++ In this chapter, you will: Become familiar with functions, special symbols, and identifiers in C++ Explore simple data types Discover how a program evaluates

### And Parallelism. Parallelism in Prolog. OR Parallelism

Parallelism in Prolog And Parallelism One reason that Prolog is of interest to computer scientists is that its search mechanism lends itself to parallel evaluation. In fact, it supports two different kinds

### Organization of Programming Languages CS 3200/5200N. Lecture 09

Organization of Programming Languages CS 3200/5200N Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu Control Flow Control flow = the flow of control, or execution

### Chapter 2: Data and Expressions

Chapter 2: Data and Expressions CS 121 Department of Computer Science College of Engineering Boise State University April 21, 2015 Chapter 2: Data and Expressions CS 121 1 / 53 Chapter 2 Part 1: Data Types

### L-System Fractal Generator: Language Reference Manual

L-System Fractal Generator: Language Reference Manual Michael Eng, Jervis Muindi, Timothy Sun Contents 1 Program Definition 3 2 Lexical Conventions 3 2.1 Comments...............................................

### SMURF Language Reference Manual Serial MUsic Represented as Functions

SMURF Language Reference Manual Serial MUsic Represented as Functions Richard Townsend, Lianne Lairmore, Lindsay Neubauer, Van Bui, Kuangya Zhai {rt2515, lel2143, lan2135, vb2363, kz2219}@columbia.edu

### Data Types. Data Types. Integer Types. Signed Integers

Data Types Data Types Dr. TGI Fernando 1 2 The fundamental building blocks of any programming language. What is a data type? A data type is a set of values and a set of operations define on these values.

### CSC312 Principles of Programming Languages : Functional Programming Language. Copyright 2006 The McGraw-Hill Companies, Inc.

CSC312 Principles of Programming Languages : Functional Programming Language Overview of Functional Languages They emerged in the 1960 s with Lisp Functional programming mirrors mathematical functions:

Stacks Chapter 5 Copyright 2012 by Pearson Education, Inc. All rights reserved Contents Specifications of the ADT Stack Using a Stack to Process Algebraic Expressions A Problem Solved: Checking for Balanced

### Comparing Data. Comparing Floating Point Values. Comparing Float Values. CS257 Computer Science I Kevin Sahr, PhD

1 CS257 Computer Science I Kevin Sahr, PhD Lecture 6: Comparing Data and Complex Boolean Expressions Comparing Data 2 When comparing data it's important to understand the nuances of certain data types

### CS 430 Spring Mike Lam, Professor. Data Types and Type Checking

CS 430 Spring 2015 Mike Lam, Professor Data Types and Type Checking Type Systems Type system Rules about valid types, type compatibility, and how data values can be used Benefits of a robust type system

### In Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability. programs into their various phases.

Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled Repetition In Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability.

### Stacks. stacks of dishes or trays in a cafeteria. Last In First Out discipline (LIFO)

Outline stacks stack ADT method signatures array stack implementation linked stack implementation stack applications infix, prefix, and postfix expressions 1 Stacks stacks of dishes or trays in a cafeteria

### C OVERVIEW BASIC C PROGRAM STRUCTURE. C Overview. Basic C Program Structure

C Overview Basic C Program Structure C OVERVIEW BASIC C PROGRAM STRUCTURE Goals The function main( )is found in every C program and is where every C program begins speed execution portability C uses braces

### Scheme: Data. CS F331 Programming Languages CSCE A331 Programming Language Concepts Lecture Slides Monday, April 3, Glenn G.

Scheme: Data CS F331 Programming Languages CSCE A331 Programming Language Concepts Lecture Slides Monday, April 3, 2017 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks ggchappell@alaska.edu

### A Short Summary of Javali

A Short Summary of Javali October 15, 2015 1 Introduction Javali is a simple language based on ideas found in languages like C++ or Java. Its purpose is to serve as the source language for a simple compiler

### VENTURE. Section 1. Lexical Elements. 1.1 Identifiers. 1.2 Keywords. 1.3 Literals

VENTURE COMS 4115 - Language Reference Manual Zach Adler (zpa2001), Ben Carlin (bc2620), Naina Sahrawat (ns3001), James Sands (js4597) Section 1. Lexical Elements 1.1 Identifiers An identifier in VENTURE

### An Introduction to Trees

An Introduction to Trees Alice E. Fischer Spring 2017 Alice E. Fischer An Introduction to Trees... 1/34 Spring 2017 1 / 34 Outline 1 Trees the Abstraction Definitions 2 Expression Trees 3 Binary Search

### CSc 10200! Introduction to Computing. Lecture 2-3 Edgardo Molina Fall 2013 City College of New York

CSc 10200! Introduction to Computing Lecture 2-3 Edgardo Molina Fall 2013 City College of New York 1 C++ for Engineers and Scientists Third Edition Chapter 2 Problem Solving Using C++ 2 Objectives In this

### Sprite an animation manipulation language Language Reference Manual

Sprite an animation manipulation language Language Reference Manual Team Leader Dave Smith Team Members Dan Benamy John Morales Monica Ranadive Table of Contents A. Introduction...3 B. Lexical Conventions...3

### STUDENT OUTLINE. Lesson 8: Structured Programming, Control Structures, if-else Statements, Pseudocode

STUDENT OUTLINE Lesson 8: Structured Programming, Control Structures, if- Statements, Pseudocode INTRODUCTION: This lesson is the first of four covering the standard control structures of a high-level

### Semantic Analysis. CSE 307 Principles of Programming Languages Stony Brook University

Semantic Analysis CSE 307 Principles of Programming Languages Stony Brook University http://www.cs.stonybrook.edu/~cse307 1 Role of Semantic Analysis Syntax vs. Semantics: syntax concerns the form of a

### Chapter 3. Selections

Chapter 3 Selections 1 Outline 1. Flow of Control 2. Conditional Statements 3. The if Statement 4. The if-else Statement 5. The Conditional operator 6. The Switch Statement 7. Useful Hints 2 1. Flow of

### 22c:111 Programming Language Concepts. Fall Types I

22c:111 Programming Language Concepts Fall 2008 Types I Copyright 2007-08, The McGraw-Hill Company and Cesare Tinelli. These notes were originally developed by Allen Tucker, Robert Noonan and modified

### Fifth Generation CS 4100 LISP. What do we need? Example LISP Program 11/13/13. Chapter 9: List Processing: LISP. Central Idea: Function Application

Fifth Generation CS 4100 LISP From Principles of Programming Languages: Design, Evaluation, and Implementation (Third Edition, by Bruce J. MacLennan, Chapters 9, 10, 11, and based on slides by Istvan Jonyer

### CSE 504. Expression evaluation. Expression Evaluation, Runtime Environments. One possible semantics: Problem:

Expression evaluation CSE 504 Order of evaluation For the abstract syntax tree + + 5 Expression Evaluation, Runtime Environments + + x 3 2 4 the equivalent expression is (x + 3) + (2 + 4) + 5 1 2 (. Contd

### Module 2 Introducing Data Types and Operators

Module 2 Introducing Data Types and Operators Table of Contents CRITICAL SKILL 2.1: The C++ Data Types... 2 Project 2-1 Talking to Mars... 10 CRITICAL SKILL 2.2: Literals... 12 CRITICAL SKILL 2.3: A Closer

### C expressions. (Reek, Ch. 5) 1 CS 3090: Safety Critical Programming in C

C expressions (Reek, Ch. 5) 1 Shift operations Left shift: value > n Two definitions: logical version: discard the n

### Principles of Programming Languages

Principles of Programming Languages www.cs.bgu.ac.il/~ppl172 Collaboration and Management Dana Fisman Lesson 2 - Types with TypeScript 1 Types What are types in programming languages? What types are you

### An Introduction to Scheme

An Introduction to Scheme Stéphane Ducasse stephane.ducasse@inria.fr http://stephane.ducasse.free.fr/ Stéphane Ducasse 1 Scheme Minimal Statically scoped Functional Imperative Stack manipulation Specification

### Introduction to Functional Programming in Haskell 1 / 56

Introduction to Functional Programming in Haskell 1 / 56 Outline Why learn functional programming? The essence of functional programming What is a function? Equational reasoning First-order vs. higher-order

### OBJECT ORIENTED PROGRAMMING USING C++ CSCI Object Oriented Analysis and Design By Manali Torpe

OBJECT ORIENTED PROGRAMMING USING C++ CSCI 5448- Object Oriented Analysis and Design By Manali Torpe Fundamentals of OOP Class Object Encapsulation Abstraction Inheritance Polymorphism Reusability C++