DOCSLIB.ORG

Fortran 90 Standard Statement Keywords

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Fortran 90 Standard Statement Keywords APPENDIX A FORTRAN 90 STANDARD STATEMENT KEYWORDS For a given dialect of Fortran, there is normally some sort of refer­ ence document that formally specifies the valid syntax for each variety of statement. For most categories of statements, the syntax rules dic­ tate the appearance of fixed sequences of letters, traditionally known as keywords, at specified places in the statement. In particular, most state­ ments are required to begin with a keyword made up of a sequence of letters that constitute an ordinary word in the English language. Exam­ ples of such words are DO, END, and INTEGER. Some statements begin with a pair of keywords (for example, GO TO, DOUBLE PRECISION, ELSE IF). Furthermore, the term "keyword" encompasses certain sequences of letters appearing to the left of an equal sign (=) in a parenthesized list in certain (mostly I/O) statements. Consider, for example, the following statement: READ (UNIT = 15, FMT = "(A)", lOSTAT = ios) buf Here, the initial sequence of letters READ is, of course, a keyword, but also UNIT, FMT, and 10STAT are considered to be keywords, even though FMT and 10STAT are not English words. And, there are additional situ­ ations in Fortran where a particular sequence of letters appearing in a particular context is characterized as being a keyword. In Fortran 90, the sort of sequence of letters that has traditionally been called a "keyword" has been redesignated as a statement key­ word. The modifier "statement" has been prepended to distinguish the traditional sort of keyword from the Fortran 90 "argument keyword" as described in Section 13.9. But even in a Fortran 90 context, when not preceded by the word "argument," the term "keyword" is usually taken to mean "statement keyword." Table A.1 presents a list of Fortran 90 statement keywords. The list was extracted from the syntax rules in the new standard. Of course, all FORTRAN 77 keywords are statement keywords in Fortran 90, so 449 450 A. FORTRAN 90 STANDARD STATEMENT KEYWORDS bold typeface is employed in Table A.I to highlight those statement key­ words in Fortran 90 that are not keywords in FORTRAN 77. Also, the valid contexts in which each statement keyword is permitted to appear are summarized in Table A.I, and Fortran 90 statement keyword con­ texts that are not carried over from FORTRAN 77 are indicated by bold typeface. Always bear in mind that Table A.I is based on the Fortran 90 and FORTRAN 77 standards, while popular implementations are likely to feature additional keywords and/or contexts for keywords that are not reflected in this table. From the viewpoint of a Fortran applications programmer, the dis­ tinction between a (statement) keyword and other sequences of letters that are built into the language may not be obvious. Note, however, that edit descriptors, such as A, TR, and BZ, are not considered to be key­ words. Also, operators, such as .AND. and .NOT., are not keywords, and the logical constants .TRUE. and .FALSE. are not keywords. Of course, intrinsic procedure names are not keywords, although there are a few instances where the sequence of letters in the name of an intrinsic func­ tion is the same as that of a statement keyword (for example, REAL, LEN, and SIZE). TABLE A.l Fortran 90 Standard Statement Keywords Keyword Context(s) ACCESS ACCESS= specifier in OPEN or INQUIRE statement ACTION ACTlON= specifier In OPEN or INQUIRE statement ADVANCE ADVANCE= specifier In READ or WRITE statement ALLOCATABLE Array specification ALLOCATE Dynamically allocate storage. ASSIGN Assign label (statement number) to variable. ASSIGNMENT Interface block for defined assignment PUBLIC or PRIVATE statement ONLY clause of USE statement BACKSPACE Position data file. BLANK BLANK= specifier in OPEN or INQUIRE statement BLOCK BLOCK DATA statement END BLOCK DATA statement CALL Invoke a subroutine. CASE CASE construct CHARACTER Type declaration statement CLOSE Terminate connection of a unit to an external file. COMMON Specify block of physical storage that can be accessed by separately compiled scoping units. COMPLEX Type declaration statement A. FORTRAN 90 STANDARD STATEMENT KEYWORDS 451 TABLE A.1 Continued Keyword Context(s) CONTAINS Indicates presence of internal subprograms or module subprograms CONTINUE Statement indicating no action to be performed CYCLE Curtail execution of an iteration of a DO construct. DATA DATA statement to specify initial value for variable BLOCK DATA statement END BLOCK DATA statement DEALLOCATE Release storage obtained by ALLOCATE statement. DEFAULT Case selector in a CASE construct DELIM DELlM= specifier in OPEN or INQUIRE statement DIMENSION Array specification DIRECT DIRECT= specifier in INQUIRE statement DO Indexed DO statement DO construct DOUBLE DOUBLE PRECISION specification in type declaration statement ELSE IF construct ELSEWHERE WHERE construct END IF, DO, CASE, or WHERE construct Derived-type defintion Interface block END PROGRAM, END MODULE, END SUBROUTINE, END FUNCTION, or END BLOCK DATA statement Traditional one-word END statement END= specifier in READ or WRITE statement ENDFILE Write an endfile record. ENTRY Specify entry point in subprogram. EOR EOR= specifier in READ statement EQUIVALENCE Permit two or more local names to refer to same storage area. ERR ERR= specifier in 1/0 statements EXIST EXIST= specifier in INQUIRE statement EXIT Cause termination of execution of a DO construct. EXTERNAL Identifies names of external and dummy procedures and block data program units FILE FILE= specifier in OPEN or INQUIRE statement FMT FMT= specifier in READ or WRITE statement FORM FORM= specifier in OPEN or INQUIRE statement FORMAT FORMAT statement FORMATTED FORMATTED= specifier in INQUIRE statement FUNCTION First statement of a function subprogram END FUNCTION statement GO (Unconditional) GO TO, computed GO TO, assigned GO TO statements 452 A. FORTRAN 90 STANDARD STATEMENT KEYWORDS TABLE A.1 Continued Keyword Context(s) IF IF construct, (logical) IF statement, arithmetic IF statement IMPLICIT Indicate type and kind for implicitly typed data entities whose names begin with one of the letters specified. IMPLICIT NONE statement IN INTENT specification for dummy argument INOUT INTENT specification for dummy argument INQUIRE Inquire about status and attributes of a file. INTEGER Type declaration statement INTENT Specify intended use of dummy argument. INTERFACE First statement of an interface block END INTERFACE statement INTRINSIC Identifies names of intrinsic procedures IOLENGTH IOLENGTH= specifier in INQUIRE statement 10STAT 10STAT= specifier in 1/0 statement KIND KIND= specifier in type declaration statement LEN LEN= specifier in CHARACTER type specifications LOGICAL Type declaration statement MODULE First statement of a module program unit END MODULE statement MODULE PROCEDURE statement in interface block NAME NAME= specifier in INQUIRE statement NAMED NAMED= specifier in INQUIRE statement NAMELIST Specifies names of variables to be grouped for VO NEXTREC NEXTREC= specifier in INQUIRE statement NML NML= specifier in READ or WRITE statement NONE IMPLICIT NONE statement NULLIFY Give pOinter a verifiable status of having no target. NUMBER NUMBER= specifier in INQUIRE statement ONLY USE statement OPEN Initiate or modify connection between external file and unit. OPENED OPENED= specifier in INQUIRE statement OPERATOR Interface block for defined operation PUBLIC or PRIVATE statement ONLY clause of USE statement OPTIONAL Dummy argument specification OUT INTENT specification for dummy argument PAD PAD= specifier in OPEN or INQUIRE statement PARAMETER Specify name representing a constant value. PAUSE Cease execution, but leave program in resumable state. POINTER Indicates name may refer to different storage areas at different times POSITION POSITION= specifier in OPEN or INQUIRE statement PRECISION DOUBLE PRECISION specification in type declaration statement A. FORTRAN 90 STANDARD STATEMENT KEYWORDS 4S3 TABLE A.1 Continued Keyword Context(s} PRINT Perform output to default output unit. PRIVATE Indicates names In module which are not to be accessible outside the module PROCEDURE MODULE PROCEDURE statement in interface block PROGRAM First statement in main program END PROGRAM statement PUBLIC Indicates names In module which are to be accessible outside the module READ Perform input READ=: specifier in INQUIRE statement READWRITE READWRITE= specifier in INQUIRE statement REAL Type declaration statement REC REC= specifier in READ or WRITE statement RECl RECl= specifier in OPEN or INQUIRE statement RECURSIVE FUNCTION or SUBROUTINE statement RESULT FUNCTION or ENTRY statement RETURN Complete execution of instance of a subprogram. REWIND Position a file at its intial point. SAVE Indicates local variables in a subprogram whose values and statuses are to be retained after exit from that subprogram Indicates names of common blocks whose values are to be retained after exit from subprograms specifying those named common blocks Indicates variables In a module whose values and statuses are to be retained after exit from subprograms using that module SELECT CASE construct SEQUENCE In derived-type definition to Impose a storage order for values of components of that derived type SEQUENTIAL SEQUENTIAl: specifier in INQUIRE statement SIZE SIZE: specifier In READ statement STAT STAT= specifier In ALLOCATE or DEALLOCATE statement STATUS STATUS= specifier in OPEN or CLOSE statement STOP Terminate program execution. SUBROUTINE First statement of a subroutine subprogram END SUBROUTINE statement TARGET Specifies that all or part of
Load more

