KR100229567B1 - Coordination and text value generation method - Google Patents

Abstract

The present invention relates to a method for automatically generating coordinate values and text values required for coding when a system programmer writes a program by applying an overlay concept. The present invention, the step of inputting the input file and the output file name to output the result (S1); Finding a row in the input file to start searching (S2); Reading one character from a designated input file (S3); Checking whether the end of the column (S4); A step (S5) of checking whether a character read is a space unless the end of the check result column in the step (S4); Increasing the row by one row if it is the end of the check result column (S6) in step S4; Checking whether the character read immediately before the space is a space as a result of the check in step S5 (S7); Step S8 of performing the step S3 if the result of the check in step S7 is a space; A step S9 of checking whether a space is a special character if it is not a space in the step S7; Outputting a row, a column, and a special character to an output file if the special character is a result of the check in step S9; Outputting a character string "word_" after a row or a column and a normal string stored in the buffer to the output file if it is not a special character as a result of the checking in the step S9; A step S12 of checking whether a space is a special character if it is not a result of the check in step S5; Checking whether the character read immediately before is a space if the special character is checked in the step S12 (S13); Outputting a row, a column, and a special character to an output file if the result of the check in step S13 is a space; Outputting a string "word_" followed by a row and a column and a string, a row, a column, and a special character stored in the buffer during the step (S15) if the result of the check is not a space; Adding the newly read one character to the end of the string stored in the buffer if it is not a special character as a result of the checking in the step S12; Performing a step (S6) and then examining the contents of the next line (S17); Checking whether the row is 25 rows or less after performing the step (S17) (S18); If the result of the check in step S18 is 25 rows or less, readjusting the row to the start row and then performing step S3; If the result of the check in step A18 is 25 or more lines, the step S20 includes adding “0, 0, word_null” to the output file.

Description

How to create coordinate and text values when overlay coding

The present invention relates to a method for automatically generating coordinate values and text values required for coding when a system programmer writes a program by applying an overlay concept.

In general, the term overlay in the computer field refers to a program that sprinkles the information one by one on the screen when the user tries to obtain specific information of the system on the CRT screen. Therefore, conventionally, when a programmer writes a program based on the above-described overlay concept, text is manually coded one by one on the screen. This is a factor that significantly reduces the efficiency of coding.

Paging system is taken as an example to explain the problem that occurs in the system program task to which the overlay concept is applied.

One of the programs in the paging system that uses the concept of overlays is the command task. The command task refers to an administration task for synchronizing synchronization between a master board and a slave board.

1 is a diagram illustrating a state in which a memory area of a RAM is divided into various areas such as a work area, a task area, a text table area, and an overlay area. 2 is a view showing the state of a ROM and an HDD divided into several overlay areas such as A, B, C, and D. FIG.

Among the command tasks are CRT tasks. In the RAM having a plurality of areas as shown in FIG. 1, the CRT task reads a specific overlay corresponding to the screen selected by the operator from the ROM or the hard disk of FIG. 2 in order for the operator to use the overlay area. At this time, the operator uses only one type of overlay for a predetermined time among the above-mentioned overlays. So we select only the overlays we need and load them into RAM.

If there are four types of overlays in ROM, A, B, C, and D, there are texts used in each overlay. If these characters are called Atxt, Btxt, Ctxt, and Dtxt, respectively, the text table of FIG. 1 also performs Atxt ∪ Btxt ∪ Ctxt ∪ Dtxt to save memory so that the text is not duplicated and stored more than once. Atxt is the set of texts used in the A overlay.

Therefore, the programmer inevitably asks 'Are you sure?' In order to code to display the message, you have to write the coordinate value and the character value one by one. 3 shows an example of overlay coding in this case. Figure 3a shows the first position of each word in the message 'Are you sure?' 3B is an example of overlay coding. 4 is an enlarged view of FIG. 3B.

'23, 3, word_Are 'in FIG. 3B means that the position of' A ', which is the first letter of the word' Are ', is 23rd row and 3rd column. That is, the first '23, 3 'represents the coordinate value of the letter' A ', and the second' word_Are 'represents the text value.

