US5170465A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Incremental-scanning compiler for source-code development system
Assignee: Hewlett Packard Development Co LP
•
Filing: 1989-06-30
•
Granted: 1992-12-08
•
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, generating a sequential token list which is saved in memory to be used again where no changes are made; increments of the sequential token list are reused when no changes have been made in the increments and related statements. All of the linking tables are also 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. All of the source code text modules, the sequential 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-11-02 16:46
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/20; G06F8/40; G06F8/41; G06F8/48; G06F8/70; G06F8/71
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
332 words
In a method of generating source code "in a computer system," including creating and editing a module of source code and storing said module in a source-text buffer as a plurality of lines, compiling the module of source code from said buffer to produce a code table, linking said code table to produce a link table, said code table and said link table providing an executable object code image, and executing said code image to determine if there are errors in said module of source code, the steps of: a) re-editing said module of source code text, the re-edited source code being again stored in said source-text buffer as a plurality of lines, some of said lines being changed by said re-editing and some of said lines remaining the same; b) recompiling the re-edited said source code in said source-text buffer to produce an updated code table; c) relinking said updated code table to produce an updated link table, said updated code table and said updated link table providing an updated executable code image; d) executing said updated code image to determine if there are errors in said module of source code; said step of compiling including scanning lines of said source text to generate a table of lexical increments of said module of source code, and saving said lexical increment table in memory; said step of compiling also including generating code for said code table for each of said lexical increments of said table; said step of recompiling including rescanning only said lines of said module of source code which have been changed by said step of re-editing to update said table of lexical increments with lexical increments which have been changed and skipping lexical increments for which corresponding lexical increments have been saved from said step of scanning and related source text lines have not been changed by said re-editing; said step of recompiling also including generating code for said code table for said lexical increments which have been changed.
Claim 2
Dependent Claim
332 words
In a method of generating source code "in a computer system," including creating and editing a module of source code and storing said module in a source-text buffer as a plurality of lines, compiling the module of source code from said buffer to produce a code table, linking said code table to produce a link table, said code table and said link table providing an executable object code image, and executing said code image to determine if there are errors in said module of source code, the steps of: a) re-editing said module of source code text, the re-edited source code being again stored in said source-text buffer as a plurality of lines, some of said lines being changed by said re-editing and some of said lines remaining the same; b) recompiling the re-edited said source code in said source-text buffer to produce an updated code table; c) relinking said updated code table to produce an updated link table, said updated code table and said updated link table providing an updated executable code image; d) executing said updated code image to determine if there are errors in said module of source code; said step of compiling including scanning lines of said source text to generate a table of lexical increments of said module of source code, and saving said lexical increment table in memory; said step of compiling also including generating code for said code table for each of said lexical increments of said table; said step of recompiling including rescanning only said lines of said module of source code which have been changed by said step of re-editing to update said table of lexical increments with lexical increments which have been changed and skipping lexical increments for which corresponding lexical increments have been saved from said step of scanning and related source text lines have not been changed by said re-editing; said step of recompiling also including generating code for said code table for said lexical increments which have been changed.
Claim 3
Dependent Claim
54 words
In a method according to claim 1, including the steps of creating and holding in memory rather than in files said source-text buffer, said code table, said updated code table, said link table, said updated link table, and said table of lexical increments, in said steps of creating, compiling, linking, re-editing, recompiling and relinking.
Claim 4
Dependent Claim
40 words
In a method according to claim 1, each line of said source-text buffer having an associated change-tag to indicate whether or not said line has been changed in said step of re-editing, and said skipping includes reference to said change-tag.
Claim 5
Dependent Claim
29 words
A method according to claim 1 including the step of maintaining in virtual memory said source-text buffer, said code table, said link table and said table of lexical increments.
Claim 6
Independent Claim
323 words
A method of generating source code in a computer system, comprising the steps of: a) editing a module of source text using an editor, said source text of said module being stored in a source-text buffer as a plurality of lines; b) compiling said source text from said source-text buffer to produce a code table in memory; c) linking said code table to produce a link table in a buffer in memory; said code table and said link table providing an executable object code image in memory; d) executing said code image from memory to detect errors in said source code; e) re-editing said module of source text using an editor, and again storing re-edited source text in said source-text buffer as a plurality of lines; f) recompiling said source text from said source-text buffer to update said code table in memory; g) relinking the updated code table to update said link table in a buffer in memory; said updated code table and said updated link table providing an updated executable object code image in memory; h) executing said updated code image from memory to detect errors in said source code; said step of compiling including scanning lines of said source text to generate a table of lexical increments of said source text, said module containing a plurality of said lexical increments, and saving said lexical increment table in memory; said step of compiling also including generating code for said code table for each of said lexical increments of said table; said step of recompiling including rescanning said source text, said rescanning including "updating said table of lexical increments," skipping lexical increments for which corresponding lexical increments have been saved from said step of scanning and related source text lines have not been changed in said step of re-editing; said step of recompiling also including generating code for said code table for said lexical increments which have been changed and are not skipped.
Claim 7
Independent Claim
323 words
A method of generating source code in a computer system, comprising the steps of: a) editing a module of source text using an editor, said source text of said module being stored in a source-text buffer as a plurality of lines; b) compiling said source text from said source-text buffer to produce a code table in memory; c) linking said code table to produce a link table in a buffer in memory; said code table and said link table providing an executable object code image in memory; d) executing said code image from memory to detect errors in said source code; e) re-editing said module of source text using an editor, and again storing re-edited source text in said source-text buffer as a plurality of lines; f) recompiling said source text from said source-text buffer to update said code table in memory; g) relinking the updated code table to update said link table in a buffer in memory; said updated code table and said updated link table providing an updated executable object code image in memory; h) executing said updated code image from memory to detect errors in said source code; said step of compiling including scanning lines of said source text to generate a table of lexical increments of said source text, said module containing a plurality of said lexical increments, and saving said lexical increment table in memory; said step of compiling also including generating code for said code table for each of said lexical increments of said table; said step of recompiling including rescanning said source text, said rescanning including "updating said table of lexical increments," skipping lexical increments for which corresponding lexical increments have been saved from said step of scanning and related source text lines have not been changed in said step of re-editing; said step of recompiling also including generating code for said code table for said lexical increments which have been changed and are not skipped.
Claim 8
Dependent Claim
51 words
A method according to claim 5 wherein each one of said lexical increments corresponds to a line of said source text, each line in said source-text buffer has an associated change-tag indicating whether said line has been changed in said step of re-editing, and said skipping includes reference to said change-tag.
Claim 9
Dependent Claim
36 words
A method according to claim 6 including the steps of saving said source-text buffer, said code table, said link table and said table of lexical increments in virtual memory, after said steps of compiling and linking.
Claim 10
Dependent Claim
54 words
A method according to claim 6 including generating a clean-lines table having an entry for each of said lines of said source-text buffer, said entry including an indication of how many following lines have not been changed in said step of re-editing, and said step of rescanning includes reference to said clean lines table.
Claim 11
Independent Claim
367 words
A method of generating source code in a computer system, comprising the steps of: a) editing a plurality of modules of source text using an editor, each said module containing a plurality of lines of source text, the source text for each module being stored in one of a plurality of separate source-text buffers as a plurality of lines; b) compiling said source text from said source-text buffers to produce a plurality of code tables, one for each source-text buffer; c) linking each of said code tables to produce a link table in memory; said code tables and said link table providing an executable object code image; d) executing said code image; each of said steps of compiling, linking and executing being halted to return an error indication if an error is detected, without completing the sequence of said steps; e) re-editing said plurality of modules of source text using said editor, "the re-edited" source text for each module being stored in one of said separate source-text buffers as a plurality of lines upon said re-editing; f) recompiling said source text from said source-text buffers to produce a plurality of updated code tables, one for each source-text buffer; g) relinking each of said code tables to produce an updated link table; said updated code tables and said updated link table providing an updated executable object code image; h) executing said updated code image; said step of compiling including, for each one of said source-text buffers, scanning lines of said source text to generate a table of lexical increments of said source text, said module containing a plurality of said lexical increments, and saving said lexical increment table in memory; said step of compiling also including for each said buffer generating, for each increment from said lexical increment table, code for said code table; said step of recompiling including rescanning lines of said source text, said rescanning including skipping lexical increments for which corresponding lexical increments have been saved from said step of scanning and related source text lines have not been changed by said step of re-editing; said step of recompiling also including generating code for said code table for said lexical increments which have been changed.
Claim 12
Independent Claim
367 words
A method of generating source code in a computer system, comprising the steps of: a) editing a plurality of modules of source text using an editor, each said module containing a plurality of lines of source text, the source text for each module being stored in one of a plurality of separate source-text buffers as a plurality of lines; b) compiling said source text from said source-text buffers to produce a plurality of code tables, one for each source-text buffer; c) linking each of said code tables to produce a link table in memory; said code tables and said link table providing an executable object code image; d) executing said code image; each of said steps of compiling, linking and executing being halted to return an error indication if an error is detected, without completing the sequence of said steps; e) re-editing said plurality of modules of source text using said editor, "the re-edited" source text for each module being stored in one of said separate source-text buffers as a plurality of lines upon said re-editing; f) recompiling said source text from said source-text buffers to produce a plurality of updated code tables, one for each source-text buffer; g) relinking each of said code tables to produce an updated link table; said updated code tables and said updated link table providing an updated executable object code image; h) executing said updated code image; said step of compiling including, for each one of said source-text buffers, scanning lines of said source text to generate a table of lexical increments of said source text, said module containing a plurality of said lexical increments, and saving said lexical increment table in memory; said step of compiling also including for each said buffer generating, for each increment from said lexical increment table, code for said code table; said step of recompiling including rescanning lines of said source text, said rescanning including skipping lexical increments for which corresponding lexical increments have been saved from said step of scanning and related source text lines have not been changed by said step of re-editing; said step of recompiling also including generating code for said code table for said lexical increments which have been changed.
Claim 13
Dependent Claim
57 words
A method according to claim 9 wherein each line in each of said source-text buffers has an associated change-tag indicating whether said line has been changed by said step of re-editing, said lines of source text corresponding to said lexical increments, and said skipping of lexical increments in said step of rescanning includes reference to said change-tags.
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 generating a clean-lines table having an entry for each of said lines of said source-text buffer, said entry including an indication of how many following lines have not been changed in said step of re-editing.
Claim 15
Dependent Claim
28 words
A method according to claim 9 including the step of saving in memory all of said source-text buffers, said code tables, said link table and said increment tables.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-12-08 | 1996-06-08 | 1996-12-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-12-08 | 2000-06-08 | 2000-12-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-12-08 | 2004-06-08 | 2004-12-08 | $7700.00 | Window Closed / Lapsed |