Recommended publications
  • 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]
  • A Concurrent PASCAL Compiler for Minicomputers
    512 Appendix A DIFFERENCES BETWEEN UCSD'S PASCAL AND STANDARD PASCAL The PASCAL language used in this book contains most of the features described by K. Jensen and N. Wirth in PASCAL User Manual and Report, Springer Verlag, 1975. We refer to the PASCAL defined by Jensen and Wirth as "Standard" PASCAL, because of its widespread acceptance even though no international standard for the language has yet been established. The PASCAL used in this book has been implemented at University of California San Diego (UCSD) in a complete software system for use on a variety of small stand-alone microcomputers. This will be referred to as "UCSD PASCAL", which differs from the standard by a small number of omissions, a very small number of alterations, and several extensions. This appendix provides a very brief summary Of these differences. Only the PASCAL constructs used within this book will be mentioned herein. Documents are available from the author's group at UCSD describing UCSD PASCAL in detail. 1. CASE Statements Jensen & Wirth state that if there is no label equal to the value of the case statement selector, then the result of the case statement is undefined. UCSD PASCAL treats this situation by leaving the case statement normally with no action being taken. 2. Comments In UCSD PASCAL, a comment appears between the delimiting symbols "(*" and "*)". If the opening delimiter is followed immediately by a dollar sign, as in "(*$", then the remainder of the comment is treated as a directive to the compiler. The only compiler directive mentioned in this book is (*$G+*), which tells the compiler to allow the use of GOTO statements.
    [Show full text]
  • Operators and Expressions
    UNIT – 3 OPERATORS AND EXPRESSIONS Lesson Structure 3.0 Objectives 3.1 Introduction 3.2 Arithmetic Operators 3.3 Relational Operators 3.4 Logical Operators 3.5 Assignment Operators 3.6 Increment and Decrement Operators 3.7 Conditional Operator 3.8 Bitwise Operators 3.9 Special Operators 3.10 Arithmetic Expressions 3.11 Evaluation of Expressions 3.12 Precedence of Arithmetic Operators 3.13 Type Conversions in Expressions 3.14 Operator Precedence and Associability 3.15 Mathematical Functions 3.16 Summary 3.17 Questions 3.18 Suggested Readings 3.0 Objectives After going through this unit you will be able to: Define and use different types of operators in Java programming Understand how to evaluate expressions? Understand the operator precedence and type conversion And write mathematical functions. 3.1 Introduction Java supports a rich set of operators. We have already used several of them, such as =, +, –, and *. An operator is a symbol that tells the computer to perform certain mathematical or logical manipulations. Operators are used in programs to manipulate data and variables. They usually form a part of mathematical or logical expressions. Java operators can be classified into a number of related categories as below: 1. Arithmetic operators 2. Relational operators 1 3. Logical operators 4. Assignment operators 5. Increment and decrement operators 6. Conditional operators 7. Bitwise operators 8. Special operators 3.2 Arithmetic Operators Arithmetic operators are used to construct mathematical expressions as in algebra. Java provides all the basic arithmetic operators. They are listed in Tabled 3.1. The operators +, –, *, and / all works the same way as they do in other languages.
    [Show full text]
  • Fortran Reference Guide
    FORTRAN REFERENCE GUIDE Version 2018 TABLE OF CONTENTS Preface............................................................................................................ xv Audience Description......................................................................................... xv Compatibility and Conformance to Standards............................................................ xv Organization................................................................................................... xvi Hardware and Software Constraints...................................................................... xvii Conventions................................................................................................... xvii Related Publications........................................................................................ xviii Chapter 1. Language Overview............................................................................... 1 1.1. Elements of a Fortran Program Unit.................................................................. 1 1.1.1. Fortran Statements................................................................................. 1 1.1.2. Free and Fixed Source............................................................................. 2 1.1.3. Statement Ordering................................................................................. 2 1.2. The Fortran Character Set.............................................................................. 3 1.3. Free Form Formatting..................................................................................
    [Show full text]
  • SPSS to Orthosim File Conversion Utility Helpfile V.1.4
    SPSS to Orthosim File Conversion Utility Helpfile v.1.4 Paul Barrett Advanced Projects R&D Ltd. Auckland New Zealand email: [email protected] Web: www.pbarrett.net 30th December, 2019 Contents 3 Table of Contents Part I Introduction 5 1 Installation Details ................................................................................................................................... 7 2 Extracting Matrices from SPSS - Cut and Paste ................................................................................................................................... 8 3 Extracting Matrices from SPSS: Orthogonal Factors - E.x..c..e..l. .E..x..p..o..r.t................................................................................................................. 17 4 Extracting Matrices from SPSS: Oblique Factors - Exce.l. .E..x..p..o..r..t...................................................................................................................... 24 5 Creating Orthogonal Factor Orthosim Files ................................................................................................................................... 32 6 Creating Oblique Factor Orthosim Files ................................................................................................................................... 41 3 Paul Barrett Part I 6 SPSS to Orthosim File Conversion Utility Helpfile v.1.4 1 Introduction SPSS-to-Orthosim converts SPSS 11/12/13/14 factor loading and factor correlation matrices into the fixed-format .vf (simple ASCII text) files
    [Show full text]
  • Cognitive Programming Language (CPL) Programmer's Guide
    Cognitive Programming Language (CPL) Programmer's Guide 105-008-02 Revision C2 – 3/17/2006 *105-008-02* Copyright © 2006, Cognitive. Cognitive™, Cxi™, and Ci™ are trademarks of Cognitive. Microsoft® and Windows™ are trademarks of Microsoft Corporation. Other product and corporate names used in this document may be trademarks or registered trademarks of other companies, and are used only for explanation and to their owner’s benefit, without intent to infringe. All information in this document is subject to change without notice, and does not represent a commitment on the part of Cognitive. No part of this document may be reproduced for any reason or in any form, including electronic storage and retrieval, without the express permission of Cognitive. All program listings in this document are copyrighted and are the property of Cognitive and are provided without warranty. To contact Cognitive: Cognitive Solutions, Inc. 4403 Table Mountain Drive Suite A Golden, CO 80403 E-Mail: [email protected] Telephone: +1.800.525.2785 Fax: +1.303.273.1414 Table of Contents Introduction.............................................................................................. 1 Label Format Organization .................................................................. 2 Command Syntax................................................................................ 2 Important Programming Rules............................................................. 3 Related Publications...........................................................................
    [Show full text]
  • A Compiler for a Simple Language. V0.16
    Project step 1 – a compiler for a simple language. v0.16 Change log: v0.16, changes from 0.15 Make all push types in compiler actions explicit. Simplified and better documentation of call and callr instruction compiler actions. Let the print statement print characters and numbers. Added a printv statement to print variables. Changed compiler actions for retr to push a variable value, not a literal value. Changes are shown in orange. v0.15, changes from 0.14 Change compiler actions for ret, retr, jmp. Change the description and compiler actions for poke. Change the description for swp. Change the compiler actions for call and callr. Changes shown in green. v0.14, changes from 0.13 Add peek, poke and swp instructions. Change popm compiler actions. Change callr compiler actions. Other small changes to wording. Changes are shown in blue. v0.13, changes from 0.12 Add a count field to subr, call and callr to simplify code generation. Changes are shown in red. v0.12 Changes from 0.11. Added a callr statement that takes a return type. Fix the generated code for this and for call to allow arguments to be pushed by the call. Add a retr that returns a value and update the reg. v0.11: changes from 0.10. Put typing into push operators. Put opcodes for compare operators. fix actions for call. Make declarations reserve a stack location. Remove redundant store instruction (popv does the same thing.) v0.10: changes from 0.0. Comparison operators (cmpe, cmplt, cmpgt) added. jump conditional (jmpc) added. bytecode values added.
    [Show full text]
  • Programming Basics - FORTRAN 77
    CWCS Workshop May 2005 Programming Basics - FORTRAN 77 http://www.physics.nau.edu/~bowman/PHY520/F77tutor/tutorial_77.html Program Organization A FORTRAN program is just a sequence of lines of plain text. This is called the source code. The text has to follow certain rules (syntax) to be a valid FORTRAN program. We start by looking at a simple example: program circle real r, area, pi c This program reads a real number r and prints c the area of a circle with radius r. write (*,*) 'Give radius r:' read (*,*) r pi = atan(1.0e0)*4.0e0 area = pi*r*r write (*,*) 'Area = ', area end A FORTRAN program generally consists of a main program and possibly several subprograms (i.e., functions or subroutines). The structure of a main program is: program name declarations statements end Note: Words that are in italics should not be taken as literal text, but rather as a description of what belongs in their place. FORTRAN is not case-sensitive, so "X" and "x" are the same variable. Blank spaces are ignored in Fortran 77. If you remove all blanks in a Fortran 77 program, the program is still acceptable to a compiler but almost unreadable to humans. Column position rules Fortran 77 is not a free-format language, but has a very strict set of rules for how the source code should be formatted. The most important rules are the column position rules: Col. 1: Blank, or a "c" or "*" for comments Col. 1-5: Blank or statement label Col. 6: Blank or a "+" for continuation of previous line Col.
    [Show full text]
  • ILE C/C++ Programmer's Guide
    IBM i 7.2 Programming IBM Rational Development Studio for i ILE C/C++ Programmer's Guide IBM SC09-2712-07 Note Before using this information and the product it supports, read the information in “Notices” on page 441. This edition applies to version 7, release 2, modification 0 of IBM Rational Development Studio for i (product number 5770-WDS) and to all subsequent releases and modifications until otherwise indicated in new editions. This version does not run on all reduced instruction set computer (RISC) models nor does it run on CISC models. This document may contain references to Licensed Internal Code. Licensed Internal Code is Machine Code and is licensed to you under the terms of the IBM License Agreement for Machine Code. © Copyright International Business Machines Corporation 1993, 2013. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents ILE C/C++ Programmer’s Guide..............................................................................1 PDF file for ILE C/C++ Programmer’s Guide............................................................................................... 3 About ILE C/C++ Programmer's Guide........................................................................................................5 Install Licensed Program Information................................................................................................... 5 Notes About Examples..........................................................................................................................
    [Show full text]
  • Fortran 90 Programmer's Reference
    Fortran 90 Programmer’s Reference First Edition Product Number: B3909DB Fortran 90 Compiler for HP-UX Document Number: B3908-90002 October 1998 Edition: First Document Number: B3908-90002 Remarks: Released October 1998. Initial release. Notice Copyright Hewlett-Packard Company 1998. All Rights Reserved. Reproduction, adaptation, or translation without prior written permission is prohibited, except as allowed under the copyright laws. The information contained in this document is subject to change without notice. Hewlett-Packard makes no warranty of any kind with regard to this material, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. Hewlett-Packard shall not be liable for errors contained herein or for incidental or consequential damages in connection with the furnishing, performance or use of this material. Contents Preface . xix New in HP Fortran 90 V2.0. .xx Scope. xxi Notational conventions . xxii Command syntax . xxiii Associated documents . xxiv 1 Introduction to HP Fortran 90 . 1 HP Fortran 90 features . .2 Source format . .2 Data types . .2 Pointers . .3 Arrays . .3 Control constructs . .3 Operators . .4 Procedures. .4 Modules . .5 I/O features . .5 Intrinsics . .6 2 Language elements . 7 Character set . .8 Lexical tokens . .9 Names. .9 Program structure . .10 Statement labels . .10 Statements . .11 Source format of program file . .13 Free source form . .13 Source lines . .14 Statement labels . .14 Spaces . .14 Comments . .15 Statement continuation . .15 Fixed source form . .16 Spaces . .16 Source lines . .16 Table of Contents i INCLUDE line . 19 3 Data types and data objects . 21 Intrinsic data types . 22 Type declaration for intrinsic types .
    [Show full text]
  • Control Flow Graphs • Can Be Done at High Level Or Low Level – E.G., Constant Folding
    Optimizations • Code transformations to improve program – Mainly: improve execution time – Also: reduce program size Control Flow Graphs • Can be done at high level or low level – E.g., constant folding • Optimizations must be safe – Execution of transformed code must yield same results as the original code for all possible executions 1 2 Optimization Safety Optimization Safety • Safety of code transformations usually requires certain • Safety of code transformations usually requires certain information that may not be explicit in the code information which may not explicit in the code • Example: dead code elimination • Example: dead code elimination (1) x = y + 1; (1) x = y + 1; (2) y = 2 * z; (2) y = 2 * z; (3) x=y+z;x = y + z; (3) x=y+z;x = y + z; (4) z = 1; (4) z = 1; (5) z = x; (5) z = x; • What statements are dead and can be removed? • Need to know whether values assigned to x at (1) is never used later (i.e., x is dead at statement (1)) – Obvious for this simple example (with no control flow) – Not obvious for complex flow of control 3 4 1 Dead Variable Example Dead Variable Example • Add control flow to example: • Add control flow to example: x = y + 1; x = y + 1; y = 2 * z; y = 2 * z; if (d) x = y+z; if (d) x = y+z; z = 1; z = 1; z = x; z = x; • Statement x = y+1 is not dead code! • Is ‘x = y+1’ dead code? Is ‘z = 1’ dead code? •On some executions, value is used later 5 6 Dead Variable Example Dead Variable Example • Add more control flow: • Add more control flow: while (c) { while (c) { x = y + 1; x = y + 1; y = 2 * z; y = 2
    [Show full text]
  • Developing Embedded SQL Applications
    IBM DB2 10.1 for Linux, UNIX, and Windows Developing Embedded SQL Applications SC27-3874-00 IBM DB2 10.1 for Linux, UNIX, and Windows Developing Embedded SQL Applications SC27-3874-00 Note Before using this information and the product it supports, read the general information under Appendix B, “Notices,” on page 209. Edition Notice This document contains proprietary information of IBM. It is provided under a license agreement and is protected by copyright law. The information contained in this publication does not include any product warranties, and any statements provided in this manual should not be interpreted as such. You can order IBM publications online or through your local IBM representative. v To order publications online, go to the IBM Publications Center at http://www.ibm.com/shop/publications/ order v To find your local IBM representative, go to the IBM Directory of Worldwide Contacts at http://www.ibm.com/ planetwide/ To order DB2 publications from DB2 Marketing and Sales in the United States or Canada, call 1-800-IBM-4YOU (426-4968). When you send information to IBM, you grant IBM a nonexclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. © Copyright IBM Corporation 1993, 2012. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Chapter 1. Introduction to embedded Include files for COBOL embedded SQL SQL................1 applications .............29 Embedding SQL statements
    [Show full text]