However, the problem that arises from this is that it takes a lot of time to calculate and specify the coordinates when coding, and it causes a lot of errors due to missing a comma when compiling. In addition, after compiling and linking and downloading and executing the memory board in the system, the screen output is different from what was expected, and it has to be re-modified many times.

Therefore, the present invention is designed to solve the problems as described above, and when coding the overlay program, the programmer avoids coding by hand while checking the coordinate values one by one by hand, and to some extent by using an auxiliary program. Its purpose is to provide a way to automatically resolve it. That is, an object of the present invention is to reduce the simple work time as described above, and to minimize the error to maximize the efficiency of overlay coding. After completing the coding work, compile and link, download and execute the memory board in the system, and provide a way to reduce the number of times the coding needs to be modified if the screen output is not as expected.

1 is a diagram illustrating a memory allocation state of a RAM;

Fig. 2 shows the memory allocation status of the ROM and the HDD.

3 is an example of overlay coding

4 is an enlarged view of FIG. 3.

5 is another example of overlay coding

6 is a flowchart illustrating a method of generating coordinate values and text values when overlay coding according to the present invention.

7 is an example of the use of the output content

8 is an example of use of the tool according to the present invention.

9 is an example of an annotation portion according to the present invention

The present invention for achieving the above object, the step of inputting the input file and the output file name to output the result (S1); Finding a row in the input file to start searching (S2); Reading one character from a designated input file (S3); Checking whether the end of the column (S4); A step (S5) of checking whether a character read is a space unless the end of the check result column in the step (S4); Increasing the row by one row if it is the end of the check result column (S6) in step S4; Checking whether the character read immediately before the space is a space as a result of the check in step S5 (S7); Step S8 of performing the step S3 if the result of the check in step S7 is a space; A step S9 of checking whether a space is a special character if it is not a space in the step S7; Outputting a row, a column, and a special character to an output file if the special character is a result of the check in step S9; Outputting a character string "word_" after a row or a column and a normal string stored in the buffer to the output file if it is not a special character as a result of the checking in the step S9; A step S12 of checking whether a space is a special character if it is not a result of the check in step S5; Checking whether the character read immediately before is a space if the special character is checked in the step S12 (S13); Outputting a row, a column, and a special character to an output file if the result of the check in step S13 is a space; Outputting a string "word_" followed by a row and a column and a string, a row, a column, and a special character stored in the buffer during the step (S15) if the result of the check is not a space; Adding the newly read one character to the end of the string stored in the buffer if it is not a special character as a result of the checking in the step S12; Performing a step (S6) and then examining the contents of the next line (S17); Checking whether the row is 25 rows or less after performing the step (S17) (S18); If the result of the check in step S18 is 25 rows or less, readjusting the row to the start row and then performing step S3; If the result of the check in step A18 is 25 or more lines, the step S20 includes adding “0, 0, word_null” to the output file.

In the present invention, when the overlay program is coded, coordinates and text values as shown in FIG. 3 are automatically generated to enable more efficient coding.

5 is a diagram illustrating an annotation unit and a coding unit in overlay coding. In this case, if the comment portion is made into an input file, the program is processed in the flow as shown in FIG. 6 to create an output file. 7 is a diagram illustrating a method of using an output when a programmer codes, and FIG. 8 is a diagram illustrating a method of using a tool of the present invention. 9 is a view showing an example of the annotation unit according to the present invention.

Hereinafter, the operation principle of the present invention will be described in more detail with reference to FIG. 6.

[Step 1] Enter the input file name and the output file name.

[Step 2] Find the line in the input file to start searching. As shown in b of FIG. 3, when a slash (/) is followed by a '*' and a number follows, it is recognized as a row and stored in the global variable row.

[Step 3] Read 1 character from the designated input file.

[Step 4] Make sure you are at the end of the column.

[Step 5] If the result of the check in Step 4 is not the end of the string, it is checked whether one character read is a space.

[Step 6] If the check result is the end of the column in step 4, the row is increased by one row.

[Step 7] If the result of the check in step 5 is a space, it is checked whether the character read immediately before is also a space.

