DOCSLIB.ORG

Reading Assignment K.N. King Chapter 5 K.N. King Chapter 6 K.N

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Reading Assignment K.N. King Chapter 5 K.N. King Chapter 6 K.N Reading Assignment Preview Arithmetic Expressions Assignment, lValues and rValues K.N. King Chapter 5 Logical Expressions Conditional expressions K.N. King Chapter 6 Operator associativity K.N. King Section 24.1 Operator precedence Type conversions 81 82 Arithmetic Operators Assignment The arithmetic operators are used to compute the values of integer and real (float/double) expressions. lValues and rValues Assignment is the act of computing the value of some expression and making the arithmetic operators in C are that expression the value of some variable. ¡ negation ¢ multiplication An lValue represents an object stored in the memory of the computer. £ addition division ¤ Variables are lValuesa ¡ subtraction % modulus An lValue is used in an assignment to indicate where the value of the For all operators except %, result is of type double if either or both operands expression is to be stored in memory. are of type double; if both operands are of type integer then the result is of type integer. An rValue is another name for an arbitrary expression. The modulus operator only takes integer operands % always returns a rValues can be used anywhere that an expression is allowed. integer result. Division of integers truncates the fractional part. In particular an rValue is required on the right side of an assignment. The modulus operation A % B returns the remainder of A divided by B. aOther kinds of lValues will be discussed later in the term. It is always true that 0 <= A%B ¥ B 83 84 Assignment Operator Combined Operate and Assign a lValue = rValue For (almost) any binary operators lValue binaryOp= rValue is equivalent to: ¦ Assignment is an operator in C. lValue = lValue binaryOp rValue The left operand of this operator must be an lValue (usually a variable). Examples ¦ The right operand of this operator must be an rValue . The rValue can be any arbitrary expression involving constants, variables, operators x+=1; /*x=x+1*/ and function calls. The result of the assignment operator is also an rValue . y*=x+z; /*y=y*(x+z)*/ i%=7 /*i=i%7 */ ¦ Examples: height = 8; Good Style: Don’t use operate and assign if it makes your program difficult volume = height * length * width; to understand. i=j=k=0; /*Equivalent: i=(j=(k=0));*/ abinary operators are arithmetic operators that require two ( left and right) operands, e,g, + 12 = i; /*** WRONG, lValue can’t be a constant ***/ I + j = 0; /*** WRONG, lValue can’t be an expression ** 85 86 Increment and Decrement Operators ++ and -- ¦ The increment ( ++ ) and decrement ( -- ) operators can be used to efficiently add or Logical Expression in C subtract one from a variable The C language contains a number of operators that work on logical values, Both of these unarya operators take an lValue as an operand. i.e. true and false . Logical values are often called Boolean values. They add or subtract one from value of the variable in memory. The result of the operation is a rValue which can be used like any other rValue . The relational operators compare the values of two expressions and produce a logical value. ¦ If the operator occurs before the lValue then the rValue is the value of the variable after it is incremented or decremented. The logical operators can be used to combine logical values to produce a If the operator occurs after the lValue then the rValue is the value of the variable logic valued result. before it is incremented or decremented. Historically false is represented internally by the value zero and true is ¦ k=1;Example: represented by any non-zero value. printf("k is %d\n", ++k); /* prints "k is 2" */ printf("k is %d\n", k); /* prints "k is 2" */ Many programmers use the definitions k=1; #define FALSE ( 0 ) printf("k is %d\n", k--); /* prints "k is 1" */ #define TRUE ( 1 ) printf("k is %d\n", k); /* prints "k is 0" */ typedef int Bool ; aA unary operator has one operand. 87 88 Relational Operators ¦ The relational (comparison) operators in C are Logical Operators == equal != not equal The logical operators in C are used to combine simple logical values into > greater than >= greater than or equal more complicated logical values. The logical operators are < less than <= less than or equal && logical and The operators are typically used as || logical or expressionleft relationalOperator expressionright ! logical not ¦ The relational operators compare the values of expressionleft and expressionright and produce a logic value describing the result of the comparison. The definitions for these operators are ¦ All scalar types can be compared. Only scalar types can be compared. AB! A A || B A && B ¦ WARNING: BE REALLY REALLY CAREFUL false false true false false don’t confuse assignment ( = ) with equality compare ( == ) false true true true false K = 3 is always true AND CHANGES K !!! true false false true false true true false true true 89 90 Logical Operators are CONDITIONAL in C Example: Relational and Logical Operators Assume that ¨ ¨ ¨ . Operator Meaning x 1 © y 4 © z 14 A && BifAistrue then B else false A || BifAistrue then true else B x <= 1 && y == 3 false Note that the right expression ( B ) is only evaluated if it is needed. x <= 1 || y == 3 true Many C programs use the conditional nature of the logical operators. !(x > 1) true ¥ Example: 0 § K&&K ARRAY SIZE && A[ K ] == 0 ! x > 1 false (!!) WARNING: Be VERY careful to not use the bitwise operatorsa when you want the !(x <= 1 || y == 3) false logical operators. Operator Logical Bitwise x >= 1 && y == 3 || z < 14 false Not !˜ And && & Or || | aTo be discussed later, See King Section 20.1 91 92 HOW TO Use Logical Operators Use order of operands to guarantee safe evaluation of the right operand. ¥ 0 § K&&K ARRAY SIZE && A[ K ] == 0 Variables (usually char or int ) can store logical values for later use. int xTooLow ; Use parentheses generously to make logical expressions easy to read. xTooLow = X ¥ 0.75 ; Use formatting to make long logical expressions easier to read (A<3 ||!B ||C!=17) Use && , || and ! to combine logical results. && ( !D || E <= 1.375 || F ) – ! inverts the logical sense of the expression && ( X < Y || Z >= 13.8 ) – && produces true if BOTH operands are true Long logical expressions MAY indicate BAD THINKING make sure each long – || produces true if EITHER operand is true expression is really necessary. Sometimes computing the logical inverse of an expression and using ! is simpler. For efficiency order operands to produce an early result put term most likely to be false first for && put term most likely to be true first for || 93 94 Try to minimize the number of ! operators in a logical expression to make it Conditional Expression easier to understand. ( boolExpn ? expntrue : expn false ) DeMorgan Laws ! A || ! B replace with ! (A &&B) ! A&&! B replace with ! (A|| B) Invert Relations ! (X== Y ) replace with X != Y The value of the boolean expression boolExpn selects one of expntrue or as the value of the entire construct ! (X< Y ) replace with X >= Y expn false Cancellation !!X replace with X Good Style: Always enclose conditional expressions in parentheses for readability and to avoid operator precedence problems Examples: (X> Y?X:Y) /*max(X,Y)*/ (1<= N&&N<= LIMIT ? N : 1 ) /* Bounded N */ 95 96 Comma Operator Sizeof Operator expressionleft , expressionright sizeof ( object ) The comma operator is used to put several expressions in places where normally only a single expression is allowed. The sizeof operator returns the size in bytes of the object. expressionleft is evaluated and its value is discarded. In the most common case object is a type-name , but object can also be a expressionright is then evaluated and then becomes the value of the entire constant, variable or expression. expression (an rValue ). Example: Good Style: Use the comma operator sparingly when you really need a list of intI; expressions. Do not use it to write hard to understand programs. sizeof ( int ) ; sizeof ( I ) ; sizeof ( 23 ) ; sizeof ( I + 32768 ) ; 97 98 Operator Precedence Operator Associativity Operator Precedence determines the order in which operators in an Operator Associativity determines the order in which operators of equal expression are evaluated. An operator with higher precedence will be precedence will be evaluated in an expression. evaluated before an operator of lower precedence. left -> right associativity means the operators will be evaluated from left to Examples: * has higher precedence than + so right as the occur in the expression so A * B + C means ( A * B ) + C and not A * ( B + C ) A * B / C means ( A * B ) / C and not A * ( B / C ) Arithmetic operators have higher precedence than relational operators so A - C + 3 means ( A - C ) + 3 and not A - ( C + 3 ) A+B< C * D means ( A + B ) < ( C * D ) and not A + ( B < C)*D right -> left associativity means the operators will be evaluated from right to The precedence rules in C are mostly intuitive and sensible. left as they occur in the expression, so Use parentheses when in doubt or to force a particular order of evaluation. I = J = K means I = (J= K ) and not ( I = J)= K WARNING: Be careful when mixing operators from different precedence Use parentheses if the default associativity isn’t what you want. classes in an expression. 99 100 Operator Precedencea Type Conversions Operators Associativity C does reasonable automatic type conversions () [] -> . -> left right narrower operand -> wider operand ! ˜ ++ -- + - * & (type) sizeof right -> left when information is not lost */% left -> right +- left -> right Examples: << >> left -> right char -> int <<=>>= left -> right == != left -> right short -> intorlong & left -> right float -> double ˆ left -> right int -> float or double | left -> right && left -> right See King Section 7.5 for full details || left -> right ?: right -> left =+=-=*=/=%=&=ˆ=|=<<=>>= right -> left , left -> right aSee King Appendix B.
Load more

