book

PROGRAMMING IN COBOL/400: 2nd Edition

Name: PROGRAMMING IN COBOL/400: 2nd Edition
ISBN: 9780471418467

by James Cooper, Nancy Stern, Robert A. Stern

January 2002

Intermediate to advanced

736 pages

18h 57m

English

Wiley

Read now

Unlock full access

Copyright
ACKNOWLEDGMENTS
PREFACE
INTENDED AUDIENCEOBJECTIVES OF THIS BOOKHOW THIS BOOK DIFFERS FROM PROGRAMMING IN COBOL/400, FIRST EDITIONPROGRAMMING IN COBOL/400 WEB SITE
1. PHYSICAL FILES
1.1. CHAPTER OBJECTIVES1.2. HIERARCHY OF DATA1.3. INTERNAL BINARY REPRESENTATION OF DATA1.4. DATA TYPES1.5. ALPHANUMERIC (CHARACTER) FIELDS1.6. NUMERIC FIELDS1.7. ZONED DECIMAL FORMAT1.8. PACKED DECIMAL FORMAT1.9. PACKING NUMERIC DATA1.10. CONVERTING ZONED DECIMAL FORMAT TO PACKED DECIMAL FORMAT1.11. CONVERTING PACKED DECIMAL FORMAT TO ZONED DECIMAL FORMAT1.12. DATE FORMAT1.13. DATA FILES1.14. ACCESS PATHS1.15. HOW DATA ARE ORGANIZED AND RETRIEVED IN AN ARRIVAL SEQUENCE (NONKEYED) PHYSICAL FILE1.16. HOW DATA ARE ORGANIZED AND RETRIEVED IN A KEYED SEQUENCE PHYSICAL FILE1.17. CREATING A PHYSICAL FILE1.18. CASE PROBLEM: CREATING A PHYSICAL FILE1.19. DETERMINE THE RECORD FORMAT FOR THE PHYSICAL FILE1.20. DATA DESCRIPTION SPECIFICATIONS (DDS) FOR AN ARRIVAL SEQUENCE FILE1.21. DDS FOR A KEYED SEQUENCE FILE1.22. COMPILE SOURCE DDS INTO A FILE OBJECT1.23. DISPLAYING THE FIELD ATTRIBUTES OF A PHYSICAL FILE1.24. ENTERING DATA INTO A PHYSICAL FILE WITH DFU1.25. DISPLAYING THE CONTENTS OF PHYSICAL FILE RECORDS1.26. PRINTING OR DISPLAYING RECORDS WITH THE COPY FILE (CPYF) COMMAND1.27. USING THE CHANGE PHYSICAL FILE (CHGPF) COMMAND1.28. END-OF-CHAPTER AIDS1.28.1. CHAPTER SUMMARY1.28.2. KEY TERMS1.29. CHAPTER SELF-TEST1.29.1. TRUE-FALSE QUESTIONS1.29.2. FILL-IN-THE BLANKS1.30. CHAPTER REVIEW QUESTIONS1.30.1. GENERAL QUESTIONS1.30.2. PROGRAMMING ASSIGNMENTS
2. AN INTRODUCTION TO PROGRAMMING IN COBOL/400
2.1. CHAPTER OBJECTIVES2.2. TYPES OF COMPUTER PROGRAMS2.3. OPERATING SYSTEM SOFTWARE2.4. APPLICATION PROGRAMS2.5. MACHINE LANGUAGE PROGRAMS2.6. SYMBOLIC PROGRAMS2.7. AN INTRODUCTION TO COBOL2.7.1. COBOL IS A BUSINESS-ORIENTED LANGUAGE2.8. COBOL IS A STANDARD LANGUAGE2.9. COBOL IS AN ENGLISH-LIKE LANGUAGE2.10. COBOL IS A USER-FRIENDLY LANGUAGE2.11. A HISTORY OF COBOL AND THE ANS VERSIONS2.11.1. WHEN IT BEGAN2.12. THE AMERICAN NATIONAL STANDARDS (ANS) VERSIONS OF COBOL2.13. ILE COBOL AND THE ANS COBOL 1985 STANDARD2.14. THE APPLICATIONS PROGRAM DEVELOPMENT PROCESS2.15. DETERMINE THE PROGRAM SPECIFICATIONS2.16. DESIGN THE PROGRAM USING PROGRAM PLANNING TOOLS2.17. CODE AND ENTER THE PROGRAM2.18. COMPILE THE PROGRAM INTO A PROGRAM OBJECT2.19. TEST THE PROGRAM2.20. DEBUGGING PHASES2.21. DEBUGGING TECHNIQUES2.22. DOCUMENT THE PROGRAM2.23. CASE PROBLEM2.24. PROBLEM DEFINITION2.25. INPUT LAYOUT2.26. OUTPUT LAYOUT2.27. PLANNING THE PROGRAM'S DESIGN2.28. INTERPRETING THE FLOWCHART IN FIGURE 2.102.29. INTERPRETING THE PSEUDOCODE IN FIGURE 2.112.30. THE PROGRAM ILLUSTRATED2.31. THE COBOL CODING SHEET2.32. THE MAIN BODY OF A COBOL PROGRAM2.33. COLUMN 7: FOR COMMENTS, CONTINUING NONNUMERIC LITERALS, AND STARTING A NEW PAGE2.34. BLANK LINES FOR SEPARATING ENTRIES2.35. AREAS A AND B2.36. AN OVERVIEW OF THE FOUR DIVISIONS2.37. TYPES OF COBOL ENTRIES AND THEIR MARGIN RULES2.38. THE IDENTIFICATION DIVISION2.39. THE IDENTIFICATION DIVISION INSTRUCTION FORMAT2.40. UNDERSTANDING INSTRUCTION FORMATS AS THEY APPEAR IN REFERENCE MANUALS2.41. CODING THE IDENTIFICATION DIVISION2.42. THE ENVIRONMENT DIVISION2.43. CONFIGURATION SECTION2.44. INPUT-OUTPUT SECTION2.45. THE DATA DIVISION2.46. USING THE APOSTROPHE IN COBOL PROGRAMS2.47. THE PROCEDURE DIVISION2.48. SCOPE TERMINATORS2.49. LOOPING WITH THE PERFORM STATEMENT2.50. CREATING AN EXECUTABLE PROGRAM OBJECT2.51. END-OF-CHAPTER AIDS2.51.1. CHAPTER SUMMARY2.51.2. The ENVIRONMENT DIVISION.2.51.3. The DATA DIVISION.2.51.4. The PROCEDURE DIVISION.2.51.5. KEY TERMS2.52. CHAPTER SELF-TEST2.52.1. TRUE-FALSE QUESTIONS2.52.2. FILL-IN-THE-BLANKS2.53. CHAPTER REVIEW QUESTIONS2.53.1. GENERAL QUESTIONS2.54. PROGRAMMING ASSIGNMENTS
3. DEFINING FILES AND PROCESSING DATA
3.1. CHAPTER OBJECTIVES3.2. SPECIFYING ARRIVAL SEQUENCE AND KEYED SEQUENCE FILES FOR PROCESSING3.3. THE SELECT STATEMENT3.4. THE SELECT STATEMENT FOR AN ARRIVAL SEQUENCE FILE3.5. THE SELECT STATEMENT FOR A KEYED SEQUENCE FILE3.6. THE ASSIGN CLAUSE3.7. THE ORGANIZATION CLAUSE3.8. THE ACCESS CLAUSE3.9. THE RECORD KEY CLAUSE3.10. DEFINING FILES3.11. THE DATA DIVISION3.12. VARIABLE AND CONSTANT DATA3.13. FORMING DATA-NAMES3.14. In COBOL/400, user-defined names must conform to the following rules:3.15. USE PREFIXES OR SUFFIXES WHERE APPROPRIATE3.16. THE FILE SECTION OF THE DATA DIVISION3.17. FILE DESCRIPTION ENTRIES3.18. DEFINING A RECORD WITH RECORD DESCRIPTION ENTRIES3.19. USING LEVEL NUMBERS TO DEFINE FIELDS WITHIN A RECORD3.20. ELEMENTARY AND GROUP FIELDS3.21. INVALID USE OF LEVEL NUMBERS3.22. PICTURE (PIC) CLAUSES3.23. TYPE OF DATA3.24. SIZE OF DATA FIELDS3.25. FORMAT OF THE PIC CLAUSE3.26. THE USE OF THE IMPLIED DECIMAL POINT IN PIC CLAUSES3.27. PACKED-DECIMAL OR COMPUTATIONAL-3 (COMP-3)3.28. MULTIPLE-RECORD TYPES IN DISK FILES3.29. RECORD DESCRIPTION ENTRIES FOR PRINTER FILES3.30. USE OF RESERVED WORD FILLER IN RECORD DESCRIPTION ENTRIES3.31. THE WORKING-STORAGE SECTION OF THE DATA DIVISION3.32. USING AN END-OF-FILE INDICATOR3.33. THE PROCEDURE DIVISION3.34. DEFINING PARAGRAPHS3.35. STATEMENTS AND SENTENCES WITHIN PARAGRAPHS3.36. THE SEQUENCE OF INSTRUCTIONS IN A PROGRAM3.37. STATEMENTS TYPICALLY CODED IN THE MAIN MODULE3.38. OPEN STATEMENT3.39. READ STATEMENT3.40. THE NOT AT END CLAUSE3.41. PERFORM . . . UNTIL STATEMENT: A STRUCTURED PROGRAMMING TECHNIQUE3.42. CORRECTLY SEQUENCING INSTRUCTIONS IN A MODULE3.43. END-OF-JOB PROCESSING: THE CLOSE AND STOP RUN STATEMENTS3.44. CLOSE STATEMENT3.45. STOP RUN STATEMENT3.46. AN INTRODUCTION TO THE MOVE AND WRITE STATEMENTS3.47. SIMPLIFIED MOVE STATEMENT3.48. WRITE STATEMENT3.49. EXTERNALLY DESCRIBED FILES3.50. THE SELECT STATEMENT FOR AN EXTERNALLY DESCRIBED FILE3.51. THE ASSIGN CLAUSE3.52. THE RECORD KEY CLAUSE3.53. FORMAT 2 COPY STATEMENT3.54. USING THE ALIAS KEYWORD3.55. END-OF-CHAPTER AIDS3.55.1. CHAPTER SUMMARY3.55.2. KEY TERMS3.56. CHAPTER SELF-TEST3.56.1. TRUE-FALSE QUESTIONS3.56.2. FILL-IN-THE BLANKS3.57. CHAPTER REVIEW QUESTIONS3.57.1. GENERAL QUESTIONS3.58. DEBUGGING EXERCISE 13.59. DEBUGGING EXERCISE 23.60. PRACTICE PROGRAM3.61. PROGRAMMING ASSIGNMENTS
4. PRINTING REPORTS
4.1. CHAPTER OBJECTIVES4.2. TYPES OF REPORTS4.3. DETAIL REPORTS4.4. EXCEPTION REPORTS4.5. SUMMARY OR GROUP REPORTS4.6. THE PRINTER SPACING CHART4.7. PRINTING HEADINGS, DETAIL LINES, AND TOTAL LINES4.8. DEFINING MULTIPLE RECORD TYPES FOR PRINTER FILES4.9. VALUE CLAUSES FOR WORKING-STORAGE ENTRIES4.10. THE WRITE . . . FROM STATEMENT4.11. THE ADVANCING OPTION FOR SPACING LINES4.12. OVERPRINTING4.13. ADVANCING THE PAPER TO A NEW PAGE USING THE PAGE OPTION4.14. PRINTING THE CURRENT SYSTEM DATE ON A REPORT4.15. USING THE RESERVED WORD CURRENT-DATE FIELD.4.16. USING THE RESERVED WORD DATE FIELD.4.17. EDITING PRINTED OUTPUT4.18. EDITING FUNCTIONS4.19. PRINTING DECIMAL POINTS4.20. SUPPRESSING LEADING ZEROS4.21. BE SURE TO SIZE THE REPORT-ITEM CORRECTLY4.22. PRINTING DOLLAR SIGNS AND COMMAS4.23. PRINTING ASTERISKS (*) FOR CHECK PROTECTION4.24. PRINTING PLUS OR MINUS SIGNS4.25. PRINTING DEBIT AND CREDIT SYMBOLS FOR ACCOUNTING APPLICATIONS4.26. PRINTING SPACES OR ZEROS AS SEPARATORS WITHIN FIELDS4.27. DE-EDITING4.28. EDITING USING FLOATING STRINGS4.29. BLANK WHEN ZERO OPTION4.30. THE JUSTIFIED RIGHT OPTION4.31. PRINTING QUOTATION MARKS4.32. CONTROLLING THE SPACING OF PRINTED REPORTS4.32.1. USING A PROGRAMMED LINE COUNTER FOR END-OF-PAGE CONTROL4.33. PRINTING THE HEADINGS ON THE FIRST PAGE4.34. LINE COUNTING FOR SINGLE-SPACED REPORTS4.35. LINE COUNTING FOR DOUBLE-SPACED REPORTS4.36. USING A LINE LIMIT FIELD TO DETERMINE THE NUMBER OF LINES TO PRINT4.37. PRINTING PAGE NUMBERS4.38. USING THE READ . . . INTO STATEMENT IN PLACE OF READ AND MOVE STATEMENTS4.39. CASE PROBLEM4.40. END-OF-CHAPTER AIDS4.40.1. CHAPTER SUMMARY4.40.2. KEY TERMS4.41. CHAPTER SELF-TEST4.41.1. TRUE-FALSE QUESTIONS4.41.2. FILL-IN-THE BLANKS4.42. PRACTICE PROGRAM4.43. CHAPTER REVIEW QUESTIONS4.43.1. GENERAL QUESTIONS4.44. PROGRAMMING ASSIGNMENTS
5. DESIGNING STRUCTURED PROGRAMS
5.1. CHAPTER OBJECTIVES5.2. WRITING WELL-DESIGNED PROGRAMS5.3. PROGRAMS SHOULD USE A TOP-DOWN MODULAR APPROACH5.4. PROGRAMS SHOULD BE STRUCTURED5.5. PROGRAM LOGIC SHOULD BE MAPPED OUT USING A PLANNING TOOL5.6. HIERARCHY CHARTS FOR TOP-DOWN PROGRAMMING5.7. NAMING MODULES OR PARAGRAPHS5.8. MODULARIZING PROGRAMS USING PERFORM STATEMENTS5.9. DESIGNING THE LOGIC BEFORE CODING A PROGRAM5.10. FLOWCHARTS5.11. PSEUDOCODE: STANDARD AND STRUCTURED5.12. THE FOUR LOGICAL CONTROL STRUCTURES5.13. SEQUENCE5.14. SELECTION5.15. ITERATION5.16. THE INFINITE LOOP: AN ERROR TO BE AVOIDED5.17. CASE STRUCTURE5.18. STRUCTURED PROGRAMMING CODING GUIDELINES5.18.1. CODE EACH CLAUSE ON A SEPARATE LINE5.19. INDENT LINES WITHIN A SENTENCE5.20. CASE PROBLEM5.21. END-OF-CHAPTER AIDS5.21.1. CHAPTER SUMMARY5.21.2. KEY TERMS5.22. CHAPTER SELF-TEST5.22.1. TRUE-FALSE QUESTIONS5.22.2. FILL-IN-THE BLANKS5.23. CHAPTER REVIEW QUESTIONS5.23.1. GENERAL QUESTIONS5.24. PRACTICE PROGRAM #15.25. PRACTICE PROGRAM #25.26. PROGRAMMING ASSIGNMENTS
6. MOVING DATA AND TEXT MANIPULATION
6.1. CHAPTER OBJECTIVES6.2. THE INSTRUCTION FORMATS OF THE MOVE STATEMENT6.3. The two instruction formats for the MOVE statement are6.4. NUMERIC MOVE6.5. WHEN SENDING AND RECEIVING FIELDS HAVE THE SAME PIC CLAUSES6.6. WHEN SENDING AND RECEIVING FIELDS HAVE DIFFERENT PIC CLAUSES6.7. AVOIDING TRUNCATION6.8. MOVING NUMERIC LITERALS TO NUMERIC FIELDS6.8.1. NUMERIC LITERALS6.8.2. Valid Numeric Literals6.9. MOVING SIGNED NUMBERS6.10. ALPHANUMERIC OR NONNUMERIC MOVE6.11. MOVING LITERALS TO ALPHANUMERIC (NONNUMERIC) FIELDS6.11.1. ALPHANUMERIC (NONNUMERIC) LITERALS6.12. A GROUP MOVE IS CONSIDERED AN ALPHANUMERIC (NONNUMERIC) MOVE6.13. DECIMAL DATA ERROR6.14. MOVING FIGURATIVE CONSTANTS6.15. SUMMARY OF MOVE OPERATIONS6.16. MOVING DATA WITH TEXT MANIPULATION6.16.1. REFERENCING SEGMENTS OF A FIELD6.17. TEXT MANIPULATION WITH THE STRING STATEMENT6.18. GENERAL RULES FOR USING THE STRING6.19. CASE PROBLEM6.20. END-OF-CHAPTER AIDS6.20.1. CHAPTER SUMMARY6.20.2. KEY TERMS6.21. CHAPTER SELF-TEST6.21.1. TRUE-FALSE QUESTIONS6.21.2. FILL-IN-THE BLANKS6.22. CHAPTER REVIEW QUESTIONS6.22.1. GENERAL QUESTIONS6.23. DEBUGGING EXERCISES6.24. PRACTICE PROGRAM6.25. PROGRAMMING ASSIGNMENTS
7. COMPUTING IN COBOL: THE ARITHMETIC VERBS
7.1. CHAPTER OBJECTIVES7.2. THE FOUR BASIC ARITHMETIC OPERATIONS7.3. ADD STATEMENT7.4. FIELDS USED IN AN ADD7.5. USING FORMAT 1 OF THE ADD STATEMENT7.6. USING FORMAT 2 OF THE ADD STATEMENT7.7. USING FORMAT 3 OF THE ADD STATEMENT7.8. DECIDING WHETHER TO USE THE TO OR GIVING FORMAT7.9. ADDING MORE THAN TWO FIELDS7.10. PRODUCING MORE THAN ONE SUM7.11. SUBTRACT STATEMENT7.12. DECIDING WHICH FORMAT TO USE7.13. MULTIPLY STATEMENT7.14. EXAMPLE OF ARITHMETIC OPERATIONS THAT USE THE MULTIPLY OPERATION7.15. STORING INTERMEDIATE RESULTS7.16. DIVIDE STATEMENT7.17. USE OF THE REMAINDER CLAUSE IN THE DIVIDE OPERATION7.17.1. USING REMAINDER CLAUSE WITH DIVIDE STATEMENT7.18. OPTIONS AVAILABLE WITH ARITHMETIC VERBS7.18.1. ROUNDED OPTION7.19. HOW ROUNDING IS ACCOMPLISHED7.20. ON SIZE ERROR OPTION7.21. AVOIDING SIZE ERRORS7.22. DIVIDING BY ZERO CAUSES A SIZE ERROR7.23. NOT ON SIZE ERROR CLAUSE7.24. DETERMINING THE SIZE OF RECEIVING FIELDS7.25. USING SCOPE TERMINATORS7.26. THE COMPUTE STATEMENT7.27. SPACING RULES WITH A COMPUTE7.28. THE COMPUTE WITH AND WITHOUT ROUNDING7.29. ORDER OF EVALUATION7.30. COMPARING COMPUTE TO ARITHMETIC VERBS7.31. SIGNED NUMBERS IN ARITHMETIC OPERATIONS FOR FIELDS THAT CAN BE NEGATIVE7.32. RULES FOR PERFORMING ARITHMETIC WITH SIGNED NUMBERS7.33. ENTERING A SIGN SEPARATE FROM THE DATA7.34. CLEARING FIELDS USING THE INITIALIZE STATEMENT7.35. LIKE CLAUSE7.36. DISPLAY STATEMENT7.37. CASE PROBLEM # 17.38. CASE PROBLEM # 27.39. END-OF-CHAPTER AIDS7.39.1. CHAPTER SUMMARY7.39.2. KEY TERMS7.40. CHAPTER SELF-TEST7.40.1. TRUE-OR-FALSE QUESTIONS7.40.2. FILL-IN-THE BLANKS7.41. CHAPTER REVIEW QUESTIONS7.41.1. GENERAL QUESTIONS7.42. DEBUGGING EXERCISES7.43. PRACTICE PROGRAM7.44. PROGRAMMING ASSIGNMENTS

