Compiler using clean lines table with entries indicating unchang

Details Compiler using clean lines table with entries indicating unchang Compiler using clean lines table with entries indicating unchang

1992-01-09

1994-06-28

Lee, Thomas C.

Boots, shoes, and leggings

3642804, 3642592, 364DIG1, G06F 945

Patent

active

053255313

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. 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 page swapping, but with a minimum of page faults, again to enhance operating speed.

REFERENCES:
patent: 3711863 (1973-01-01), Bloom
patent: 4204253 (1980-05-01), van den Hanenberg et al.
patent: 4398249 (1983-08-01), Pardo et al.
patent: 4463423 (1984-07-01), Potash et al.
patent: 4558413 (1985-12-01), Schmidt et al.
patent: 4589068 (1986-05-01), Heinen, Jr.
patent: 4667290 (1987-05-01), Goss et al.
patent: 4686623 (1987-08-01), Wallace
patent: 4720778 (1988-01-01), Hall et al.
patent: 4734854 (1988-03-01), Afshar
patent: 4809170 (1989-02-01), Leblang et al.
patent: 4819233 (1989-04-01), Delucia et al.
patent: 4833606 (1989-05-01), Iwasawa et al.
patent: 4931928 (1990-06-01), Greenfeld
patent: 4951192 (1990-08-01), Chase, Jr. et al.
patent: 5065400 (1991-11-01), Masuishi et al.
patent: 5133063 (1992-07-01), Naito et al.
patent: 5170465 (1992-12-01), McKeeman et al.
patent: 5182806 (1993-01-01), McKeeman et al.
patent: 5193191 (1993-03-01), McKeeman et al.
patent: 5201050 (1993-04-01), McKeeman et al.
Aho, A. V., et al., Compilers: Principles, Techniques, and Tools, Addison-Wesley Publishing Co., pp. 1-15 (1986).
Fritzon, P., "Preliminary Experience from the DICE System--a Distributed Incremental Compiling Environment," ACM SIGPLAN Notices, vol. 19, No. 5, pp. 113-123 (May 1984).
Medina-Mora, R., et al., "An Incremental Programming Environment," IEEE Transactions on Software Engineering, vol. SE-7, No. 5, pp. 472-482 (Sep. 1981).
Ryan, J. L., et al., "A Conversational System for Incremental Compilation and Execution in a Time-Sharing Environment," AFIPS Conference Proceedings, vol. 29, Fall Joint Computer Conference, pp. 1-21 (1966).
Reiss, S. P., "An Approach to Incremental Compilation," ACM SIGPLAN Notices, vol. 19, No. 6, pp. 144-151 (Jun. 1984).
Schwartz, M. D., et al., "Incremental Compilation in Magpie," ACM SIGPLAN Notices, vol. 19, No. 6, pp. 122-131 (Jun. 1984).
Fritzon, P., "Symbolic Debugging Through Incremental Compilation in an Integrated Environment," The Journal of Systems and Software 3, pp. 285-294 (1983).
Fritzon, P., "Fine-Grained Incremental Compilation for Pascal-like Languages," Software Systems Research Center, Linkoping Institute of Technology, S-581 83 Linkoping, Sweden, LiTH-MAT-R-82-15, pp. 1-32 (Jul. 1982).
Ayres, R. B., et al., "Partial Recompilation," AFIPS Conference Proceedings, vol. 38, Spring Joint Computer Conference, pp. 497-502 (1971).
Earley, J. et al., "A Method for Incrementally Compiling Languages with Nested Statement Structure," Communications of the ACM, vol. 15, No. 12, pp. 1040-1044 (Dec. 1972).
Fritzon, P., "A Systematic Approach to Advanced Debugging through Incremental Compilation," ACM SIGPLAN Notices, vol. 18, No. 8, pp. 130-139 (Aug. 1983).
Fritzon, P., Towards a Distributed Programming Environment Based on Incremental Compilation, PhD Thesis, Dept. of Computer and Information Science, Linkoping Univ., Linkoping, Sweden, pp. 59-100 (1984).
Feldman, S. I., "Make--A Program For Maintaining Computer Programs," Software--Practice and Experience, vol. 9, pp. 255-265 (1979).
Waite, William M. and Gerhard Goos, Compiler Construction, Springer-Verlag, New York, 1984, Section 1.4, pp. 8-9.
Walker et al., "The Symbolics Genera Programming Environment", IEEE Software, vol. 4, No. 6, Nov. 1987, pp. 36-44.
Sebesta, "Conversational programming systems", Journal of Pascal, Ada & Modula-2, vol. 4, No. 3, May/Jun. 1985, pp. 9-22.
Adams, "SUNPRO: engineering, a practical program development environment," Proc. of An Int'l Workshop Adv. Prog. Environments, Jun. 16, 1986, pp. 86-96.
Alberga et al., "A program development tool", IBM Journal of Research and Development, vol. 28, No. 1, Jan. 1984, pp. 60-72.
Reiss, "PECAN: program development systems that support multiple views," IEEE Trans. on Software Engineering, vol. SE-11, No. 3, Mar. 1985, pp. 276-285.

Affiliated with

Also associated with

Rating

Compiler using clean lines table with entries indicating unchang does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compiler using clean lines table with entries indicating unchang, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiler using clean lines table with entries indicating unchang will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2383630