The only other option I can think of would be to:

  clr acc
  add 1 to acc
  multiply acc by 10
  add 2 to acc
  multiply acc by 10
  etc.

By the way, don't forget that 10X = 8X+2X, that is, 10X = (X SHL 3)+(X SHL 1).
This can sometimes give better performance than using a multiply instruction.

At 05:55  07/12/96 GMT, Mayes uk wrote:
>Hi,
>
>In an upcoming project I will need to convert an ascii string of
>numbers to a 4 byte binary equivalent.
>
>The string format is:
>
>  123.4567890
>
>As the format is fixed I can ignore the decimal point, which leaves
>me with the job of converting a string like 1234567890 to binary.
>
>In principle, assuming I have a 4 byte accumulator, I could:
>
>  clr  acc
>  add  0 * 1 to acc
>  add  9 * 10 to acc
>  add  8 * 100 to acc
>  add  7 * 1000 to acc
>  ... etc
>
>This seems long winded and therefore slow. Do any of you guys have
>any other solutions?
>
>
>Thanks for your help,
>
>
>
>Mike
>
>