Date: Mon, 16 Oct 2023 17:19:03 +0200
On 16/10/2023 15.47, Sebastian Wittmeier via Std-Proposals wrote:
> How do F strings react, when they are concatenated out of different types of strings? Does each F one of them have to be complete? Or can a F be mixed with a normal string and the concatenation has to be complete?
I'd like to point out that preprocessor tokenization happens in phase 3,
macros are expanded in phase 4, and strings are concatenated in phases 5 and 6.
See [lex.phases] for details.
In which phase are these F or X strings supposed to be turned into
something else that presumably ends up as a phase 7 C++ expression
performing some formatting when evaluated?
Jens
> How do F strings react, when they are concatenated out of different types of strings? Does each F one of them have to be complete? Or can a F be mixed with a normal string and the concatenation has to be complete?
I'd like to point out that preprocessor tokenization happens in phase 3,
macros are expanded in phase 4, and strings are concatenated in phases 5 and 6.
See [lex.phases] for details.
In which phase are these F or X strings supposed to be turned into
something else that presumably ends up as a phase 7 C++ expression
performing some formatting when evaluated?
Jens
Received on 2023-10-16 15:19:09