Re-execution of edit-compile-run cycles for changed lines of source code, with storage of associated data in buffers
AssigneeDigital Equipment Corporation
InventorsWilliam M. McKeeman, Shota Aki
Life of this patent
Estimating the term…
Loading patent…
AssigneeDigital Equipment Corporation
InventorsWilliam M. McKeeman, Shota Aki
Estimating the term…
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-byline, so if only one line is changed in an edit session, then only that line need be recompiled if no other code is affected. Dependency analysis is performed incrementally, without requiring the user to enter dependencies. Scanning is also 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. 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 paging swapping, but with a minimum of page faults, again to enhance operating speed.
A method of developing source code, comprising the steps of:
A method of developing source code, comprising the steps of:
A method of developing source code, comprising the steps of:
Dependencies are inferred from the claim text.