Sperry used to have a balanced tree search that all compilers and assemblers used. Very small very fast. Less than 200 lines of code, but used instruction modification depending on paths taken. Fairly long intro, but we started getting in some large modeling routines from some of the big labs. Well balanced tree sort hurled on large programs. Sperry said the code was frozen and wouldn't take a fix. WAD. My smart friend David said he could fix it but would rewrite in Fortran translating from MIX? Turned out to be almost 300 lines of Fortran with no instruction modification. Definitely a tad slower but would allow the big modeling pgms to compile and run!
In a message dated 08/01/13 13:33:40 Central Daylight Time, [email protected] writes: This was much faster that trying to bebug "clever" use of alters ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to [email protected] with the message: INFO IBM-MAIN
