adam/flenser
SHA256
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
245 Commits 8 Branches 0 Tags
tokenize-function-calls
Commit Graph

10 Commits

Author SHA256 Message Date
ADAM David Alan Martin
4dde1e6f74 This uses a tokenizer system for functions to call. 
It seems slower, though.  I'm preserving it in this branch, for now.
 2025-09-17 20:59:18 -04:00
ADAM David Alan Martin
cc4e57d6b5 Switch to 32-bit math by default. 
I'll need a way to get back into 64-bit mode.
 2025-09-17 11:38:29 -04:00
ADAM David Alan Martin
e8e2027a1a Use vectors for storage, to cut down on cache-misses. 2025-09-16 22:43:11 -04:00
ADAM David Alan Martin
905a01efd3 A bit less overhead, by pre-building SV's. 2025-09-16 22:29:43 -04:00
ADAM David Alan Martin
86b5ea6a05 Unordered map was slightly faster... 2025-09-16 21:25:39 -04:00
ADAM David Alan Martin
e1d86a737f Fix memory errors wrt stashed function names 2025-09-16 20:53:07 -04:00
ADAM David Alan Martin
a3dc7e980e Significant speed improvements. 
By not cloning code for recursion directly into the processing
buffer and by not copying as many strings and by not doing
string->int conversions all the time, it's significantly faster.

Specifically, it's about 5.5x slower than Python.
 2025-09-16 17:21:29 -04:00
ADAM David Alan Martin
02c5daca3c The general idea seems to be working. 
I also went with "{}" syntax.

Now to see about pre-parsing ints for speed?
 2025-09-16 16:21:50 -04:00
ADAM David Alan Martin
245099c07a Partially working with nested conditionals. 
Some of the conditional-skip code is a bit wrong...
 2025-09-16 04:52:29 -04:00
ADAM David Alan Martin
a96dbe2953 Initial draft of stack-based machine for JS. 
The idea I have is that I'll translate/compile JavaScript
into a rudimentary Forth like language.  This sketch forms
the basis for that language's engine.
 2025-09-16 03:34:51 -04:00