Source code comparator computer program

Claim 2

In a data processing system, a process of comparing a modified version of a program to its base reference program to locate and signify a difference in coding comprising the steps of: a. comparing source codes from both programs until a difference between codes is found; b. testing for next equal comparison in the source codes after the compared source code difference is found; c. locating an alike sequence in both programs; d. testing for noncomparison by working backwards from the alike sequence located; and e. selecting the test that produces the smallest area of change as signifying the differences in coding.

Claim 3

A process according to claim 1 further including the steps of: f. identifying the start and end of the area of difference; g. comparing the area of change in the modified version to the base reference program to determine if the change is a deletion, an addition or a modification; and h. printing the area of change while signifying whether the change is a deletion, an addition or a modification.

Claim 4

identifying the comparison in the area of change;

Claim 5

identifying the comparison in the area of change;

Claim 6

identifying the comparison in the area of change;

Claim 7

identifying the comparison in the area of change;

Claim 8

identifying the comparison in the area of change;

Claim 9

identifying the comparison in the area of change;

Claim 10

marking as deletions all of the statement preceding the identified comparison in the base reference program up to the identified start of the area of change;

Claim 11

marking as deletions all of the statement preceding the identified comparison in the base reference program up to the identified start of the area of change;

Claim 12

marking as deletions all of the statement preceding the identified comparison in the base reference program up to the identified start of the area of change;

Claim 13

marking as deletions all of the statement preceding the identified comparison in the base reference program up to the identified start of the area of change;

Claim 14

marking as deletions all of the statements preceding the identified comparison in the base reference program up to the identified start of the area of change;

Claim 15

marking as deletions all of the statements preceding the identified comparison in the base reference program up to the identified start of the area of change;

Claim 16

A process according to claim 2 wherein step (g) comprises the steps of:

Claim 17

A process according to claim 3 further including the steps of:

Claim 18

marking as additions all of the statements preceding the identified comparison in the modified version program up to the identified start of the area of change; and

Claim 19

marking as additions all of the statements preceding the identified comparison in the modified version program up to the identified start of the area of change; and

Claim 20

marking as additions all of the statements preceding the identified comparison in the modified version program up to the identified start of the area of change; and

Claim 21

marking as additions all of the statements preceding the identified comparison in the modified version program up to the identified start of the area of change; and

Claim 22

marking as additions all of the statements preceding the identified comparison in the modified version program up to the identified start of the area of change; and

Claim 23

marking as additions all of the statements preceding the identified comparison in the modified version program up to the identified start of the area of change; and

Claim 24

marking as a modification the line of coding having the comparison in small section of a line of coding.

Claim 25

marking as a modification the line of coding having the comparison in small section of a line of coding.

Claim 26

A process according to claim 1 further including the steps of: f. identifying the start of the area of change; g. identifying the end of the area of change; h. searching for a comparison in a small section of each line of coding in the area of change; i. identifying the comparison in the area of change; j. marking as deletions all of the statement preceding the identified comparison in the base reference program up to the identified start of the area of change; k. marking as additions all of the sTatements preceding the identified comparison in the modified version program up to the identified start of the area of change; l. marking as a modification the line of coding having the comparison in the small section of a line of coding; m. printing the area of change and signifying whether the change is deletion, addition or modification; and n. continuing searching for more comparisons in a small section of each line of coding in the area of change by performing the steps of (h), (i), (j), (k), (l) and (m) using the identified comparison as the start of the area of change until the end of the area of change is reached.

Claim 27

marking as a modification the line of coding having the comparison in the small section of a line of coding.

Claim 28

marking as a modification the line of coding having the comparison in the small section of a line of coding.

Claim 29

marking as a modification the line of coding having the comparison in the small section of a line of coding.

Claim 30

marking as a modification the line of coding having the comparison in the small section of a line of coding.

Claim 31

repeating the steps of (1), (2), (3), (4) and (5) to search for more comparisons in a small section of each line of coding in the area of change, using the identified comparison as the start of the area of change; and

Claim 32

repeating the steps of (1), (2), (3), (4) and (5) to search for more comparisons in a small section of each line of coding in the area of change, using the identified comparison as the start of the area of change; and

Claim 33

repeating the steps of (1), (2), (3), (4) and (5) to search for more comparisons in a small section of each line of coding in the area of change, using the identified comparison as the start of the area of change; and

Claim 34

repeating the steps of (1), (2), (3), (4) and (5) to search for more comparisons in a small section of each line of coding in the area of change, using the identified comparison as the start of the area of change; and

Claim 35

In a data processing system, a process comprising the steps of: a. setting up parameters defining a program module that is to have its base reference program module compared to a modified version of the program module; b. locating said base module; c. transferring the source code from said located base module into a first working buffer register; d. locating said modified version module; e. transferring the source code from said located modified version module into a second working buffer register; f. comparing the source codes from the first working buffer register to the source codes from the second buffer register until a difference between the codes is located; g. testing for a next equal comparison of lines of source codes between said first and said second working buffers; h. locating an alike sequence in both programs after said coding differences; i. testing for a noncomparison between said first register and said register by working backwards from said located alike sequence; j. comparing the results of said tests; and k. selecting the test results that defines the smallest area of change as signifying a difference in coding between the base reference and modified version program module.

Claim 36

