Path: utzoo!attcan!uunet!midway!ncar!elroy.jpl.nasa.gov!sdd.hp.com!zaphod.mps.ohio-state.edu!ub!uhura.cc.rochester.edu!rochester!pt.cs.cmu.edu!a.gp.cs.cmu.edu!koopman
From: koopman@a.gp.cs.cmu.edu (Philip Koopman)
Newsgroups: comp.lang.forth
Subject: Re: More efficient FIG definition for "*" ?
Summary: other implementations say U* is fine
Message-ID: <11051@pt.cs.cmu.edu>
Date: 11 Nov 90 12:12:06 GMT
References: <1927.273bc77b@iccgcc.decnet.ab.com>
Organization: Carnegie-Mellon University, CS/RI
Lines: 21

In article <1927.273bc77b@iccgcc.decnet.ab.com>, schmidtg@iccgcc.decnet.ab.com writes:
> The FIG Forth which I am using defines 16 bit multiplication as:
> : * M* DROP ;
> I don't understand why it is not simply defined as:
> : * U* DROP ;
> ...

I believe that U* works fine (I've been using it for years).  As further
evidence, here are the implementations for * from Glen Haydon's _All
About Forth_ (3rd Edition):

Fig:    : *  M* DROP ;
MVP:    : *  U* DROP ;
F83:    : *  UM* DROP ;      ( Note: UM* is a renaming of the old U* )
F-PC:   CODE *  POP AX  POP BX  MUL BX  1PUSH  END-CODE
            ( Note: MUL is the unsigned 80x86 multiply instruction)

  Phil Koopman                koopman@greyhound.ece.cmu.edu   Arpanet
  2525A Wexford Run Rd.
  Wexford, PA  15090
*** this space for rent ***