fix postfix/prefix increment operators chaining from previous operators even when there's a newl...

cleanup other implementation details

- fix string parsing
- fix number parsing to handle dec64 internal representation

don't encase some statements in an implicit environment, improve scoping rules

This bodes well for what we need because most the time checks we do to runtime check object vs n...

- use 32bit strings
- flesh out initial memory allocator
- flesh out bitwise operations on doubl...

make more progress on compiler output

- fix issues with compiler.
- inline operators in compiler.
- decode length of string ahead of t...

which all in all are in some form closures too

TODO: functions

Through tracking invocations/assigments to an operand.

course correct a few things.

Will come in handy when parsing imported in-between parsing from one module to the next.

improve parser

Consolidate lexing functions into one function, parsing into one, etc... intial skeleton of parser.

we should probably parse the numbers manually, first WIP number parser, with coments.

also match string literal allocations with integer values(index into memory) to make it easier t...

discard direct line, column tracking, we can rebuild those on demand(on exceptions) as long as w...

use a blazing fast hash for operator tokens instead of a substr sequence. We can do the same for...

getting closer to a 1-to-1 x86 assembly bytecode interpreter, hopefully this will make it easier...

- Split builtin primitive objects into two types, plain(POJO) and
dictionary(hashmaps), in doing...

Current: ~19ms.
Before: 30ms.

JavaScript (V8 NON-JIT): ~55ms.
JavaScript (V8 JIT): ~15ms.
Pytho...

- ignore binaries.

- Codify arrays and objects as immutable.