Mark W. Humphries

One nifty 'feature' of a circular stack is that it makes it more attractive for a processor's ISA to include all 16 dyadic bitwise boolean operators (implemented as a Word-Width...

Here are a few more for your consideration: * `foo Under foo * {foo Beginning of foo, first foo * foo} End of foo, last foo * foo| Limit of...

>This effect also increases on using special syntaxes (via "recognizers" or something alike). Also a text become less predictable regarding where is a special syntax and where is a word...

Yes, Forth already has a handful of simple prefix words that should only be used judiciously and with care. That does not invalidate the point of *"Let commands perform themselves"*,...

> Nice thread. > > I made a [reference table](https://docs.google.com/spreadsheets/d/1TDGwB0WVFC9nuAOQ2-o6ifNpvb8OILJtZK2zFm6ONxc/edit?ouid=104440289541124611001&usp=sheets_home&ths=true) for my own conventions in [Ramen](https://github.com/rogerlevy/ramen) - > > I like that `0word` convention. I've been using `/word` for initializing...

> > I prefer to use the `foo0` convention for "foo reset/initialize", leaving `0foo` for "foo conditional on zero", i.e. the counterpart of `?foo` "foo conditional on not zero". >...

> I'm very much enjoying this discussion. ;-) I will say that I have - partly - always been rather mystified by the Forth propensity for obscuring what's taking place....

* Understanding an overall problem deeply enough that you can discriminate essential from arbitrary complexity. * Producing systems that are simple, transparent, tractable, and can be fully comprehended in their...

>: BTOGGLE ( bit# addr[] -- ) ... Below is is the factoring that I use for bit toggling , it takes a mask as an argument rather than a...

Thanks. >2** is 2 to the exponent ** ? That's right, it raises 2 to a power. >How is that implemented? >It would seem to be similar to RSHIFT, no?...