[Step 8] If the result of the check in step 7 is a space, the process (S3) is performed.

[Step 9] If the result of the check in step 7 is not a space, it is checked whether it is a special character.

[Step 10] If the result of the check in Step 9 is a special character, a line, a column, and a special character are output to the output file.

[Step 11] If the result of the check in Step 9 is not a special character, the string "word_" after the line and column and the normal string stored in the buffer are output to the output file.

[Step 12] If the result of the check in Step 5 is not a space, it is checked whether it is a special character.

[Step 13] If the result of the check in step 12 is a special character, it is checked whether the character immediately read is a space.

[Step 14] If the result of the check in step 13 is a space, the rows, columns, and special characters are output to the output file.

[Step 15] If the result of the check in step 13 is not a space, the string "word_" is followed by a row and a column, followed by a string, a row, a column, and a special character stored in the buffer.

[Step 16] If the result of the check in Step 12 is not a special character, the newly read one character is added to the end of the string stored in the buffer.

[Step 17] After performing Step 6, examine the contents of the next line.

[Step 18] After performing step 17, it is checked whether the row is 25 rows or less.

[Step 19] If the result of the check in step 18 is 25 rows or less, step 3 is performed after the row is readjusted to the start row.

[Step 20] If the result of the check in Step 18 is 25 or more lines, "0, 0, word_null" is added to the output file.

The tool of the present invention can be used as in FIG. In FIG. 8, the first a.out denotes a case of creating an output file by default, and is a command for changing the name to a desired name and making it available.

8, which is the second item in FIG. 8, indicates the type of the annotation portion. When the annotation portion is equal to FIG. 3, 2 is used.

The last item of FIG. 8, / 1, indicates how many pairs of coordinate values and text values as shown in FIG. 4 are output in one output line.

For example, when the command is issued as shown in FIG. 9, a prompt of “Source File Name” appears, and then the input file name in which the comment part of the part to be converted is copied after the prompt is written. Next, when the prompt "Destination File Name" is displayed, in this case, also enter the output file name after which the output is desired. Put the output file into your own overlay coding and edit and use it as you wish (see Figure 7).

As described above, the present invention shortens the time required for calculating and assigning coordinates to array variables, greatly reduces errors in compilation, and wastes time and power in simple tasks such as specifying coordinates. Productivity is improved by improving the difficulty of working. And even if you have items to add later, you can easily create coordinates and upgrade. That is, the method of the present invention makes the overlay coding efficient.

Claims (1)

Inputting an input file and an output file name for outputting a result (S1); Finding a row in the input file to start searching (S2); Reading one character from a designated input file (S3); Checking whether the end of the column (S4); A step (S5) of checking whether a character read is a space unless the end of the check result column in the step (S4); Increasing the row by one row if it is the end of the check result column (S6) in step S4; Checking whether the character read immediately before the space is a space as a result of the check in step S5 (S7); Step S8 of performing the step S3 if the result of the check in step S7 is a space; A step S9 of checking whether a space is a special character if it is not a space in the step S7; Outputting a row, a column, and a special character to an output file if the special character is a result of the check in step S9; Outputting a character string "word_" after a row or a column and a normal string stored in the buffer to the output file if it is not a special character as a result of the checking in the step S9; A step S12 of checking whether a space is a special character if it is not a result of the check in step S5; Checking whether the character read immediately before is a space if the special character is checked in the step S12 (S13); Outputting a row, a column, and a special character to an output file if the result of the check in step S13 is a space; Outputting a string "word_" followed by a row and a column and a string, a row, a column, and a special character stored in the buffer during the step (S15) if the result of the check is not a space; Adding the newly read one character to the end of the string stored in the buffer if it is not a special character as a result of the checking in the step S12; Performing a step (S6) and then examining the contents of the next line (S17); Checking whether the row is 25 rows or less after performing the step (S17) (S18); If the result of the check in step S18 is 25 rows or less, readjusting the row to the start row and then performing step S3; And if the result of the check in step A18 is 25 or more lines, adding (0, 0, word_null) to the output file (S20).

Images