Re: Parsing timestamps?

Well, that is strange ...
Results with the current iForth are quite different:
FORTH> bench ( see file quoted above + usual iForth timing words )
\ 7963 times
\ naive-sum        : 0.999 seconds elapsed. ( 4968257259 )
\ unrolled-sum     : 1.004 seconds elapsed. ( 4968257259 )
\ recursive-sum    : 0.443 seconds elapsed. ( 4968257259 )
\ shift-reduce-sum : 2.324 seconds elapsed. ( 4968257259 ) ok
So here recursive-sum is by far the fastest, and shift-reduce-sum
is not horribly slow. The slowdown in srs is because the 2nd loop
is using the external stack.
-marcel
PS: Because of recent user requests a development snapshot was
made available at the usual place.
--