DOCSLIB.ORG

Programming Inin C++C++ 5.5

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Programming Inin C++C++ 5.5 ProgrammingProgramming inin C++C++ 5.5. IntegralIntegral datadata typestypes ! Introduction ! Type int ! Integer multiplication & division ! Increment & decrement operators ! Associativity & precedence of operators ! Some common operators ! Long & short integers ! Unsigned integers ! Character types ! Summary 1 Introduction to programming in C++ for engineers: 5. Integral data types IntroductionIntroduction C++ is a typed language - the variables and the constants that occur in a program each have a type which controls how they may be used and what storage is required. The language-defined types which are defined to represent integers, characters and floating point numbers are known as fundamental types. It is also possible to define what are known as derived types in order to manipulate objects such as matrices, complex numbers etc. The motivation for using a typed language is that the compiler can catch many programming errors by performing type-checking. For example if an object is declared to be constant (by using const keyword) than an attempt to change its value is a compile-time error. The integral data types consist of two groups: the integer and character types. 2 Introduction to programming in C++ for engineers: 5. Integral data types TypeType intint The int is the most important of the integral data types and can hold both positive and negative integers. If we wish to use variables k, l, m they can be defined by: int k, l, m; Defining an object not only specifies the type but also reserves the appropriate amount of memory. We can also make an declaration e.g. extern int k; without reserving any memory. In a complete program there must be one and only one definition of an object even though there can be many declarations. An object must be defined or declared before it can be used in a program, otherwise a compile-time error occurs. The operator = is used for assignment. This is rather assignment than equality operator! 3 Introduction to programming in C++ for engineers: 5. Integral data types TypeType intint k=m+n;//sumofmandnisassignedtok k + 3 = 7; // WRONG!!! even looks mathematically OK k = k + l; // in mathematics OK only if l=0 k := 10; // := does not exist in C++ Since the int type occupies a fixed amount of memory only a limited amount of integers can be stored. Some operations can give results above the maximum amount or below the minimum value. Such invalid operations are called integer overflow or integer underflow respectively. INT_MAX and INT_MIN are the maximum and minimum values that can be stored by the int type. They are defined in the header file <limits.h>. These values depend on the particular compiler. 4 Introduction to programming in C++ for engineers: 5. Integral data types IntegerInteger multiplicationmultiplication && divisiondivision Integer multiplication is denoted by the token *. Integer division is denoted by forward slash /. Integer division with both numbers positive always truncates! The same is true when both numbers are negative. If only one number is negative the result depends on compiler. Integer modulus or remainder is denoted by % token. If k and l are both positive then k%lgives the remainder obtained on dividing k by l. If both k and l are negative the result is negative. If only one value is negative the result is dependent on the C++ compiler. k=(k/l)*l+k%l 5 Introduction to programming in C++ for engineers: 5. Integral data types IncrementIncrement && decrementdecrement operatorsoperators The value of a variable can be changed without using = operator. k=k+1; ++k; // prefix increment operator k++; // postfix increment operator The prefix operator increments k by one before it is used. The postfix operator increments after the value of k has been used. In many cases the result depends on pre or postfix character of ++. int i, j, k, l, m, n; i =2; j=2; k=3; m=i++/k; //assigns0tom n=++j/k; //assigns1ton There are also prefix and postfix decrement operators. 10++; // WRONG!!! constant cannot be incremented --3.14 // WRONG!!! and incremented too 6 Introduction to programming in C++ for engineers: 5. Integral data types AssociativityAssociativity && precedenceprecedence ofof operatorsoperators We have learnt how to use quite a few operators: =+-*/%++-- The =, *, /, % tokens are binary operators. It means that they are defined for an operand on each side of the operator. The ++, -- are both unary operators. They require a single operand. The - operator can be both a binary or an unary operator: k=i-j; k=-j; Operator precedence controls which operator in an expression is applied first. The associativity determines the order in which operators with the same precedence are applied. The compiler first uses operator precedence to determine the order of evaluation in an expression and any remaining ambiguities are removed by using operator associativity. 7 Introduction to programming in C++ for engineers: 5. Integral data types SomeSome commoncommon operators Operator Name Associativity ++ increment right to left -- decrement right to left - unary minus right to left __________ * multiplication left to right / division left to right % modulus left to right __________ + addition left to right - subtraction left to right __________ = assignment right to left += -= *= /= %= 8 Introduction to programming in C++ for engineers: 5. Integral data types LongLong && shortshort integersintegers Long integers have the same properties as integers - typically four bytes (the minimum acceptable for the ANSI and ISO C standard). It is rarely common for a compiler to define both int and long data types to have the same four byte representation. long int m; long n; The suffix L or l is used to distinguish a long constant. long k = 7L; Short integer type has the same properties as int except that a particular C++ compiler should not use for it more bytes than are used for int. This type can be useful for saving memory, but if the representation is less than the natural size suggested by the hardware there may be a performance penalty. Keyword short is used to define short integers. short int m; short n; 9 Introduction to programming in C++ for engineers: 5. Integral data types UnsignedUnsigned integersintegers The short, int and long types all have corresponding unsigned types. They occupy the same amount of memory as the signed type and they obey the laws of arithmetic modulo 2n. unsigned addition does not overflow and subtraction does not underflow, they simply wrap around. unsigned int k; // suppose represented by 2 bytes k = 65535; // max. unsigned number for 2 bytes k=k+1; //theresultis0!!! k=1-2; //theresultis65535 It is not usually worth using an unsigned rather than signed integral type just to gain a higher upper limit on the positive integers that can be stored. A U or u is used in any combination with L or l to denote an unsigned constant. unsigned int k = 1U; unsigned long m = 2UL; 10 Introduction to programming in C++ for engineers: 5. Integral data types CharacterCharacter typestypes The type char is represented by a sufficient number of bytes to hold any character belonging to the character set for the particular compiler. This representation is usually one byte (the minimum allowed by ANSI C standard). C++ distinguishes three character types: char unsigned char signed char The signed char and unsigned char data types obey the same rules of arithmetic as their integer counterparts. If the type is simply specified as char then it is compiler dependent as to whether or not the higher bit is treated as a sign bit. The char types are usually used to hold characters. char c1, c2; c1 = ‘A’; c2 = 44; 11 Introduction to programming in C++ for engineers: 5. Integral data types SummarySummary ! The integral types are short, int, long ! The character types are char, signed char, unsigned char ! Do not forget about basic integral operators together with their associativity and precedence. 12 Introduction to programming in C++ for engineers: 5. Integral data types.
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]
  • 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.
    [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]