The Ultimate Question ??

This is G o o g l e's cache of http://home.earthlink.net/~neilbawd/ultque.html.
G o o g l e's cache is the snapshot that we took of the page as we crawled the web.
The page may have changed since that time. Click here for the current page without highlighting.
To link to or bookmark this page, use the following url: http://www.google.com/search?q=cache:9imNKffqP04C:home.earthlink.net/~neilbawd/ultque.html+&hl=en&ie=UTF-8

Google is not affiliated with the authors of this page nor responsible for its content.

Neil Bawd 1986-11-29

This was the first appearance by Neil Bawd. He asked how could it be implemented in high-level Forth. In Standard Forth it can done with EVALUATE.

?? ( ... x "word" -- ??? ): If top of stack is true, execute the next word. The next word may be anything.

This one definition takes the place of many:

?? EXIT for IF EXIT THEN
?? 1+ for IF 1+ THEN
?? NEGATE for IF NEGATE THEN
?? CR for IF CR THEN
?? RECURSE for IF RECURSE THEN
Etcetera.

TEXT

Program Text 1 : ?? ( x "word" -- ) S" IF " EVALUATE BL WORD COUNT EVALUATE S" THEN " EVALUATE ; IMMEDIATE

Go back to Neil Bawd's home page.