|Compiler Optimizing assembler firstname.lastname@example.org (Werner Strydom) (1996-11-03)|
|Re: Compiler Optimizing assembler email@example.com (1996-11-03)|
|Re: Compiler Optimizing assembler firstname.lastname@example.org (1996-11-03)|
|Re: Compiler Optimizing assembler email@example.com (David L Moore) (1996-11-03)|
|Re: Compiler Optimizing assembler firstname.lastname@example.org (1996-11-05)|
|re: Compiler Optimizing assembler JRAITTO@us.oracle.com (JRAITTO.US.ORACLE.COM) (1996-11-05)|
|Re: Compiler Optimizing assembler Martin.Ward@durham.ac.uk (1996-11-05)|
|[3 later articles]|
|From:||Werner Strydom <email@example.com>|
|Date:||3 Nov 1996 00:29:14 -0500|
In the mainframe environment there is many millions of code written in
assembler, mostly the programmers have no previous high level language
experience, so mostly it is unstructured. It can be assumed that
"for" loops will look different depending on the programmer and
Has any reaserch been done optimizing (code duplication, dead code,
speed optimitization) assembler programs? Where can I find it? All the
papers I have regarding optimatiztion applies to high level languages.
I would like to write a assembler analysis program to analyze this
mainframe assembler and recommend improvements (without actually
making any modification to the source) to the assembler programmer.
Does anyone think this is nuts?
[This isn't nuts at all. It's a big chunk of what "lower CASE" tools do,
though I don't know how many of them work on assembler source. -John]
Return to the
Search the comp.compilers archives again.