[ $ 
  $ QsTtUuVvWwXxYyZz()[]{}<>~=+-*/^\|_.,:;?!'string is used, so cannot
  appear as a character in that string. In the second 
  string all the reasonable delimiters are used, so Q
  is used as the delimiter.

  As it is not possible to make a string that uses all
  the characters, two strings are concatenated (join)
  to make the string during compilation. (Which is why
  $  $ Qs...$Q join is nested (inside [ ... ])
  and followed by the word constant, which causes the 
  nest to be evaluated during compilation.)

  Regardless of operating system, Quackery only knows 
  the characters in the string tokenchars, plus space
  and carriage return.

  The characters in tokenchars are in QACSFOT order
  (the Quackery Arbitrary Character Sequence For 
   Ordered Text) which it uses for string comparison,
   but the valid tokens (which is all of them) will
   be printed by alltokens in the order native to the 
   operating system. (In this instance, Unicode.)     )

[ tokenchars find 
  tokenchars found ]                                  is validtoken ( c --> b )

[ 256 times 
  [ i^ validtoken if [ i^ emit ] ] ]                  is alltokens  (   -->   )

alltokens