Hi Dwight,
Here might be dragons...
I've been lurking in this group for years watching the posts...but
I've not mentioned anything until now.
A few years back, I manually re-keyed the hex dump from the patent, as
I love Jef's work, and dearly wanted to have something like Swyftware
working. Despite manually entering the entire hex dump over several
evenings by hand (yes, I had trouble with some characters looking
similar or being indistinct, despite having excellent vision), I tried
to run the resulting code, but to no avail - it just hung my emulated ]
[e, no message or anything. Someone got in touch with me around that
time, and kindly send me his OCR'd versions - I wrote some routines to
compare my hand-keyed version to his OCR'd version, and it found a few
differences, which I addressed by referring back to the original scans
in every case. Despite all this, I still couldn't get anything to work
in the end.
I even fed my hex dumps through some brilliant quality speech
synthesis software on my PC, and spent a fair few evenings listening
to my keyed-in dump whilst reading the hex off the page...and couldn't
find any differences. Again, despite my best efforts, I still had no
success. It did make me wonder if Jef included some kind of tweak
known only to him, that would make the published code work...or more
likely, it was my finger trouble :-) ... although given that I re-read
the entire hex dump and compared this to my keyed-in version, I think
it's reasonably unlikely that I made a mistake although not
impossible. At that point, I gave up, rather disappointed :-(. I can
still do 6502 and could have perhaps, examined things further, but I'd
decided that enough was enough, sadly...
I'd happily send my work so far to this group - maybe if others have
tried what I have, and we compare everyone's interpretations, we'll
eventually end up at something resembling the original.
Since then, I bought a Swyftcard from Charles Springer (thanks
Charles, I got a nice surprise when I realised it was from you!), and
after waiting what seemed like an eternity on Ebay (I'm in the UK), I
managed to find a ][e that would do the trick. Needless to say, as
soon as I plugged everything in, it worked perfectly first time. Great
job to all concerned by the way, it's super-fast and very pleasant to
use. Of all my old computer kit, I could still use the ][e with a
Swyftcard for real work, if I trusted the disks and the drive, not
that they've failed me to date.
If anyone's interested, I'm willing to upload my attempt at this...it
might take me a short while to lay my hands on the files though, it's
a few years back now.
Just watch...maybe I entered everything correctly, but didn't jump to
the correct start address... :-O
Best Regards,
Nick.
On May 3, 12:48 am, dwight elvey <
dkel...@hotmail.com> wrote:
> Hi
> It is likely Lyon's then. Was that on an Apple?
> Typing these list in by had is always error prone.
> D and 0, B and 8 are troublesome but even 4 and 1
> can be tricky. I like numbers that have an ascii on the side
> it make determining which it is easier.
> I've done this kind of stuff before. I would get on average
> 1 error every 800H. Usually as a burst.
> The printout is relatively clear but there are a number
> of tricky spots.
> It takes a long time. I don't think an OCR would be even
> half as good as by hand, though.
> Dwight
>
> > From:
sandy...@gmail.com
>
> > Oh boy Dwight, you are the man!
>
> > Lyon's Forth was used before Terry wrote his tokenized Forth. I did a
> > little looking for Lyon's Forth but came up dry.
>
> > Good luck.
>
> > Sandy
> > ===
> > On Wed, May 2, 2012 at 3:42 PM, dwight elvey <
dkel...@hotmail.com> wrote:
> > > Hi
> > > I've been editing the HEX file into a text file. I'm about half way
> > > through. It seems to be based on a generic FIG type Forth and not
> > > a tokenize.
> > > What computers were used early on? It is 6502 code but I'm not
> > > sure what machine it was originally on.
> > > I expect to finish entering it and then converting to a binary file.
> > > I can then more easily write a some check routines. Forth level
> > > code should be relatively easy but the assembly code stuff might
> > > be a little more tricky.
> > > For the Forth level code, I can check back at the vector used
> > > and see if a proper header is connected. I can then look for
> > > the ; routine at the end and the : routine at the begining.
> > > The text code in the other patent is intended to be loaded with a
> > > meta compiler it looks like it might use a token Forth. I've not
> > > spent too much time looking at it.
> > > Dwight
>
> > > ________________________________
> > > Subject: Re: [Canon Cat] SwyftCard and Forth
> > > From:
sandy...@gmail.com
> > > Date: Thu, 26 Apr 2012 22:36:16 -0700
> > > To:
cano...@googlegroups.com
>
> > > OK, let's OCR it, edit it, and run it.
> > > We will check on the listings too.
> > > Sandy
>
> > > Sent from my iPhone
>