8. DECISION-MAKING USING THE IF AND EVALUATE STATEMENTS
8.1. CHAPTER OBJECTIVES8.2. LOGICAL CONTROL STRUCTURES8.3. THE IF CONDITIONAL STATEMENT8.4. THE INSTRUCTION FORMAT FOR AN IF STATEMENT8.5. A SIMPLE IF STATEMENT8.6. AN IF STATEMENT WITH ELSE CLAUSE8.7. RELATIONAL OPERATORS8.8. NUMERIC FIELDS SHOULD NOT CONTAIN BLANKS8.9. HOW COMPARISONS ARE PERFORMED8.10. EBCDIC COLLATING SEQUENCE8.11. ENDING CONDITIONAL SENTENCES WITH A PERIOD OR AN END-IF SCOPE TERMINATOR8.12. THE CONTINUE CLAUSE8.13. NESTED CONDITIONAL IF STATEMENT8.14. COMPOUND CONDITIONAL8.15. OR IN A COMPOUND CONDITIONAL8.16. LIMITATIONS ON A COMPOUND CONDITIONAL8.17. IMPLIED OPERANDS8.18. AND IN A COMPOUND CONDITIONAL8.19. USING AND AND OR IN THE SAME STATEMENT8.20. ORDER OF EVALUATION OF COMPOUND CONDITIONALS8.21. THE EVALUATE STATEMENT: THE CASE STRUCTURE8.22. DATA VALIDATION8.23. THE SIGN TEST8.24. TESTING FOR REASONABLENESS8.25. THE CLASS TEST8.26. CHECKING FOR MISSING DATA8.27. ALPHABETIC CLASS TEST8.28. NEGATING CONDITIONALS8.28.1. NEGATING SIMPLE CONDITIONALS8.28.2. NEGATING COMPOUND CONDITIONALS8.29. CONDITION-NAMES: CHECKING CODED FIELDS FOR VALID CONTENTS8.30. SET STATEMENT8.31. CASE PROBLEM8.32. END-OF-CHAPTER AIDS8.32.1. CHAPTER SUMMARY8.32.2. KEY TERMS8.33. CHAPTER SELF-TEST8.33.1. TRUE-OR-FALSE QUESTIONS8.33.2. FILL-IN-THE BLANKS8.33.3. GENERAL QUESTIONS8.33.4. PRACTICE PROGRAM8.34. REVIEW QUESTIONS8.34.1. GENERAL QUESTIONS8.34.2. DEBUGGING EXERCISES8.35. PROGRAMMING ASSIGNMENTS
9. ITERATION: BEYOND THE BASIC PERFORM
9.1. CHAPTER OBJECTIVES9.2. THE SIMPLE PERFORM REVIEWED9.3. IN-LINE PERFORM STATEMENT9.4. MODULARIZING PROGRAMS USING PERFORM STATEMENTS9.5. NESTED PERFORM: A PERFORM WITHIN A PERFORM9.6. EXECUTING A GROUP OF PARAGRAPHS WITH A SIMPLE PERFORM9.7. ITERATION USING OTHER TYPES OF PERFORMS9.8. ITERATION USING THE PERFORM . . . UNTIL STATEMENT9.9. CODING A LOOP WITH A PERFORM ... UNTIL: AN EXAMPLE9.10. A PERFORM ... UNTIL TESTS FOR THE CONDITION FIRST9.11. AVOIDING THE INFINITE LOOP9.12. ITERATION USING THE PERFORM ... TIMES STATEMENT9.13. CODING A LOOP WITH A PERFORM ... TIMES: AN EXAMPLE9.14. USING A VARIABLE FIELD IN A PERFORM . . . TIMES STATEMENT9.15. THE PERFORM ... VARYING STATEMENT9.16. USING NESTED PERFORM ... VARYING STATEMENTS9.17. PERFORM ... VARYING: EXAMPLE 29.18. THE PERFORM WITH TEST AFTER OPTION9.19. WHICH ITERATION STATEMENT TO USE9.20. END-OF-CHAPTER-AIDS9.20.1. CHAPTER SUMMARY9.20.2. KEY TERMS9.21. CHAPTER SELF-TEST9.21.1. TRUE-FALSE QUESTIONS9.21.2. FILL-IN-THE BLANKS9.22. CHAPTER REVIEW QUESTIONS9.22.1. GENERAL QUESTIONS9.22.2. DEBUGGING EXERCISES9.22.3. PRACTICE PROGRAM9.23. PROGRAMMING ASSIGNMENTS
10. THE COPY AND CALL STATEMENTS
10.1. CHAPTER OBJECTIVES10.2. THE COPY STATEMENT10.3. ENTRIES THAT CAN BE COPIED10.4. THE FULL FORMAT FOR THE COPY STATEMENT10.5. CASE PROBLEM CPCH10A10.6. MODULAR PROGRAMMING10.7. THE CALL STATEMENT10.8. LINKAGE TYPE PHRASE10.9. IN LIBRARY PHRASE10.10. USING PHASE10.11. THE BY CONTENT CLAUSE10.12. GROUPING DATA TO BE PASSED10.13. CALLED PROGRAM REQUIREMENTS10.14. DYNAMIC (EXTERNAL) AND STATIC BINDING10.15. DYNAMIC (EXTERNAL) PROGRAM CALLS10.16. STATIC PROGRAM CALLS10.17. THE CREATE BOUND COBOL (CRTBNDCBL) COMMAND10.18. CASE PROBLEM CPCH10B10.19. CASE PROBLEM CPCH10C10.20. END-OF-CHAPTER AIDS10.20.1. CHAPTER SUMMARY10.20.2. KEY TERMS10.21. CHAPTER SELF-TEST10.21.1. TRUE-FALSE QUESTIONS10.21.2. FILL-IN-THE BLANKS10.22. CHAPTER REVIEW QUESTIONS10.22.1. GENERAL QUESTIONS10.22.2. PRACTICE PROGRAM10.23. PROGRAMMING ASSIGNMENTS
11. LOGICAL FILES
11.1. CHAPTER OBJECTIVES11.2. LOGICAL FILES11.3. USING A SIMPLE LOGICAL FILE TO ENSURE THE DATA FILE IS IN THE CORRECT SEQUENCE11.4. USING A LOGICAL FILE IN A COBOL/400 PROGRAM11.5. SELECTING SPECIFIC FIELDS WITH A LOGICAL FILE11.6. SELECTING AND OMITTING RECORDS USING LOGICAL FILES11.7. ORED COMPARISIONS11.8. ANDED COMPARISONS11.9. CREATING A LOGICAL FILE11.10. LOGICAL FILE WITH MULTIPLE-RECORD FORMATS11.11. JOIN LOGICAL FILES11.12. JOIN LOGICAL FILE CONCEPTS11.13. HOW TO CODE JOIN FILES11.14. EXAMPLE 1: JOINING TWO FILES AND USING DEFAULT VALUES FOR UNMATCHED RECORDS11.15. EXAMPLE 2: JOINING TWO FILES AND SEQUENCING MULTIPLE MATCHES FROM A SECONDARY FILE11.16. EXAMPLE 3: JOINING FOUR FILES11.17. JOIN LOGICAL FILE KEYWORD DEFINITIONS11.18. END-OF-CHAPTER AIDS11.18.1. CHAPTER SUMMARY11.18.2. KEY TERMS11.19. CHAPTER SELF-TEST11.19.1. TRUE-FALSE QUESTIONS11.19.2. FILL-IN-THE BLANKS11.20. CHAPTER REVIEW QUESTIONS11.20.1. GENERAL QUESTIONS11.21. PROGRAMMING ASSIGNMENTS
12. CONTROL BREAK PROCESSING
12.1. CHAPTER OBJECTIVES12.2. DETAIL AND SUMMARY REPORTS12.3. CASE PROBLEM #1: AN EXAMPLE OF A CONTROL BREAK PROCEDURE12.4. USING A LOGICAL FILE IN A CONTROL BREAK PROGRAM12.5. THE CONTROL BREAK PROCEDURE12.6. PROGRAM REQUIREMENTS FOR SINGLE-LEVEL CONTROL BREAK PROCESSING12.7. FORCING A CONTROL BREAK WHEN THERE ARE NO MORE RECORDS12.8. REFINEMENTS TO IMPROVE THE QUALITY OF A CONTROL BREAK REPORT12.9. PRINTING A FINAL TOTAL12.10. GROUP SUPPRESSION OF A CONTROL FIELD12.11. PRINTING THE CONTROL FIELD WITH THE CONTROL BREAK TOTAL LINE12.12. EXECUTING THE CONTROL BREAK MODULE FROM THE MAIN MODULE AFTER AN END-OF-FILE CONDITION HAS BEEN MET12.13. CASE PROBLEM #2: MULTIPLE-LEVEL CONTROL BREAKS12.14. STARTING A NEW PAGE AFTER EACH CONTROL BREAK12.15. END-OF-CHAPTER-AIDS12.15.1. CHAPTER SUMMARY12.15.2. KEY TERMS12.16. CHAPTER SELF-TEST QUESTIONS12.16.1. TRUE-FALSE QUESTIONS12.16.2. FILL-IN-THE BLANKS12.17. CHAPTER REVIEW QUESTIONS12.17.1. GENERAL QUESTIONS12.17.2. DEBUGGING EXERCISES12.17.3. PRACTICE PROGRAM12.18. PROGRAMMING ASSIGNMENTS
13. RANDOM FILE ACCESS FOR KEYED FILES
13.1. CHAPTER OBJECTIVES13.2. ACCESSING A KEYED FILE RANDOMLY13.3. THE SELECT STATEMENT13.4. THE READ STATEMENT13.5. INVALID KEY CLAUSE13.6. READING DATA RANDOMLY AS NEEDED: AN EXAMPLE13.7. UPDATING A KEYED FILE RANDOMLY13.8. OPENING A KEYED FILE AS I-O13.9. REWRITE A RECORD TO UPDATE IT13.10. THE INVALID KEY CLAUSE13.11. DELETING RECORDS FROM A KEYED FILE13.12. CASE PROBLEM: A FULL UPDATE PROCEDURE13.13. ADDING NEW RECORDS TO A KEYED FILE13.14. UPDATING OR CHANGING EXISTING RECORDS IN A KEYED FILE13.15. DELETING RECORDS FROM A KEYED FILE13.16. UPDATING A KEYED FILE WITH MULTIPLE TRANSACTION RECORDS FOR EACH KEYED RECORD13.17. PROCESSING A KEYED FILE WITHIN LIMITS13.18. THE START STATEMENT13.19. CHECKING FOR THE UPPER LIMIT13.20. ACCESSING A KEYED FILE DYNAMICALLY THE ACCESS IS DYNAMIC CLAUSE13.21. THE READ ... NEXT RECORD INSTRUCTION13.22. A REVIEW OF INVALID KEY CLAUSES13.23. THE FILE STATUS CLAUSE13.24. EXCEPTION HANDLING WITH THE USE STATEMENT13.25. END-OF-CHAPTER AIDS13.25.1. CHAPTER SUMMARY13.25.2. KEY TERMS13.26. CHAPTER SELF-TEST13.26.1. TRUE-OR-FALSE QUESTIONS13.26.2. FILL-IN-THE BLANKS13.27. CHAPTER REVIEW QUESTIONS13.27.1. GENERAL QUESTIONS13.28. DEBUGGING EXERCISES13.29. PRACTICE PROGRAM #113.30. PRACTICE PROGRAM #213.31. PROGRAMMING ASSIGNMENTS
14. INTERACTIVE PROGRAMMING
14.1. CHAPTER OBJECTIVES14.2. BATCH VERSUS INTERACTIVE PROCESSING14.2.1. BATCH PROCESSING14.3. INTERACTIVE PROCESSING14.4. DISPLAY FILES14.5. TYPES OF RECORD FORMATS USED IN DISPLAY FILES14.6. MENU FORMAT14.7. INFORMATIONAL OR QUERY FORMAT14.8. DATA ENTRY FORMAT14.9. List or Work With Format14.10. ELEMENTS OF A RECORD FORMAT14.11. ATTRIBUTES14.12. SETTING ATTRIBUTES WITH THE COLOR KEYWORD14.13. SETTING ATTRIBUTES WITH THE DSPATR KEYWORD14.14. CASE PROBLEM: AN INTERACTIVE QUERY PROGRAM14.14.1. PROBLEM DEFINITION14.15. DEFINING THE DDS FOR A DISPLAY FILE14.16. DEFINING THE FILE-LEVEL KEYWORDS FOR THE DISPLAY FILE14.17. USING INDICATORS IN INTERACTIVE PROGRAMS14.18. DEFINING THE DDS FOR RECORD FORMAT SCREEN114.19. USING COLOR TO DEFINE ATTRIBUTES14.20. DATE KEYWORD14.21. DEFINING THE DDS FOR RECORD FORMAT SCREEN214.22. EDITING NUMERIC FIELDS14.23. EDTCDE KEYWORD14.24. DISPLAYING NEGATIVE VALUES14.25. ZERO SUPPRESSION14.26. DISPLAYING DOLLAR SIGNS14.27. USING EDIT WORDS14.28. CREATING THE DISPLAY FILE OBJECT14.29. THE INTERACTIVE PROGRAM14.30. ESTABLISHING A TRANSACTION FILE14.31. THE ASSIGN CLAUSE14.32. DEFINING INDICATORS IN A SEPARATE INDICATOR AREA14.33. THE CONTROL-AREA CLAUSE14.34. PROCESSING DISPLAY FILE INPUT/OUTPUT (I/O) OPERATIONS14.34.1. WRITE STATEMENT14.35. READ OPERATION14.36. PROCEDURE DIVISION SPECIFICATIONS14.37. TERMINATING A WORKSTN PROGRAM14.38. CASE PROBLEM: AN INTERACTIVE FILE MAINTENANCE14.39. DATA VALIDATION TECHNIQUES FOR DISPLAY FILES14.40. COBOL/400 FILE MAINTANANCE PROGRAM14.41. THE MOVE CORRESPONDING STATEMENT14.42. END-OF-CHAPTER AIDS14.42.1. CHAPTER SUMMARY14.42.2. Key Terms14.43. CHAPTER SELF-TEST14.43.1. TRUE-OR-FALSE QUESTIONS14.43.2. FILL-IN-THE BLANKS14.44. CHAPTER REVIEW QUESTIONS14.44.1. GENERAL QUESTIONS14.44.2. PRACTICE PROGRAM14.45. PROGRAMMING ASSIGNMENTS
15. SINGLE-LEVEL ARRAYS AND TABLES
15.1. CHAPTER OBJECTIVES15.2. AN INTRODUCTION TO SINGLE-LEVEL OCCURS CLAUSES15.2.1. WHY OCCURS CLAUSES ARE USED15.2.2. DEFINING FIELDS WITH AN OCCURS CLAUSE15.2.3. RELATIVE SUBSCRIPTING15.3. USING AN OCCURS CLAUSE IN WORKING-STORAGE15.4. USING LIKE CLAUSE WITH OCCURS CLAUSE15.5. VALIDATING INPUT DATA15.6. RULES FOR USE OF THE OCCURS CLAUSE15.6.1. LEVELS 02–4915.7. DEFINING ELEMENTARY OR GROUP ITEMS WITH AN OCCURS CLAUSE15.8. ACCESSING WORKING-STORAGE AREAS DEFINED BY AN OCCURS CLAUSE15.9. PROCESSING DATA STORED IN AN ARRAY15.9.1. USING OCCURS WITH VALUE AND REDEFINES CLAUSES15.10. PRINTING DATA STORED IN AN ARRAY15.11. PRINTING SUBSCRIPTED VARIABLES IN A VARIETY OF WAYS15.12. USING AN OCCURS CLAUSE FOR TABLE HANDLING15.13. WHY TABLES ARE USED15.14. STORING THE TABLE IN WORKING-STORAGE15.15. USING THE READ ... INTO TO LOAD A TABLE15.16. VALIDATING DATA15.17. LOOKING UP DATA IN A TABLE: FINDING A MATCH15.18. USE OF THE SEARCH STATEMENT FOR TABLE AND ARRAY PROCESSING15.18.1. FORMAT OF THE SEARCH STATEMENT15.19. USING THE SEARCH ... AT END FOR DATA VALIDATION15.20. THE INDEXED BY CLAUSE AND THE SEARCH STATEMENT15.21. HOW AN INDEX DIFFERS FROM A SUBSCRIPT15.22. MODIFYING THE CONTENTS OF AN INDEX15.22.1. THE SET STATEMENT15.22.2. INITIALIZING AN INDEX BEFORE USING THE SEARCH15.23. USING TWO WHEN CLAUSES FOR AN EARLY EXIT FROM A SEARCH15.24. WHEN PART-NUMBERS DO NOT NEED TO BE STORED15.25. SEARCHING FOR MULTIPLE MATCHES15.26. INTERNAL VERSUS EXTERNAL TABLES15.27. LOOKING UP TABLE DATA FOR ACCUMULATING TOTALS15.28. THE SEARCH ... VARYING OPTION FOR PROCESSING PARALLEL TABLES15.29. DEFINITION OF A SERIAL SEARCH15.30. THE BINARY SEARCH15.31. DEFINITION OF A BINARY SEARCH15.32. THE SEARCH ALL STATEMENT15.33. ASCENDING OR DESCENDING KEY WITH THE SEARCH ALL STATEMENT15.34. END-OF-CHAPTER AIDS15.34.1. CHAPTER SUMMARY15.34.2. KEY TERMS15.35. CHAPTER SELF-TEST15.35.1. TRUE-OR-FALSE QUESTIONS15.35.2. FILL-IN-THE-BLANKS QUESTIONS15.36. CHAPTER REVIEW QUESTIONS15.36.1. GENERAL QUESTIONS15.37. DEBUGGING EXERCISES15.38. PRACTICE PROGRAM15.39. PROGRAMMING ASSIGNMENTS
16. MULTIPLE-LEVEL ARRAYS AND TABLES
16.1. CHAPTER OBJECTIVES16.2. DOUBLE-LEVEL OCCURS CLAUSE16.3. DEFINING A DOUBLE-LEVEL, OR TWO-DIMENSIONAL, ARRAY16.4. USING SUBSCRIPTS WITH DOUBLE-LEVEL OCCURS ENTRIES16.5. ACCESSING A DOUBLE-LEVEL, OR TWO-DIMENSIONAL, ARRAY16.6. THE PERFORM ... VARYING WITH THE AFTER OPTION16.7. USING NESTED PERFORMS16.8. USING PERFORM ... VARYING ... AFTER16.9. USING A DOUBLE-LEVEL, OR TWO-DIMENSIONAL, ARRAY FOR ACCUMULATING TOTALS16.10. LOADING INPUT DATA INTO A DOUBLE-LEVEL, OR TWO-DIMENSIONAL, ARRAY16.11. PERFORMING A LOOK-UP USING A DOUBLE-LEVEL OCCURS16.11.1. PERFORMING A FULL TABLE LOOK-UP16.12. THE IDENTIFIER USED WITH THE SEARCH REFERS TO THE LOWEST-LEVEL OCCURS ENTRY16.13. SEARCHING ONLY PART OF A TABLE16.14. VARYING ONLY ONE INDEX16.15. SEARCHING ELEMENTS IN AN ARRAY16.16. SEARCHING AN ARRAY UNTIL A MATCH IS FOUND16.17. SEARCHING AN ENTIRE ARRAY FOR MULTIPLE MATCHES16.18. TRIPLE-LEVEL OCCURS CLAUSES AND MORE16.19. END-OF-CHAPTER AIDS16.19.1. CHAPTER SUMMARY16.19.2. KEY TERMS16.20. CHAPTER SELF-TEST16.20.1. TRUE-OR-FALSE QUESTIONS16.20.2. FILL-IN-THE BLANKS16.20.3. GENERAL QUESTIONS16.21. DEBUGGING EXERCISES16.22. PRACTICE PROGRAM16.23. PROGRAMMING ASSIGNMENTS
17. SUBFILE PROGRAMMING
17.1. CHAPTER OBJECTIVES17.2. LIST SCREEN OR WORK WITH SCREEN17.3. SUBFILE RECORD FORMATS17.4. DESIGNING SCREEN FORMATS FOR AN INTERACTIVE SUBFILE PROGRAM17.5. THE PROMPT RECORD FORMAT-SFLPROMPT17.6. DEFINING SUBFILE RECORD FORMATS17.7. THE SUBFILE RECORD FORMAT—SFLRECORD17.8. THE SUBFILE CONTROL-RECORD FORMAT-SFLCONTROL17.9. LOADING THE SUBFILE17.10. CASE PROBLEM #1—LOAD-ALL SUBFILE17.11. THE LOAD-ALL SUBFILE PROGRAM17.12. ESTABLISHING A SUBFILE TRANSACTION FILE17.13. ACCESS IS DYNAMIC CLAUSE17.14. THE RELATIVE KEY CLAUSE17.15. THE CONTROL-AREA CLAUSE17.16. FILE STATUS CLAUSE17.17. DEFINING INDICATORS AND FUNCTION KEYS IN SEPARATE AREAS17.18. QUALIFICATION OF NAMES17.19. WRITING TO A SUBFILE TRANSACTION FILE17.20. PROCEDURE DIVISION SPECIFICATIONS17.20.1. 100-INITIALIZATION-RTN17.20.2. 200-PROCESS-SCREEN-RECORD-RTN17.20.3. 210-CLEAR-SUBFILE.17.20.4. 220-LOAD-SUBFILE and 225-READ-EMPLOYEE-RECORD-RTN.17.20.5. 230-DISPLAY-SUBFILE.17.20.6. 300-TERMINATION-RTN.17.21. EXPANDING SUBFILE17.22. SINGLE-PAGE-AT-A-TIME SUBFILE17.23. CASE PROBLEM #2: AN INTERACTIVE SUBFILE UPDATE17.24. UPDATING RECORDS IN A SUBFILE17.25. END-OF-CHAPTER AIDS17.25.1. CHAPTER SUMMARY17.25.2. KEY TERMS17.26. CHAPTER SELF-TEST17.26.1. TRUE-OR-FALSE QUESTIONS17.26.2. FILL-IN-THE BLANKS17.27. CHAPTER REVIEW QUESTIONS17.27.1. GENERAL QUESTIONS17.27.2. PRACTICE PROGRAM17.28. PROGRAMMING ASSIGNMENTS
A. THE 5250 KEYBOARD
A.1. THE 5250 KEYBOARDA.1.1. COMMON ENGRAVED KEYSA.1.2. DISTINCT 5250 KEYSA.1.3. USING FUNCTION KEYS
B. COBOL CHARACTER SET AND RESERVED WORDS
B.1. EBCDIC CHARACTER SETB.2. COBOL CHARACTERSB.3. RESERVED WORDSB.4. USING THE APOSTROPHE FOR ALPHANUMERIC LITERALS
C. CRTBNDCBL COMMAND AND PROCESS STATEMENT
C.1. CRTBNDCBL COMMANDC.1.1. OPTION 14 ON WORK WITH MEMBERS USING PDM SCREENC.1.2. PROMPTING THE CRTCBNCBL COMMANDC.1.3. SUBMITTING THE CRTCBNCBL COMMAND FROM THE COMMAND LINEC.1.4. PARAMETERS OF THE CRTCBNCBL COMMANDC.2. PROCESS STATEMENT

