Am 18.09.2010 um 01:05 schrieb pito:

> Hi Michael,
> few Q (sorry, I am an forth language illiterate):
> a) how the "here" knows what to deliver - next free address of flash
> or next free address from ram?

Oh, I'm sorry. Its in amforth-3.6.

amforth-3.6
here == next free address of flash
heap == next free address from ram

amforth-4.1 (ANS forth standard)
dp   == next free address of flash
here == next free address from ram

So replace here with dp if you use amforth-4.1 please.


> b) I saw see in flashforth and I did run it - it is very short, can
> that be ported to amforth (see ff36 folder) somehow?

This flashforth SEE is interesting, but I cannot run it, no pic here.
What is its output?


> c) would it be possible to modify the routine so that we may see a
> linked list of words from which the word under investigstion has
> been compiled?, e.g.:
> see d.
> : 0 d.r space exit ok
>>
> I think there is all the information available in flash (at least
> "words" shows a lot of words, maybe there are some hidden as well so
> the name can be extracted).
> Thanks Pito

Yes.

The code field holds all the xt of the words beeing used in the  
definition.
The main principle is to use xt>nfa on them to find their names and  
type them.
Then handle loops and conditional branching as well as literals and  
strings, and maybe disassemble inlined code.

Its a nice study of a forth system if you make a SEE for it :-)

Michael

------------------------------------------------------------------------------
Start uncovering the many advantages of virtual appliances
and start using them to simplify application deployment and
accelerate your shift to cloud computing.
http://p.sf.net/sfu/novell-sfdev2dev
_______________________________________________
Amforth-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/amforth-devel

Reply via email to