ISBN 0-321-19362-8 Lecture 07 Expressions and Assignment Statements.

ISBN 0-321-19362-8

Lecture 07

Expressions and Assignment Statements

Lecture 07 Topics

• Introduction• Arithmetic Expressions

– Overloaded Operators– Type Conversions

• Relational and Boolean Expressions• Short-Circuit Evaluation• Assignment Statements• Mixed-Mode Assignment

Introduction

• Expressions are the fundamental means of specifying computations in a programming language

• Expressions consist of constants, variables, parentheses, function calls, and operators

• The semantics of an expression is determined in part by the orders of operator and operand evaluation

• Essence of imperative languages is dominant role of assignment statements

Arithmetic Expressions

• Arithmetic expressions consist of operators, operands, parentheses, and function calls

• A unary operator has one operand• A binary operator has two operands• A ternary operator has three

operands

• Design issues for arithmetic expressions:1. What are the operator precedence rules?2. What are the operator associativity rules?3. What is the order of operand evaluation?4. Are there restrictions on operand evaluation

side effects?5. Does the language allow user-defined

operator overloading?6. What mode mixing is allowed in expressions?

• Operator evaluation Order– Precedence– Associativity

• The operator precedence rules for expression evaluation define the order in which “adjacent” operators of different precedence levels are evaluated (“adjacent” means they are separated by at most one operand)

• Typical precedence levels1. parentheses2. unary operators3. ** (if the language supports it)4. *, /5. +, -

• The operator associativity rules for expression evaluation define the order in which adjacent operators with the same precedence level are evaluated

• Typical associativity rules:– Left to right, except **, which is right to left– Sometimes unary operators associate right to

left (e.g., FORTRAN)

• APL is different; all operators have equal precedence and all operators associate right to left

• Precedence and associativity rules can be overridden with parentheses

• Operand evaluation order– Side effects problem

• Operand evaluation:1. Variables: just fetch the value2. Constants: sometimes a fetch from memory;

sometimes the constant is in the machine language instruction

3. Parenthesized expressions: evaluate all operands and operators first

4. Function references:• Order of operand evaluation is crucial if side-

effects happen

• Functional side effects – when a function changes a two-way

parameter or a nonlocal variable

• The problem: – When a function referenced in an

expression alters another operand of the expression; e.g., for a parameter change:

a = 10;

b = a + fun(&a);

• Same problem with global variables

Arithmetic Expressions - Functional Side Effects

• First Possible Solution to the Problem– Write the language definition to disallow

functional side effects• No two-way parameters in functions• No nonlocal references in functions

– Advantage: it works!– Disadvantage: Programmers want the

flexibility of two-way parameters (what about C?) and nonlocal references

Arithmetic Expressions - Functional Side Effects

• Second Possible Solution to the Problem– Write the language definition to demand

that operand evaluation order be fixed– Disadvantage: limits some compiler

optimizations

Arithmetic Expressions - Overloaded Operators

• Use of an operator for more than one purpose is called operator overloading

• Some are common (e.g., + for int and float)• Some are potential trouble (e.g., * in C and

C++)– Loss of compiler error detection (omission of an

operand may not be detected if an operator is overloaded for both unary and binary operations)

– Some loss of readability– Can be avoided by introduction of new symbols

(e.g., Pascal’s div for integer division and / for float division)

Arithmetic Expressions - Overloaded Operators

• C++ and Ada allow user-defined overloaded operators

• Potential problems: – Users can define nonsense operations

for some well-understood operators– Readability may suffer, even when the

operators make sense

Arithmetic Expressions - Type Conversions

• A narrowing conversion is one that converts an object to a type that cannot include all of the values of the original type e.g., float to int

• A widening conversion is one in which an object is converted to a type that can include at least approximations to all of the values of the original type e.g., int to float

• A mixed-mode expression is one that has operands of different types

• Coercion: implicit type conversion• The disadvantage of coercions:

– They decrease in the type error detection ability of the compiler, e.g., typos of variables with different types may not be detected

• In most languages, all numeric types are coerced in expressions, using widening conversions

• In Ada, there are virtually no coercions in expressions

• Cast: explicit type conversionAda:

FLOAT(INDEX)--INDEX is INTEGER type

Java: (int)speed /*speed is float type*/

• Some errors in expressions– overflow/ underflow

• Caused by:– Inherent limitations of arithmetic

e.g. division by zero– Limitations of computer arithmetic

e.g. overflow

• Such errors are often ignored by the run-time system

Relational and Boolean Expressions• Relational Expressions

– Use relational operators and operands of various types

– Evaluate to some Boolean representation