Content preview from PROGRAMMING IN COBOL/400: 2nd Edition

Appendix B. COBOL CHARACTER SET AND RESERVED WORDS

EBCDIC CHARACTER SET

EBCDIC, which stands for Extended Binary Coded Decimal Interchange Code and is pronounced eb-ce-dick, is used to represent letters, digits, the character blank, and special characters. The chart shown in Figure B.1 illustrates, in ascending sequence, the EBCDIC collating sequence codes for letters, numbers, and the character blank. In addition, the chart shows the binary representation and hexadecimal codes used by the computer to represent EBCDIC codes.

Figure B.1. EBCDIC codes for letters, numbers, character blank, and corresponding binary and hexadecimal codes.

COBOL CHARACTERS

In COBOL, the primary unit of data is the character. In the COBOL/400 language, the letters of the alphabet, digits, and special characters that form the COBOL character set are represented by a subset of the EBCDIC character set. Figure B.2 shows the complete set of COBOL characters with their meanings and uses.

Figure B.2. COBOL characters with their meanings and uses.

RESERVED WORDS

COBOL/400 incorporates many enhancements that are not incorporated in the ANSI COBOL 85 Standard. Among them are extensions that aid in writing interactive workstation applications as well as support for externally described files.

With these extensions to COBOL/400, ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9780471418467Purchase book

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business