Please don't reprint this article; please don't re-publish this article in any form; please delete it within 24 hours of downloading this article; it is forbidden to use this article for commercial purposes.
2 Lexical conventions [lex] 2.3 Trigraph sequences [lex.trigraph] 2 Lexical Conventions [2.3] lexical lexical three character sequence [Third digraphs] Before any other processing takes place, each occurrence of one of the following sequences of three characters ( "Trigraph Sequence") Is Replaced by The Single Character Indicated In Table 1.
Table 1 - Trigraph Sequences
TrigraphReplacement ?? = # ?? // ?? '^ ?? ([??)] ??! | ?? <{??>} ??
Before any other processing occurs, each of the following three character sequences is replaced with a single character specified in Table 1.
Table 1 - Trinity sequence
Trinity replacement ?? = # ?? // ?? '^ ?? ([??)] ??! | ?? <{??>} ??
[EXample: ?? = Define Arraycheck (a, b) a ?? (b ??) ??! ??! B ?? (a ??) Becomes #define arraycheck (a, b) a [b] || B [A] - END EXAMPLE] [Example: ?? = Define Arraycheck (a, b) a ?? (b ??) ??! ??! b ?? (a ??) becomes #define arraycheck (A , b) a [b] || b [a] - Case] No Other Trigraph Sequence EXISTS. Each? That Does Not Begin One of the Trigraphs Listed Above Is Not Changd. There is no other three-game. Each is not the above three consequences? Will remain unchanged. Prev [lex.charset] | Next [lex.ppletoken] Previous [lexist. Character set] | Next page [lexical. Preprocessing tag]
