Building Better Applications: A Theory of Efficient Software DevelopmentAs computer software has grown more capable and sophisticated, the underlying operating code has expanded. Now an experienced software developer proposes a new set of theoretical ideas and practical techniques for writing simpler, more efficient programs. Dunlavey analyzes programmers and the work they produce, offering a strategy for making both perform better. |
Contents
REDUNDANCY | 22 |
LANGUAGE | 46 |
DATA | 72 |
METHOD | 105 |
Appendix A Graphical Utilities | 111 |
Appendix B CIM SimulationOriginal | 122 |
CIM SimulationRedesign | 137 |
| 151 | |
Common terms and phrases
account number account total acct total allocated arguments bits block break buffer BYTE call stack caller char COBOL data structure database define deMode differential execution display procedure endif example expr extern void FIFO Figure finite finite state machine FIXP flyweight process fm_buffer fm_mode fm_phase function garbage collector gcUsed GETC GMODE_ERASE GMODE_SHOW goto graphical handler heap ILST implement include stdio.h input instruction set int err interpreted ITRN job_t language lexan lexical analyzer line segment lookahead loop machine machine_t macro major account material handling MAXLONG minor total mismatch NULL object object-oriented programming operation outcome parse tree parser partid performance pointer primitive printf problem problem-oriented language ptop ptrn queue record redundancy request return(err routine screen simple simulation source code statement storage string subPartId subroutine task technique token TOLONG(self->x transaction code translation table typedef struct undef update variables