Abstract#R##N##R##N#In a number of computer systems an instruction in symbolic assembly language may be translated as either a long form or a short form instruction in machine code depending on certain conditions. Assemblers which optimize the size of a program by using short form instructions wherever possible, sometimes require three or more passes to achieve this. This paper describes an approach to solving this type of problem which can be implemented in a two-pass or even a one-pass assembler.
['M. H. Williams']
Long/short address optimization in assemblers