From: minforth@gmx.net   
      
   Am 21.09.2025 um 14:44 schrieb albert@spenarnc.xs4all.nl:   
   > In article ,   
   > minforth   wrote:   
   >> Am 21.09.2025 um 10:37 schrieb albert@spenarnc.xs4all.nl:   
   >>    
   >>> All this is accomplised by a PREFIX flag (compare IMMEDIATE)   
   >>> and a provision that advances the interpreter pointer by   
   >>> the length of the prefixes, not by the length of the word passed   
   >>> to it.   
   >>>   
   >>> It is believable that the system presented above is more powerful,   
   >>> but I love to see examples what it can do that warrant the   
   >>> complexity. Also I love to see if the examples can't be   
   >>> done with my simpler setup.   
   >>> Recently I presented the Roman number prefix. How does   
   >>> that look in the recognizer presented.   
   >>   
   >> FWIW I also use suffixes for recognizers:   
   >> let M be a matrix   
   >> M´  auto-transposed   
   >> M~  auto-inverted   
   >>   
   > The ability to use suffixes doesn't contribute necessarily to   
   > power. It adds confusion and difficulty to parse.   
   > Try it   
   > Program a suffix aided recognizer for Roman numbers:   
   > MMXIIX:R   
   >   
      
   YMMV but in my world it is more important to have better readability   
   of matrix equations, than to minimise Forth parser pain.  ;-)   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)