Patent US5201050A successfully refreshed from Google Patents.
US5201050A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Line-skip compiler for source-code development system
Assignee: Hewlett Packard Development Co LP
•
Filing: 1989-06-30
•
Granted: 1993-04-06
•
Expires: 2009-06-30
Abstract
Abstract A computer-aided software development system includes programs to implement edit, compile, link and run sequences, all from memory, at very high speed. The compiler operates on an incremental basis, line-by-line, so if only one line is changed in an edit session, then only that line need be recompiled if no other code is affected. Scanning is done incrementally, and the resulting token list saved in memory to be used again where no changes are made. All of the linking tables are saved in memory so there is no need to generate link tables for increments of code where no changes in links are needed. The parser is able to skip lines or blocks of lines of source code which haven't been changed; for this purpose, each line of source text in the editor has a change-tag to indicate whether this line has been changed, and from this change-tag information a descriptor table is built having a clean-lines indication for each line of source code, indicating how many clean lines follow the present line. All of the source code text modules, the token lists, symbol tables, code tables and related data saved from one compile to another are maintained in virtual memory rather than in files so that speed of operation is enhanced. Also, the object code created is maintained in memory rather than in a file, and executed from this memory image, to reduce delays. A virtual memory management arrangement for the system assures that all of the needed data modules and code is present in real memory by page swapping, but with a minimum of page faults, again to enhance operating speed.
Inventors
- 👤 William M. McKeeman
- 👤 Shota Aki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 07:47
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F8/48; G06F8/70; G06F8/71
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
196 words
A method of editing source text and recompiling said source text to produce code, said source text having been previously compiled to create a code table, comprising the steps of: a) editing a module of said source text to change some lines of said source text and leave some lines unchanged, said source text being stored in a source-text buffer as a plurality of lines, said lines having an identification in said buffer as changed or not changed; b) recompiling said source text to recreate said code table, said recompiling including: i) scanning said lines of source text in said source text buffer, and, in response to said identification, finding lines of said source text which have been changed, and, skipping any of the lines of source text which have not been changed during said step of editing, said skipping including determining if any increments of lines of said source text in sequence have not been changed and if so skipping said increments in said scanning; and ii) generating code for recreating said code table using lines of said source text not skipped in said scanning, said code table remaining unchanged for lines which are skipped.
Claim 2
Independent Claim
196 words
A method of editing source text and recompiling said source text to produce code, said source text having been previously compiled to create a code table, comprising the steps of: a) editing a module of said source text to change some lines of said source text and leave some lines unchanged, said source text being stored in a source-text buffer as a plurality of lines, said lines having an identification in said buffer as changed or not changed; b) recompiling said source text to recreate said code table, said recompiling including: i) scanning said lines of source text in said source text buffer, and, in response to said identification, finding lines of said source text which have been changed, and, skipping any of the lines of source text which have not been changed during said step of editing, said skipping including determining if any increments of lines of said source text in sequence have not been changed and if so skipping said increments in said scanning; and ii) generating code for recreating said code table using lines of said source text not skipped in said scanning, said code table remaining unchanged for lines which are skipped.
Claim 3
Dependent Claim
37 words
A method according to claim 1 wherein said step of editing includes creating for each line in said source-text buffer an associated change-tag to provide said identification of whether the line of source text has been changed.
Claim 4
Dependent Claim
50 words
A method according to claim 1 wherein said step of compiling includes the step of generating a descriptor table including, for each line of said source text, a table entry having a locator for said each line and an indication of the number of clean lines following said each line.
Claim 5
Dependent Claim
43 words
A method according to claim 3 wherein said step of scanning includes the step of checking said descriptor table to see if the number of clean lines is greater than the number of lines of said increment of said source text being scanned.
Claim 6
Independent Claim
250 words
A method of executing an edit-compile-link-run cycle on a plurality of modules of source text for producing object code, said modules of source text having previously been compiled to create a plurality of code tables, one code table for each module of source text, and said code tables having been previously linked to create a link table, comprising the steps of: a) editing one of said modules of source text, said source text of said module being stored in a source-text buffer as a plurality of lines, said lines having an identification in said buffer as changed or not changed by said editing; b) recompiling said source-text buffer to update said code table for said one of said modules; c) relinking said code tables to update said link table; d) running code from said code tables and said link table; said step of recompiling including: i) scanning said lines of source text in said source text buffer, and, in response to said identification, finding lines of said source text which have been changed, and, skipping any of the lines of source text which have not been changed during said step of editing, said skipping including determining if any increments of lines of said source text in sequence have not been changed and if so skipping said increments in said scanning; and ii) generating code for updating said code table using lines of said source text not skipped in said scanning said code table remaining unchanged for lines which are skipped.
Claim 7
Independent Claim
250 words
A method of executing an edit-compile-link-run cycle on a plurality of modules of source text for producing object code, said modules of source text having previously been compiled to create a plurality of code tables, one code table for each module of source text, and said code tables having been previously linked to create a link table, comprising the steps of: a) editing one of said modules of source text, said source text of said module being stored in a source-text buffer as a plurality of lines, said lines having an identification in said buffer as changed or not changed by said editing; b) recompiling said source-text buffer to update said code table for said one of said modules; c) relinking said code tables to update said link table; d) running code from said code tables and said link table; said step of recompiling including: i) scanning said lines of source text in said source text buffer, and, in response to said identification, finding lines of said source text which have been changed, and, skipping any of the lines of source text which have not been changed during said step of editing, said skipping including determining if any increments of lines of said source text in sequence have not been changed and if so skipping said increments in said scanning; and ii) generating code for updating said code table using lines of said source text not skipped in said scanning said code table remaining unchanged for lines which are skipped.
Claim 8
Dependent Claim
37 words
A method according to claim 5 wherein said step of editing includes creating for each line in said source-text buffer an associated change-tag to provide said identification of whether the line of source text has been changed.
Claim 9
Dependent Claim
55 words
A method according to claim 6 wherein said step of recompiling includes the step of generating a descriptor table including, for each line of said source text, a table entry having a locator for said each line and having an indication of the number of clean lines following said each line derived from said change-tags.
Claim 10
Dependent Claim
39 words
A method according to claim 7 wherein said step of recompiling includes the step of checking said descriptor table to see if the number of clean lines is greater than the number of lines of one of said increments.
Claim 11
Dependent Claim
35 words
A method according to claim 5 wherein each of said steps of recompiling, relinking and running is halted to return an error indication if an error is detected, without completing the sequence of said steps.
Claim 12
Independent Claim
284 words
A method of executing an edit-compile-link-run cycle on a plurality of modules of source text, for producing object code, said plurality of modules having been previously compiled to create a plurality of code tables, one code table for each source-text buffer, and said code tables having been previously linked to create a link table, comprising the steps of: a) editing at least one of said plurality of modules of source text, said source text for each module being stored in one of a plurality of separate source-text buffers as a plurality of lines, each line having an identification of whether or not said line has been changed in said editing; b) recompiling the contents of said at least one of said source-text buffers to update said plurality of code tables; c) relinking said code tables to update said link table; d) running the code contained in said code tables and said link table; said step of recompiling including, for each of said at least one of said source-text buffers: i) scanning said lines of source text in said source text buffer, and, in response to said identification, finding lines of said source text which have been changed, and, skipping any of the lines of source text which have not been changed during said step of editing, said skipping including determining if an increment of lines of said source text in sequence have not been changed and if so skipping said increment in said scanning; and ii) generating code for updating said code table, for said at least one of said source text buffers, using lines of said source text not skipped in said scanning, said code table remaining unchanged for lines which are skipped.
Claim 13
Independent Claim
284 words
A method of executing an edit-compile-link-run cycle on a plurality of modules of source text, for producing object code, said plurality of modules having been previously compiled to create a plurality of code tables, one code table for each source-text buffer, and said code tables having been previously linked to create a link table, comprising the steps of: a) editing at least one of said plurality of modules of source text, said source text for each module being stored in one of a plurality of separate source-text buffers as a plurality of lines, each line having an identification of whether or not said line has been changed in said editing; b) recompiling the contents of said at least one of said source-text buffers to update said plurality of code tables; c) relinking said code tables to update said link table; d) running the code contained in said code tables and said link table; said step of recompiling including, for each of said at least one of said source-text buffers: i) scanning said lines of source text in said source text buffer, and, in response to said identification, finding lines of said source text which have been changed, and, skipping any of the lines of source text which have not been changed during said step of editing, said skipping including determining if an increment of lines of said source text in sequence have not been changed and if so skipping said increment in said scanning; and ii) generating code for updating said code table, for said at least one of said source text buffers, using lines of said source text not skipped in said scanning, said code table remaining unchanged for lines which are skipped.
Claim 14
Dependent Claim
55 words
A method according to claim 10 wherein said step of recompiling includes, for each one of said source-text buffers, the step of generating a descriptor table including for each line of said source text a table entry having a locator for said line and an indication of the number of clean lines following said line.
Claim 15
Dependent Claim
37 words
A method according to claim 11 wherein said step of recompiling includes the step of checking said descriptor table to see if the number of clean lines is greater than the number of lines of an increment.
Claim 16
Dependent Claim
35 words
A method according to claim 10 wherein each of said steps of recompiling, relinking and running is halted to return an error indication if an error is detected, without completing the sequence of said steps.
Claim 17
Dependent Claim
43 words
A method according to claim 10 wherein said step of recompiling includes, for each one of said source-text buffers, creating a symbol table for declarative statements in said source text, each entry in the symbol table corresponding to one of said declarative statements.
Claim 18
Dependent Claim
25 words
A method according to claim 10 wherein said source-text buffers, said code tables, and said link table, are all maintained in memory by a processor.
Claim 19
Dependent Claim
34 words
A method according to claim 10 wherein said plurality of separate source-text buffers, said plurality of code tables, are all saved after said step of running and reused after another said step of editing.
Claim 20
Independent Claim
201 words
A system for use in editing and recompiling source text to produce code, said source text having been previously compiled to produce a code table, comprising: a) means for editing a module of said source text and storing said source text in a source-text buffer as a plurality of lines, each line having an identification in said buffer of whether the line was changed or not changed by said editing; b) means for recompiling said source-text contained in said buffer to update said code table; said means for recompiling including means, responsive to said identification, for scanning said lines of source text in said source text buffer to find lines of said source text which have not been changed, and, to skip any of the lines of source text which have not been changed during said editing, said means for scanning including means for determining if an increment of lines of said source text in sequence have not been changed and if so for skipping said increment in said scanning; and means for generating code for updating said code table using lines of said source text not skipped in said scanning, said code table remaining unchanged for lines which are skipped.
Claim 21
Independent Claim
201 words
A system for use in editing and recompiling source text to produce code, said source text having been previously compiled to produce a code table, comprising: a) means for editing a module of said source text and storing said source text in a source-text buffer as a plurality of lines, each line having an identification in said buffer of whether the line was changed or not changed by said editing; b) means for recompiling said source-text contained in said buffer to update said code table; said means for recompiling including means, responsive to said identification, for scanning said lines of source text in said source text buffer to find lines of said source text which have not been changed, and, to skip any of the lines of source text which have not been changed during said editing, said means for scanning including means for determining if an increment of lines of said source text in sequence have not been changed and if so for skipping said increment in said scanning; and means for generating code for updating said code table using lines of said source text not skipped in said scanning, said code table remaining unchanged for lines which are skipped.
Claim 22
Dependent Claim
57 words
A system according to claim 17 wherein said means for recompiling includes means for generating a descriptor table including for each line of said source text a table entry having a locator for said line and having an indication of the number of clean lines following said line, said means for scanning being responsive to said indication.
Claim 23
Dependent Claim
40 words
A system according to claim 18 wherein said means for recompiling includes means for checking said descriptor table to see if the number of clean lines in a table entry is greater than the number of lines of an increment.
Claim 24
Dependent Claim
27 words
A system according to claim 17 wherein said means for recompiling includes means for halting execution to return an error indication immediately if an error is detected.
Claim 25
Dependent Claim
38 words
A system according to claim 17 wherein said means for recompiling includes means for creating a symbol table for declarative statements in said source text, each entry in the symbol table corresponding to one of said declarative statements.
References Cited (Backward Citations)
US4204253A
Cited
US4463423A
Cited
US4589068A
Cited
US4558413A
Cited
US4720778A
Cited
US4686623A
Cited
US4833606A
Cited
US4819233A
Cited
US4809170A
Cited
US4951192A
Cited
US5065400A
Cited
US4931928A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-04-05 | 1996-10-05 | 1997-04-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-04-05 | 2000-10-05 | 2001-04-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-04-05 | 2004-10-05 | 2005-04-06 | $7700.00 | Window Closed / Lapsed |