Recommended publications
  • Arithmetic Operators
    Arithmetic Operators Section 2.15 & 3.2 p 60-63, 81-89 9/9/10 CS150 Introduction to Computer Science 1 1 Today • Arithmetic Operators & Expressions o Computation o Precedence o Associativity o Algebra vs C++ o Exponents 9/9/10 CS150 Introduction to Computer Science 1 2 Assigning floats to ints int intVariable; intVariable = 42.7; cout << intVariable; • What do you think is the output? 9/9/10 CS150 Introduction to Computer Science 1 3 Assigning doubles to ints • What is the output here? int intVariable; double doubleVariable = 78.9; intVariable = doubleVariable; cout << intVariable; 9/9/10 CS150 Introduction to Computer Science 1 4 Arithmetic Expressions Arithmetic expressions manipulate numeric data We’ve already seen simple ones The main arithmetic operators are + addition - subtraction * multiplication / division % modulus 9/9/05 CS120 The Information Era 5 +, -, and * Addition, subtraction, and multiplication behave in C++ in the same way that they behave in algebra int num1, num2, num3, num4, sum, mul; num1 = 3; num2 = 5; num3 = 2; num4 = 6; sum = num1 + num2; mul = num3 * num4; 9/9/05 CS120 The Information Era 6 Division • What is the output? o int grade; grade = 100 / 20; cout << grade; o int grade; grade = 100 / 30; cout << grade; 9/9/10 CS150 Introduction to Computer Science 1 7 Division • grade = 100 / 40; o Check operands of / . the data type of grade is not considered, why? o We say the integer is truncated. • grade = 100.0 / 40; o What data type should grade be declared as? 9/9/10 CS150 Introduction to Computer Science 1 8
    [Show full text]
  • 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 Statements Mixed-Mode Assignment Chapter 7 Expressions and Assignment Statements Introduction Expressions are the fundamental means of specifying computations in a programming language. To understand expression evaluation, need to be familiar with the orders of operator and operand evaluation. Essence of imperative languages is dominant role of assignment statements. Arithmetic Expressions Their evaluation was one of the motivations for the development of the first programming languages. Most of the characteristics of arithmetic expressions in programming languages were inherited from conventions that had evolved in math. Arithmetic expressions consist of operators, operands, parentheses, and function calls. The operators can be unary, or binary. C-based languages include a ternary operator, which has three operands (conditional expression). The purpose of an arithmetic expression is to specify an arithmetic computation. An implementation of such a computation must cause two actions: o Fetching the operands from memory o Executing the arithmetic operations on those 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 1. Precedence 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).
    [Show full text]
  • Parsing Arithmetic Expressions Outline
    Parsing Arithmetic Expressions https://courses.missouristate.edu/anthonyclark/333/ Outline Topics and Learning Objectives • Learn about parsing arithmetic expressions • Learn how to handle associativity with a grammar • Learn how to handle precedence with a grammar Assessments • ANTLR grammar for math Parsing Expressions There are a variety of special purpose algorithms to make this task more efficient: • The shunting yard algorithm https://eli.thegreenplace.net/2010/01/02 • Precedence climbing /top-down-operator-precedence-parsing • Pratt parsing For this class we are just going to use recursive descent • Simpler • Same as the rest of our parser Grammar for Expressions Needs to account for operator associativity • Also known as fixity • Determines how you apply operators of the same precedence • Operators can be left-associative or right-associative Needs to account for operator precedence • Precedence is a concept that you know from mathematics • Think PEMDAS • Apply higher precedence operators first Associativity By convention 7 + 3 + 1 is equivalent to (7 + 3) + 1, 7 - 3 - 1 is equivalent to (7 - 3) – 1, and 12 / 3 * 4 is equivalent to (12 / 3) * 4 • If we treated 7 - 3 - 1 as 7 - (3 - 1) the result would be 5 instead of the 3. • Another way to state this convention is associativity Associativity Addition, subtraction, multiplication, and division are left-associative - What does this mean? You have: 1 - 2 - 3 - 3 • operators (+, -, *, /, etc.) and • operands (numbers, ids, etc.) 1 2 • Left-associativity: if an operand has operators
    [Show full text]
  • Operators Precedence and Associativity This Page Lists All C Operators in Order of Their Precedence (Highest to Lowest)
    Operators Precedence and Associativity This page lists all C operators in order of their precedence (highest to lowest). Operators within the same box have equal precedence. Precedence Operator Description Associativity () Parentheses (grouping) left-to-right [] Brackets (array subscript) 1 . Member selection via object name -> Member selection via pointer ++ -- Postfix increment/decrement (see Note 1) ++ -- Prefix increment/decrement right-to-left + - Unary plus/minus ! ~ Logical negation/bitwise complement 2 (type) Cast (change type) * Dereference & Address sizeof Determine size in bytes 3 */% Multiplication/division/modulus left-to-right 4 + - Addition/subtraction left-to-right 5 << >> Bitwise shift left, Bitwise shift right left-to-right 6 < <= Relational less than/less than or equal to left-to-right > >= Relational greater than/greater than or equal to 7 == != Relational is equal to/is not equal to left-to-right 8 & Bitwise AND left-to-right 9 ^ Bitwise exclusive OR left-to-right 10 | Bitwise inclusive OR left-to-right 11 && Logical AND left-to-right 12 || Logical OR left-to-right 13 ?: Ternary conditional right-to-left = Assignment right-to-left += -= Addition/subtraction assignment 14 *= /= Multiplication/division assignment %= &= Modulus/bitwise AND assignment ^= |= Bitwise exclusive/inclusive OR assignment <<= >>= Bitwise shift left/right assignment 15 , Comma (separate expressions) left-to-right Note 1 - Postfix increment/decrement have high precedence, but the actual increment or decrement of the operand is delayed (to be accomplished sometime before the statement completes execution). So in the statement y = x * z++; the current value of z is used to evaluate the expression (i.e., z++ evaluates to z) and z only incremented after all else is done.
    [Show full text]
  • Expressions and Assignment Statements Operator Precedence
    Chapter 6 - Expressions and Operator Precedence Assignment Statements • A unary operator has one operand • Their evaluation was one of the motivations for • A binary operator has two operands the development of the first PLs • A ternary operator has three operands • Arithmetic expressions consist of operators, operands, parentheses, and function calls The operator precedence rules for expression evaluation define the order in which “adjacent” Design issues for arithmetic expressions: operators of different precedence levels are 1. What are the operator precedence rules? evaluated 2. What are the operator associativity rules? – “adjacent” means they are separated by at 3. What is the order of operand evaluation? most one operand 4. Are there restrictions on operand evaluation side effects? Typical precedence levels: 5. Does the language allow user-defined operator 1. parentheses overloading? 2. unary operators 6. What mode mixing is allowed in expressions? 3. ** (if the language supports it) 4. *, / 5. +, - Chapter 6 Programming 1 Chapter 6 Programming 2 Languages Languages Operator Associativity Operand Evaluation Order The operator associativity rules for expression The process: evaluation define the order in which adjacent 1. Variables: just fetch the value operators with the same precedence level are evaluated 2. Constants: sometimes a fetch from memory; sometimes the constant is in the machine Typical associativity rules: language instruction • Left to right, except **, which is right to left • Sometimes unary operators associate
    [Show full text]
  • 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 • To understand expression evaluation, need to be familiar with the orders of operator and operand evaluation • Essence of imperative languages is dominant role of assignment statements 1 Arithmetic Expressions • Arithmetic evaluation was one of the motivations for the development of the first programming languages • Arithmetic expressions consist of operators, operands, parentheses, and function calls Arithmetic Expressions: Design Issues • Design issues for arithmetic expressions – Operator precedence rules? – Operator associativity rules? – Order of operand evaluation? – Operand evaluation side effects? – Operator overloading? – Type mixing in expressions? 2 Arithmetic Expressions: Operators • A unary operator has one operand • A binary operator has two operands • A ternary operator has three operands Arithmetic Expressions: Operator Precedence Rules • The operator precedence rules for expression evaluation define the order in which “adjacent” operators of different precedence levels are evaluated • Typical precedence levels – parentheses – unary operators – ** (if the language supports it) – *, / – +, - 3 Arithmetic Expressions: Operator Associativity Rule • The operator associativity rules for expression evaluation define the order in which adjacent operators with the same precedence level are evaluated • Typical associativity
    [Show full text]
  • Arithmetic Expressions
    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 Expressions • Short-Circuit Evaluation • Assignment Statements • Mixed-Mode Assignment 2 Introduction • Expressions are the fundamental means of specifying computations in a programming language • To understand expression evaluation, need to be familiar with the orders of operator and operand evaluation • Essence of imperative languages is dominant role of assignment statements 3 Arithmetic Expressions • Arithmetic evaluation was one of the motivations for the development of the first programming languages • Arithmetic expressions consist of operators, operands, parentheses, and function calls 4 Arithmetic Expressions: Design Issues • Design issues for arithmetic expressions – Operator precedence rules? – Operator associativity rules? – Order of operand evaluation? – Operand evaluation side effects? – Operator overloading? – Type mixing in expressions? 5 Arithmetic Expressions: Operators • A unary operator has one operand • A binary operator has two operands • A ternary operator has three operands 6 Arithmetic Expressions: Operator Precedence Rules • The operator precedence rules for expression evaluation define the order in which “adjacent” operators of different precedence levels are evaluated • Typical precedence levels – parentheses – unary operators – ** (if the language supports it) – *, / – +, - 7 Arithmetic Expressions: Operator
    [Show full text]
  • How To: Use Basic C++, Syntax and Operators A
    June 7, 1999 10:10 owltex Sheet number 22 Page number 705 magenta black How to: Use Basic C++, Syntax and Operators A In this How to we summarize the basic syntax of C++ and the rules and operators that are used in C++ expressions. This is a brief language reference for C++ as used in this book, not the entire language. We don’t cover the use of dynamic memory in this How to. A.1 Syntax A.1.1 The Function main C++ programs begin execution with a function main. The smallest C++ program is shown below. It doesn’t do anything, but it’s syntactically legal C++. int main() { return 0; } The return value is passed back to the “system,” a nonzero value indicates some kind of failure. Although not used in this book, the function main can have parameters, these are so-called command-line parameters, passed to the program when the function is run. A brief synopsis of command-line parameters is given in Section A.2.6. A.1.2 Built-in and OtherTypes The built-in types in C++ used in this book are int, double, bool, and char.A type void is used as a built-in “empty-type,” but we don’t treat void as an explicit type. A function declared as void does not return a value of type void, but returns no value. In addition to double, the type float can be used to represent floating point values; but float is less precise and we do not use it.
    [Show full text]
  • Chapter 7 Expressions and Assignment Statements
    Chapter 7 Expressions and Assignment Statements 7.1 Introduction 302 7.2 Arithmetic Expressions 302 7.3 Overloaded Operators 311 7.4 Type Conversions 313 7.5 Relational and Boolean Expressions 316 7.6 Short-Circuit Evaluation 318 7.7 Assignment Statements 319 7.8 Mixed-Mode Assignment 324 Summary • Review Questions • Problem Set • Programming Exercises 324 CMPS401 Class Notes (Chap07) Page 1 / 15 Dr. Kuo-pao Yang Chapter 7 Expressions and Assignment Statements 7.1 Introduction 302 Expressions are the fundamental means of specifying computations in a programming language. To understand expression evaluation, need to be familiar with the orders of operator and operand evaluation. Essence of imperative languages is dominant role of assignment statements. 7.2 Arithmetic Expressions 302 Arithmetic evaluation was one of the motivations for the development of the first programming languages. Most of the characteristics of arithmetic expressions in programming languages were inherited from conventions that had evolved in mathematics. Arithmetic expressions consist of operators, operands, parentheses, and function calls. An operator can be unary, meaning it has a single operand, binary, meaning it has two operands, or ternary, meaning it has three operands. – C-based languages include a ternary operator, which has three operands (conditional expression). The purpose of an arithmetic expression is to specify an arithmetic computation. An implementation of such a computation must cause two actions: – Fetching the operands from memory – Executing the arithmetic operations on those operands. Design issues for arithmetic expressions: – 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? – What mode mixing is allowed in expressions? CMPS401 Class Notes (Chap07) Page 2 / 15 Dr.
    [Show full text]
  • Expressions and Assignment Statements
    Chapter7 Expression and Assignment Statement •Arithmetic Expressions •Overloaded Operators •Boolean Expressions •Short-Circuit Evaluation •Assignment Statements •Mixed-Mode Assignment Introduction •Fundamental means of specifying computations in a programming language •Arithmetic expressions consist of operators, operands, parentheses, and function calls 1 Arithmetic Expressions: Operators •A unary operator has one operand ! expression * expression ++ expression -- expression •A binary operator has two operands •A ternary operator has three operands // average = (count ==0) ? 0 : sum/count; using System; /*Learning C# */ public class ThreeInputValues { static void Main() { int valueOne = 10; int valueTwo = 20; int maxValue = valueOne > valueTwo ? valueOne : valueTwo; Console.WriteLine(valueOne, valueTwo, maxValue); } } 2 Precedence of Operators w - x / y - z or w / x - y / z 4*3**2 • Typical precedence levels – parentheses – unary operators – ** (exponentiation) – *, /, % – +, - 3 Arithmetic Expressions: Operator Associativity Rule Determines the order of operation between operators of the same precedence –In most cases, left to right x - y - z or x / y / z b = 9; c = 5; a = b = c; 5 is assigned to both a and b because of the right-to-left associativity of the = operator. 4 In Fortran, the exponentiation is right asssociative. 2**3**4 In Ada, The exponentiation operator is non-associative. If you wish to do more than one exponentiation in an expression, you must use parentheses. (2^3)^4; or 2^(3^4); APL is different; all operators have
    [Show full text]
  • Expression Evaluation and Control Flow in Text: Chapter 7, 8
    Expression Evaluation and Control Flow In Text: Chapter 7, 8 N. Meng, F. Poursardar Outline • Notation • Operator evaluation order • Operand evaluation order • Overloaded operators • Type conversions • Short-circuit evaluation of conditions • Control structures 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? 3 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 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 5 Notation & Placement • Prefix – op a b op(a,b) (op a b) • Infix – a op b • Postfix – a b op 6 Notation & Placement • Most imperative languages use infix notation for binary and prefix for unary operators • Lisp: prefix – (op a b) 7 Operator Evaluation Order • Precedence • Associativity • Parentheses The operator precedence and associativity rules of a language dictate the order of evaluation of its operators. 8 Operator Precedence • Define the order in which “adjacent” operators of different precedence levels are evaluated • E.g., a + b * c – Parenthetical groups (...) – Exponentiation ** Highest – Unary + , - – Mult & Div * , / – Add & Sub + , - – Assignment := Lowest • Where to put the parentheses? – E.g., A * B + C ** D / E - F 9 Operator Precedence We must have some definition of the order of operations, unless we want to write lots of parentheses.
    [Show full text]
  • Chapter 7 Additional Control Structures
    Chapter 7 Additional Control Structures Chapter 7 Topics Switch Statement for Multi-Way Branching Do-While Statement for Looping For Statement for Looping Using break and continue Statements Chapter 7 Topics Additional C++ Operators Operator Precedence Type Coercion in Arithmetic and Relational Precedence Switch Statement The Switch statement is a selection control structure for multi-way branching switch (IntegralExpression) { case Constant1 : Statement(s); // optional case Constant2 : Statement(s); // optional . default : // optional Statement(s); // optional } Example of Switch Statement float weightInPounds = 165.8; char weightUnit; . // User enters letter for desired weightUnit switch (weightUnit) { case ‘P’ : case ‘p’ : cout << weightInPounds << “ pounds “ << endl; break; case ‘O’ : case ‘o’ : cout << 16.0 * weightInPounds << “ ounces “ << endl; break; Example of Switch Statement, continued case ‘G’ : case ‘g’ : cout << 454.0 * weightInPounds << “ grams “ << endl; break; default : cout << “That unit is not handled! “ << endl; break; } Switch Statement The value of IntegralExpression (of char, short, int, long or enum type) determines which branch is executed Case labels are constant (possibly named) integral expressions Several case labels can precede a statement Control in Switch Statement Control branches to the statement following the case label that matches the value of IntegralExpression Control proceeds through all remaining statements, including the default, unless redirected with break Control in Switch Statement
    [Show full text]