Abstract

AbstractIn 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.