Date: Sat, 31 Oct 2026 19:16:43 +0500
I believe that without an introduction my initial email was rather empty:
summary: Parsing as Typing: Replacing String Operations with Type-Based
Dispatch via Reflection
Conventional parsing is viewed purely as string processing, transforming an
input string into data for a conventionally typed system to consume. In
this traditional model, parsing necessarily comes before typing, rather
than being a typed operation itself.The issue with this ordering is that
semantic information is discarded during string manipulation, only to be
reconstructed later through branching and conditionals. This paper
introduces a compact, type-based dispatch engine that reframes parsing as
typing from the first character. By modeling parsing operations as typed
operations with user-defined semantics, the parser does not produce data
for the type system, it operates within it.
On Sat, Oct 31, 2026 at 7:14 PM Muneem <itfllow123_at_[hidden]> wrote:
>
>
> ---------- Forwarded message ---------
> From: Muneem <itfllow123_at_[hidden]>
> Date: Thu, Oct 29, 2026 at 12:11 PM
> Subject: Re: [std-discussion] Guidance
> To: M Gurschi <max.gurschi_at_[hidden]>
>
>
> It isn't runtime indexed tuples, like I am using runtime indexed tuples to
> implement a sort of interpreter engine, the reflection is purely a feature
> to inspect elements on a type level(python allows it so why not me). The
> goal is to have an interpreter engine and interpreter engines require
> dynamically allocated memory. The usual model will be that when a user
> tries to access something, if the index is out of bounds of the runtime
> index tuple, then it is looked up in the Runtime_storage_t. If the user
> wants to use names then there would be a flatmap to convert names to
> indexes. I am using reflections for tags so I can generate code to handle
> dynamic types rather than having to write it all myself.
>
> On Wed, Oct 28, 2026 at 11:56 PM M Gurschi <max.gurschi_at_[hidden]> wrote:
>
>> Not sure if this lands, but runtime indexed tuples can be implemented
>> without reflection. I implemented this a few years back.
>>
>> Regards,
>> Maxim Gurschi
>>
>> On 28 Oct 2026, at 16:51, Muneem via Std-Discussion <
>> std-discussion_at_[hidden]> wrote:
>>
>>
>> Hi! I was writing code for a future ISO cpp proposal, I can't explain
>> what the proposal is about yet, and the idea is probably gonna need some
>> testing before I leave it out but in the meanwhile, I hope someone could
>> take a look at my code and critique it, like save me from making mistakes
>> before it's too late, since I am using some new "cutting edge" features
>> which are relatively undocumented. Here is the code:
>> https://godbolt.org/z/EhWsfvE13 .
>> You can view it as it changes on my github:
>> https://github.com/HjaldrKhilji/dynamic-typed-memory/blob/main/Dynamic_memory_and_base_interpretor_foundation.cpp
>> .
>> --
>> Std-Discussion mailing list
>> Std-Discussion_at_[hidden]
>> https://lists.isocpp.org/mailman/listinfo.cgi/std-discussion
>>
>
summary: Parsing as Typing: Replacing String Operations with Type-Based
Dispatch via Reflection
Conventional parsing is viewed purely as string processing, transforming an
input string into data for a conventionally typed system to consume. In
this traditional model, parsing necessarily comes before typing, rather
than being a typed operation itself.The issue with this ordering is that
semantic information is discarded during string manipulation, only to be
reconstructed later through branching and conditionals. This paper
introduces a compact, type-based dispatch engine that reframes parsing as
typing from the first character. By modeling parsing operations as typed
operations with user-defined semantics, the parser does not produce data
for the type system, it operates within it.
On Sat, Oct 31, 2026 at 7:14 PM Muneem <itfllow123_at_[hidden]> wrote:
>
>
> ---------- Forwarded message ---------
> From: Muneem <itfllow123_at_[hidden]>
> Date: Thu, Oct 29, 2026 at 12:11 PM
> Subject: Re: [std-discussion] Guidance
> To: M Gurschi <max.gurschi_at_[hidden]>
>
>
> It isn't runtime indexed tuples, like I am using runtime indexed tuples to
> implement a sort of interpreter engine, the reflection is purely a feature
> to inspect elements on a type level(python allows it so why not me). The
> goal is to have an interpreter engine and interpreter engines require
> dynamically allocated memory. The usual model will be that when a user
> tries to access something, if the index is out of bounds of the runtime
> index tuple, then it is looked up in the Runtime_storage_t. If the user
> wants to use names then there would be a flatmap to convert names to
> indexes. I am using reflections for tags so I can generate code to handle
> dynamic types rather than having to write it all myself.
>
> On Wed, Oct 28, 2026 at 11:56 PM M Gurschi <max.gurschi_at_[hidden]> wrote:
>
>> Not sure if this lands, but runtime indexed tuples can be implemented
>> without reflection. I implemented this a few years back.
>>
>> Regards,
>> Maxim Gurschi
>>
>> On 28 Oct 2026, at 16:51, Muneem via Std-Discussion <
>> std-discussion_at_[hidden]> wrote:
>>
>>
>> Hi! I was writing code for a future ISO cpp proposal, I can't explain
>> what the proposal is about yet, and the idea is probably gonna need some
>> testing before I leave it out but in the meanwhile, I hope someone could
>> take a look at my code and critique it, like save me from making mistakes
>> before it's too late, since I am using some new "cutting edge" features
>> which are relatively undocumented. Here is the code:
>> https://godbolt.org/z/EhWsfvE13 .
>> You can view it as it changes on my github:
>> https://github.com/HjaldrKhilji/dynamic-typed-memory/blob/main/Dynamic_memory_and_base_interpretor_foundation.cpp
>> .
>> --
>> Std-Discussion mailing list
>> Std-Discussion_at_[hidden]
>> https://lists.isocpp.org/mailman/listinfo.cgi/std-discussion
>>
>
Received on 2026-10-31 14:16:59
