Comment by sanufar 19 days ago The way hashing is used for tokens and for making a pseudo symbol table is such an elegant idea. 3 comments sanufar Reply fix4fun 19 days ago I think the same. Really nice project and good trick with hashing tokens.PS. There left 21 bytes (21 * 0x00 - from 0x01e0 to 0x01fd). Maybe something can be packed there ;) avadodin 19 days ago I actually "shipped" a parser using the symbols' hash(as the only identifier) for a test tool once. Hopefully, the users never used enough symbols to collide 32-bits. benj111 19 days ago I've had the idea before. Was never quite brave enough to do it. It's elegant until it isn't....
fix4fun 19 days ago I think the same. Really nice project and good trick with hashing tokens.PS. There left 21 bytes (21 * 0x00 - from 0x01e0 to 0x01fd). Maybe something can be packed there ;)
avadodin 19 days ago I actually "shipped" a parser using the symbols' hash(as the only identifier) for a test tool once. Hopefully, the users never used enough symbols to collide 32-bits.
benj111 19 days ago I've had the idea before. Was never quite brave enough to do it. It's elegant until it isn't....
I think the same. Really nice project and good trick with hashing tokens.
PS. There left 21 bytes (21 * 0x00 - from 0x01e0 to 0x01fd). Maybe something can be packed there ;)
I actually "shipped" a parser using the symbols' hash(as the only identifier) for a test tool once. Hopefully, the users never used enough symbols to collide 32-bits.
I've had the idea before. Was never quite brave enough to do it. It's elegant until it isn't....