OT: Punctuation-starved Programming Languages

dwight elvey dkelvey at hotmail.com
Fri Jun 23 12:14:12 CDT 2006

>From: "John R." <jhoger at gmail.com>
>I could imagine a Forth-like language that has no readahead words and
>no punctuation that could still be recognized as forthish.
>Particularly if you use tail recursion to replace loop nesting like
>Colorforth and 4IM do.
>-- John.

One could add one more level to the typical forth interpreter. Most
Forth interpreters first check to see it the word is in the dictionary.
If it is not there, it would see if it could be a number. If not
that, it must be an error.
One could add one additional level to cause a word to be placed
on a sting stack or string buffer.
Something like:

Hello$ World$ 2 $type

would replay with:

Hello World

Defining a word would be:

Hi$ : Hello$ World$ $type ;

It has no look ahead. It does reduce the number of possible names one could
use for word, since none can end in $.
It does simplify string handling for the interpreter but makes it harder for
the programmer.

More information about the cctech mailing list