version 1.2, 1994/06/01 10:05:16
|
version 1.6, 1994/08/31 16:37:46
|
Line 106 for introductory material.
|
Line 106 for introductory material.
|
@comment node-name, next, previous, up |
@comment node-name, next, previous, up |
@chapter Goals of GNU Forth |
@chapter Goals of GNU Forth |
@cindex Goals |
@cindex Goals |
!! Insert Goals here |
The goal of the GNU Forth Project is to develop a standard model for |
|
ANSI Forth. This can be split into several subgoals: |
|
|
|
@itemize @bullet |
|
@item |
|
GNU Forth should conform to the ANSI Forth standard. |
|
@item |
|
It should be a model, i.e. it should define all the |
|
implementation-dependent things. |
|
@item |
|
It should become standard, i.e. widely accepted and used. This goal |
|
is the most difficult one. |
|
@end itemize |
|
|
|
To achieve these goals GNU Forth should be |
|
@itemize @bullet |
|
@item |
|
Similar to previous models (fig-Forth, F83) |
|
@item |
|
Powerful. It should provide for all the things that are considered |
|
necessary today and even some that are not yet considered necessary. |
|
@item |
|
Efficient. It should not get the reputation of being exceptionally |
|
slow. |
|
@item |
|
Free. |
|
@item |
|
Available on many machines/easy to port. |
|
@end itemize |
|
|
|
Have we achieved these goals? GNU Forth conforms to the ANS Forth |
|
standard; it may be considered a model, but we have not yet documented |
|
which parts of the model are stable and which parts we are likely to |
|
change; it certainly has not yet become a de facto standard. It has some |
|
similarities and some differences to previous models; It has some |
|
powerful features, but not yet everything that we envisioned; on RISCs |
|
it is as fast as interpreters programmed in assembly, on |
|
register-starved machines it is not so fast, but still faster than any |
|
other C-based interpretive implementation; it is free and available on |
|
many machines. |
|
|
@node Other Books, Invocation, Goals, Top |
@node Other Books, Invocation, Goals, Top |
@chapter Other books on ANS Forth |
@chapter Other books on ANS Forth |
Line 118 deviations of the book.
|
Line 157 deviations of the book.
|
|
|
There is, of course, the standard, the definite reference if you want to |
There is, of course, the standard, the definite reference if you want to |
write ANS Forth programs. It will be available in printed form from |
write ANS Forth programs. It will be available in printed form from |
!! somtime in spring or summer 1994. If you are lucky, you can still get |
Global Engineering Documents !! somtime in spring or summer 1994. If you |
dpANS6 (the draft that was approved as standard) by aftp from |
are lucky, you can still get dpANS6 (the draft that was approved as |
ftp.uu.net:/vendor/minerva/x3j14. |
standard) by aftp from ftp.uu.net:/vendor/minerva/x3j14. |
|
|
@cite{Forth: The new model} by Jack Woehr (!! Publisher) is an introductory |
@cite{Forth: The new model} by Jack Woehr (!! Publisher) is an |
book based on a draft version of the standard. It does not cover the |
introductory book based on a draft version of the standard. It does not |
whole standard. It also contains interesting background information |
cover the whole standard. It also contains interesting background |
(Jack Woehr was in the ANS Forth Technical Committe). |
information (Jack Woehr was in the ANS Forth Technical Committe). It is |
|
not appropriate for complete newbies, but programmers experienced in |
|
other languages should find it ok. |
|
|
@node Invocation, Words, Other Books, Top |
@node Invocation, Words, Other Books, Top |
@chapter Invocation |
@chapter Invocation |
Line 177 variable @code{GFORTHPATH}; if this does
|
Line 218 variable @code{GFORTHPATH}; if this does
|
@node Notation, Arithmetic, Words, Words |
@node Notation, Arithmetic, Words, Words |
@section Notation |
@section Notation |
|
|
The Forth words are describes in this section in the glossary notation |
The Forth words are described in this section in the glossary notation |
that has become a de-facto standard for Forth texts, i.e. |
that has become a de-facto standard for Forth texts, i.e. |
|
|
@quotation |
@quotation |
Line 223 The name of a stack item corresponds in
|
Line 264 The name of a stack item corresponds in
|
@item name starts with |
@item name starts with |
Type |
Type |
@item f |
@item f |
Bool, i.e. false (0) or true (-1). |
Bool, i.e. @code{false} or @code{true}. |
@item c |
@item c |
Char |
Char |
@item w |
@item w |
Line 318 variables. Note that while every sane Fo
|
Line 359 variables. Note that while every sane Fo
|
point stack, this is not strictly required; an ANS Forth system could |
point stack, this is not strictly required; an ANS Forth system could |
theoretically keep floating point numbers on the data stack. As an |
theoretically keep floating point numbers on the data stack. As an |
additional difficulty, you don't know how many cells a floating point |
additional difficulty, you don't know how many cells a floating point |
numkber takes. It is reportedly possible to write words in a way that |
number takes. It is reportedly possible to write words in a way that |
they work also for a unified stack model, but we do not recommend trying |
they work also for a unified stack model, but we do not recommend trying |
it. Also, a Forth system to keep the local variables on the return |
it. Also, a Forth system is allowed to keep the local variables on the |
stack. This is reasonable, as local variables usually eliminate the need |
return stack. This is reasonable, as local variables usually eliminate |
to use the return stack explicitely. So, if you want to produce a |
the need to use the return stack explicitly. So, if you want to produce |
standard complying program and if you are using local variables in a |
a standard complying program and if you are using local variables in a |
word, forget about return stack manipulations in that word (see the |
word, forget about return stack manipulations in that word (see the |
standard document for the exact rules). |
standard document for the exact rules). |
|
|
Line 363 r@
|
Line 404 r@
|
rdrop |
rdrop |
2>r |
2>r |
2r> |
2r> |
|
2r@ |
|
2rdrop |
|
|
@subsection Locals stack |
@subsection Locals stack |
|
|
Line 397 df!
|
Line 440 df!
|
@subsection Memory block access |
@subsection Memory block access |
|
|
move |
move |
fill |
|
blanks |
|
erase |
erase |
|
|
|
While the previous words work on address units, the rest works on |
|
characters. |
|
|
|
cmove |
|
cmove> |
|
fill |
|
blank |
|
|
@node Control Structures |
@node Control Structures |
@section Control Structures |
@section Control Structures |
|
|
Line 417 IF
|
Line 466 IF
|
@var{code} |
@var{code} |
ENDIF |
ENDIF |
@end example |
@end example |
|
or |
@example |
@example |
@var{flag} |
@var{flag} |
IF |
IF |
Line 437 system that only supplies @code{THEN} is
|
Line 486 system that only supplies @code{THEN} is
|
: endif POSTPONE then ; immediate |
: endif POSTPONE then ; immediate |
@end example |
@end example |
|
|
We also provide the words @code{?dup-if} and @code{?dup-not-if}, so you |
[According to @cite{Webster's New Encyclopedic Dictionary}, @dfn{then |
|
(adv.)} has the following meanings: |
|
@quotation |
|
... 2b: following next after in order ... 3d: as a necessary consequence |
|
(if you were there, then you saw them). |
|
@end quotation |
|
Forth's @code{THEN} has the meaning 2b, @code{THEN} in Pascal |
|
and many other programming languages has the meaning 3d.] |
|
|
|
We also provide the words @code{?dup-if} and @code{?dup-0=-if}, so you |
can avoid using @code{?dup}. |
can avoid using @code{?dup}. |
|
|
@example |
@example |
Line 527 index by @var{n} instead of by 1. The lo
|
Line 585 index by @var{n} instead of by 1. The lo
|
between @var{limit-1} and @var{limit} is crossed. E.g.: |
between @var{limit-1} and @var{limit} is crossed. E.g.: |
|
|
4 0 ?DO i . 2 +LOOP prints 0 2 |
4 0 ?DO i . 2 +LOOP prints 0 2 |
|
|
4 1 ?DO i . 2 +LOOP prints 1 3 |
4 1 ?DO i . 2 +LOOP prints 1 3 |
|
|
The behaviour of @code{@var{n} +LOOP} is peculiar when @var{n} is negative: |
The behaviour of @code{@var{n} +LOOP} is peculiar when @var{n} is negative: |
|
|
-1 0 ?DO i . -1 +LOOP prints 0 -1 |
-1 0 ?DO i . -1 +LOOP prints 0 -1 |
|
|
0 0 ?DO i . -1 +LOOP prints nothing |
0 0 ?DO i . -1 +LOOP prints nothing |
|
|
Therefore we recommend avoiding using @code{@var{n} +LOOP} with negative |
Therefore we recommend avoiding using @code{@var{n} +LOOP} with negative |
Line 539 Therefore we recommend avoiding using @c
|
Line 599 Therefore we recommend avoiding using @c
|
case behaves symmetrical to the positive case: |
case behaves symmetrical to the positive case: |
|
|
-2 0 ?DO i . -1 +LOOP prints 0 -1 |
-2 0 ?DO i . -1 +LOOP prints 0 -1 |
|
|
-1 0 ?DO i . -1 +LOOP prints 0 |
-1 0 ?DO i . -1 +LOOP prints 0 |
|
|
0 0 ?DO i . -1 +LOOP prints nothing |
0 0 ?DO i . -1 +LOOP prints nothing |
|
|
The loop is terminated when the border between @var{limit-sgn(n)} and |
The loop is terminated when the border between @var{limit-sgn(n)} and |
@var{limit} is crossed. However, @code{S+LOOP} is not part of the ANS |
@var{limit} is crossed. However, @code{S+LOOP} is not part of the ANS |
Forth standard. |
Forth standard. |
|
|
The @code{?DO} can be replaced by @code{DO}. @code{DO} enters the loop |
@code{?DO} can be replaced by @code{DO}. @code{DO} enters the loop even |
even when the start and the limit value are equal. We do not recommend |
when the start and the limit value are equal. We do not recommend using |
using @code{DO}. It will just give you maintenance troubles. |
@code{DO}. It will just give you maintenance troubles. |
|
|
|
@code{UNLOOP} is used to prepare for an abnormal loop exit, e.g., via |
|
@code{EXIT}. @code{UNLOOP} removes the loop control parameters from the |
|
return stack so @code{EXIT} can get to its return address. |
|
|
|
Another counted loop is |
|
@example |
|
@var{n} |
|
FOR |
|
@var{body} |
|
NEXT |
|
@end example |
|
This is the preferred loop of native code compiler writers who are too |
|
lazy to optimize @code{?DO} loops properly. In GNU Forth, this loop |
|
iterates @var{n+1} times; @code{i} produces values starting with @var{n} |
|
and ending with 0. Other Forth systems may differently, even if they |
|
support @code{FOR} loops. |
|
|
FOR NEXT UNLOOP |
|
|
|
@contents |
@contents |
@bye |
@bye |