– Operator symbols used vary somewhat among languages (!=, /=, .NE., <>, #)

Relational and Boolean Expressions• Boolean (Logical) Expressions

– Operands are Boolean and the result is Boolean

– Operators:FORTRAN77 FORTRAN90 C Ada

.AND. and && and .OR. or || or .NOT. not ! not xor

Relational and Boolean Expressions

• C has no Boolean type--it uses int type with 0 for false and nonzero for true

• One odd characteristic of C’s expressions: a < b < c is a legal expression, but the result comes from the comparison of c with the result of “a < b”

Relational and Boolean Expressions

• Precedence of some C_based languages operators:Postfix ++, -- (arithmetic)

Unary +, -, prefix ++, --, !(Boolean)

*, /, %

binary +, -

<, >, <=, >= (relational)

==, !=

&& (Boolean)

Short Circuit Evaluation

• Short circuit evaluation:– Evaluation of (13 * a) * (b / 13 -1) is

independent of (b / 13 - 1) if a is 0.– Evaluation of (a >= 0) && (b < 10) is

independent of (b < 10) if a < 0.

• Suppose Java did not use short-circuit evaluation the out-of-bound problem may happen: index = 1;

while ((index <= length) && (LIST[index] != value))

index++;

Short Circuit Evaluation

• C, C++, and Java: use short-circuit evaluation for the usual Boolean operators (&& and ||), but also provide bitwise Boolean operators that are not short circuit (& and |)

• Ada: programmer can specify either (short-circuit is specified with and then and or else)

• FORTRAN 77: short circuit, but any side-affected place must be set to undefined

• Short-circuit evaluation exposes the potential problem of side effects in expressions e.g. (a > b) || (b++ / 3)

Assignment Statements

• The operator symbol:1. = FORTRAN, BASIC, PL/I, C, C++, Java2. := ALGOLs, Pascal, Ada

• = Can be bad if it is overloaded for the relational operator for equality e.g. (PL/I) A = B = C;

• Note difference from C (= vs. ==)

• More complicated assignments:1. Multiple targets (PL/I)A, B = 10

2. Conditional targets (C, C++, and Java)(first==true)? total : subtotal = 0

3. Compound assignment operators (C, C++, and Java)sum += next;

• More complicated assignments (continued):4. Unary assignment operators (C, C++,

and Java)a++;

C, C++, and Java treat = as an arithmetic binary operatore.g. a = b * (c = d * 2 + 1) + 1

This is inherited from ALGOL 68

• Assignment as an Expression– In C, C++, and Java, the assignment

statement produces a result– So, they can be used as operands in

expressionse.g.while ((ch = getchar())!=EOF){…}

– Disadvantage• Another kind of expression side effect

Mixed-Mode Assignment

• In FORTRAN, C, and C++, any numeric value can be assigned to any numeric scalar variable; whatever conversion is necessary is done

• In Pascal, integers can be assigned to reals, but reals cannot be assigned to integers (the programmer must specify whether the conversion from real to integer is truncated or rounded)

• In Java, only widening assignment coercions are done

• In Ada, there is no assignment coercion

ISBN 0-321-19362-8 Lecture 07 Expressions and Assignment Statements.

Documents

Transcript of ISBN 0-321-19362-8 Lecture 07 Expressions and Assignment Statements.

2 expressions and linear expressions

SPRING SUMMER - 2020€¦ · high waisted skinny jeans 5683/ 321/407 dark blue 5683 /428 faded blue 5683/321/800 black 5683 /321/401 navy 5 /321 426 water blue 5683 /321 408 yale

ISBN 0-321-19362-8 Chapter 16 Logic Programming Languages.

ISBN 0-321-19362-8 Chapter 6 Data Types Character Strings Pattern Matching.

ISBN 0-321-19362-8 Chapter 10 Implementing Subprograms –Semantics of Calls and Returns –Implementing “Simple” Subprograms –Implementing Subprograms with.

Extension Methods, Lambda Expressions, LINQ Operators, Expressions, Projections, Aggregations Extension Methods, Lambda Expressions, LINQ Operators, Expressions,

ISBN 0-321-19362-8 Chapter 12 Support for Object- Oriented Programming.

ISBN 0-321-19362-8 Chapter 2 Evolution of the Major Programming Languages.

ISBN 0-321-19362-8 Chapter 10 Implementing Subprograms –Nested Subprograms –Blocks –Implementing Dynamic Scoping.

ISBN 0-321-19362-8 Chapters 1 & 2 Preliminaries. Copyright © 2004 Pearson Addison-Wesley. All rights reserved.1-2 Chapter 1 Topics Motivation Programming.

Textiles_2015_Brochure 321

ISBN 0-321-19362-8 Chapter 14 Exception Handling and Event Handling.

ISBN 0-321-19362-8 Chapter 4 Lexical and Syntax Analysis The Parsing Problem Recursive-Descent Parsing.

ISBN 0-321-19362-8 Lecture 04 Lexical and Syntax Analysis.

ISBN 0-321-19362-8 Chapter 6 Structured Data Types Array Types Associative Arrays Record Types Union Types.

Expressions idiomatiques Idiomatique Expressions.

Problem Solving in Organizations - Assetsassets.cambridge.org/97811070/19362/frontmatter/9781107019362... · practical business improvement projects in real organizational settings.

ISBN 0-321-49362-1 Chapter 7 Expressions and Assignment Statements.

ISBN 0-321-19362-8 Chapter 11 Abstract Data Types and Encapsulation Concepts.

EN : …en.canson.com/sites/default/files/detail_mt_en_es_it.pdf · 200 321 054 200 321 064 200 321 074 200 321 084 200 331 414 200 321 094 ... Cadmium yellow deep / Sol / Giallo