In a data processing system, a process comprising the steps of: a. setting up parameters defining a program module that is to have its base reference program module compared to a modified version of the program module; b. locating said base module; c. transferring the source code from said located base module into a first working buffer register; d. locating said modified version module; e. transferring the source code from said located modified version module into a second working buffer register; f. comparing the source codes from the first working buffer register to the source codes from the second buffer register until a difference between the codes is located; g. testing for a next equal comparison of lines of source codes between said first and said second working buffers; h. locating an alike sequence in both programs after said coding differences; i. testing for a noncomparison between said first register and said register by working backwards from said located alike sequence; j. comparing the results of said tests; and k. selecting the test results that defines the smallest area of change as signifying a difference in coding between the base reference and modified version program module.

Claim 37

A process according to claim 6 further including the steps of: l. setting pointers identifying the start and end of the area of difference; m. comparing the area of change in the modified version to the base reference program to determine if the change is a deletion, an addition or a modification; and n. printing the area of change while signifying whether the change is a deletion, an addition or a modification.

Claim 38

repeating step (6) until the end of the area of change is reached.

Claim 39

repeating step (6) until the end of the area of change is reached.

Claim 40

repeating step (6) until the end of the area of change is reached.

Claim 41

repeating step (6) until the end of the area of change is reached.

Claim 42

A process according to claim 8 wherein step (m) comprises the steps of:

Claim 43

A process according to claim 8 further including the steps of:

Claim 44

In a data processing system, a process of comparing a modified version of a program to its base reference program to locate and signify the differences in coding comprising the steps of: a. transferring the source code of the base reference program from a base module into a first working buffer; b. transferring the source code of the modified version program from a modified version module into a second working buffer register; c. comparing a shortened section of a next line from the first buffer register to a similar sIze section of a same line in the second buffer register; d. going to step (e) if no comparison is found, otherwise returning to step (c); e. moving the noncomparing lines to the top of their respective working buffer; f. refilling the working buffers with the subsequent data from the base reference module and the modified version module; g. advancing the second buffer register to look at the next line; h. going to step (i) if an increased word length comparison is not found, otherwise going to step (o); i. going to step (j) if an end of buffer is located, otherwise returning to step (g); j. advancing by one line the line being compared in the first buffer register; k. going to step (1) if the end of the first buffer register is signalled, otherwise returning to step (h); l. refilling the first buffer register with source codes from the base register module; m. refilling the second buffer register from the source codes of the modified version of the program; n. returning to step (c); o. rechecking the full characters of one line for a comparison; p. going to step (q) if a comparison is found, otherwise returning to step (i); q. checking the next full line character comparison of the first working buffer register to the next full line character of the second working buffer register; r. going to step (s) if the next full line of both buffer registers compare, otherwise returning to step (i); s. saving the number of noncomparing lines from the first working buffer register and the second working buffer register; t. searching for identical symbolic addresses in both the base reference module and the modified version module; u. checking for a comparison between the line preceding a like symbol in the first working buffer register to the line preceding the like symbol found in the second working buffer register; v. going to step (w) if preceding lines compare, otherwise going to step (y); w. comparing the next preceding line in the first register to the next preceding line in the second buffer register; x. returning to step (w) if the preceding lines compare, otherwise going to step (y); y. calculating the total lines of change found in the comparison according to steps (g) through (s) and (u) through (w); z. comparing the results of the different comparison methods; aa. setting pointers identifying the beginning and end of the noncomparing portions of the first and second buffer register based on the comparison having the least change; bb. determining if the noncomparing portion is a deletion, an addition or a modification; and cc. printing the results of the process.

Claim 45

In a data processing system, a process of comparing a modified version of a program to its base reference program to locate and signify the differences in coding comprising the steps of: a. transferring the source code of the base reference program from a base module into a first working buffer; b. transferring the source code of the modified version program from a modified version module into a second working buffer register; c. comparing a shortened section of a next line from the first buffer register to a similar sIze section of a same line in the second buffer register; d. going to step (e) if no comparison is found, otherwise returning to step (c); e. moving the noncomparing lines to the top of their respective working buffer; f. refilling the working buffers with the subsequent data from the base reference module and the modified version module; g. advancing the second buffer register to look at the next line; h. going to step (i) if an increased word length comparison is not found, otherwise going to step (o); i. going to step (j) if an end of buffer is located, otherwise returning to step (g); j. advancing by one line the line being compared in the first buffer register; k. going to step (1) if the end of the first buffer register is signalled, otherwise returning to step (h); l. refilling the first buffer register with source codes from the base register module; m. refilling the second buffer register from the source codes of the modified version of the program; n. returning to step (c); o. rechecking the full characters of one line for a comparison; p. going to step (q) if a comparison is found, otherwise returning to step (i); q. checking the next full line character comparison of the first working buffer register to the next full line character of the second working buffer register; r. going to step (s) if the next full line of both buffer registers compare, otherwise returning to step (i); s. saving the number of noncomparing lines from the first working buffer register and the second working buffer register; t. searching for identical symbolic addresses in both the base reference module and the modified version module; u. checking for a comparison between the line preceding a like symbol in the first working buffer register to the line preceding the like symbol found in the second working buffer register; v. going to step (w) if preceding lines compare, otherwise going to step (y); w. comparing the next preceding line in the first register to the next preceding line in the second buffer register; x. returning to step (w) if the preceding lines compare, otherwise going to step (y); y. calculating the total lines of change found in the comparison according to steps (g) through (s) and (u) through (w); z. comparing the results of the different comparison methods; aa. setting pointers identifying the beginning and end of the noncomparing portions of the first and second buffer register based on the comparison having the least change; bb. determining if the noncomparing portion is a deletion, an addition or a modification; and cc. printing the results of the process.

Claim 46

A process according to claim 10 wherein step (bb) comprises the steps of: