Please take this question for a moot point:
I'd like to know about edge cases where different tokens which TeX might encounter during expansion without delivering error-messages have the same meaning and the same \string-representation.
By "have the same meaning" I mean that
\ifx⟨token 1⟩⟨token 2⟩\expandafter\firstoftwo\else\expandafter\secondoftwo\fi yields \firstoftwo.
By "same \string-representation" I mean that \string⟨token 1⟩ yields the same set of tokens as \string⟨token 2⟩.
Edge cases I came up with so far:
- frozen-
\relaxand\relax-primitive. - the nameless control-sequence (producible via
\csname\endcsnameor via an escape-character (backslash) at the end of a line of .tex-input while\endlinecharhas a negative value) and the control-sequence whose name iscsname⟨escapechar⟩endcsname(producible via\csname csname\string\endcsname\endcsname) while those control-sequences have the same meaning. - active-character-token let equal to a non-active pendant.
- one-letter-control-sequence let equal to an explicit character token where the character-code corresponds to the character which forms the name of the control-sequence while
\escapecharhas a negative value.
Are there more edge cases?
E.g., what about things like \inaccessible or tokens that TeX might insert while processing an alignment? You can define \inaccessible. Can you let it equal to TeX's \inaccessible?

\meaning" ? – David Carlisle Dec 28 '21 at 20:21\ifx-comparison of the tokens yields the "true"-branch. I edited the question. – Ulrich Diez Dec 28 '21 at 21:35