aboutsummaryrefslogtreecommitdiff
path: root/vm
diff options
context:
space:
mode:
authorAryadev Chavali <aryadev@aryadevchavali.com>2023-11-01 14:38:59 +0000
committerAryadev Chavali <aryadev@aryadevchavali.com>2023-11-01 15:09:47 +0000
commit93d234cd48404867b1d80a727d17a4b4a0726e1b (patch)
treeb9ff5d75b4e2d6d9b481d149d6103254dbc46d73 /vm
parent727081f99a5065787dd3d035f92ef9f502f3622c (diff)
downloadovm-93d234cd48404867b1d80a727d17a4b4a0726e1b.tar.gz
ovm-93d234cd48404867b1d80a727d17a4b4a0726e1b.tar.bz2
ovm-93d234cd48404867b1d80a727d17a4b4a0726e1b.zip
Lexer now returns more descriptive tokens
More useful tokens, in particular for each opcode possible. This makes parsing a simpler task to reason as now we're just checking against an enum rather than doing a string check in linear time. It makes more sense to do this at the tokeniser as the local data from the buffer will be in the cache most likely as the buffer is contiguously allocated. While it will always be slow to do linear time checks on strings, when doing it at the parser we're having to check strings that may be allocated in a variety of different places. This means caching becomes a harder task, but with this approach we're less likely to have cache misses as long as the buffer stays there.
Diffstat (limited to 'vm')
0 files changed, 0 insertions, 0 deletions