[<<][staapl][>>][..]
Tue May 26 20:03:38 CEST 2009

comparing two strings -> generators

This is one of the examples which is really hard to do in the current
PIC18 Forth.  It's a memory to memory operation which doesn't fit well
in Forth simply because it uses a couple of arguments (size + address)
with some of them double length (address).

In scheme, there is always tail recursion for "parrallel assignment":
updating all the elements in a state vector simultaneously in terms of
the previous values.  In Fort due to absence of random access names,
this is more difficult, and has to be serialized into a sequence of
operations using stack juggling.

It's probably best to use an abstraction for this: generators.



[Reply][About]
[<<][staapl][>>][..]