ovm - ARCHIVED - A stack based virtual machine to act as a target for other programming languages

Age	Commit message (Collapse)	Author
2023-11-03	Symbols may now include digits in lexer	Aryadev Chavali
	This is mostly so labels get to have digits. This won't affect number tokens as that happens before symbols.
2023-11-03	Added a start address (equivalent to `main`) to assembler	Aryadev Chavali
	Creates a jump address to the label delegated by "global" so program starts at that point.
2023-11-02	Implemented CALL(_STACK) and RET on the assembler	Aryadev Chavali

2023-11-02	Made lexer more error prone so parser is less	Aryadev Chavali
	Lexer now will straight away attempt to eat up any type or later portions of an opcode rather than leaving everything but the root. This means checking for type in the parser is a direct check against the name rather than prefixed with a dot. Checks are a bit more strong to cause more tokens to go straight to symbol rather than getting checked after one routine in at on the parser side.
2023-11-02	Made separate tokens for JUMP_ABS and JUMP_STACK	Aryadev Chavali
	Makes more sense, don't need to fiddle around with strings as much in the parser due to this!
2023-11-02	Removed instruction OP_JUMP_REGISTER	Aryadev Chavali
	Not necessary when you can just push the relevant word onto the stack then just do OP_JUMP_STACK.
2023-11-02	Started work on preprocessing jump addresses	Aryadev Chavali

2023-11-01	Implemented MALLOC_STACK and SUB in the assembler	Aryadev Chavali

2023-11-01	Implemented stack versions of MGET and MSET in assembler	Aryadev Chavali

2023-11-01	Implemented OP_MSIZE into lexer/parser of ASM	Aryadev Chavali

2023-11-01	Implemented lexer and parser for new memory management instructions	Aryadev Chavali

2023-11-01	Add MULT to lexer and parser for assembler	Aryadev Chavali

2023-11-01	Lexer now returns more descriptive tokens	Aryadev Chavali
	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.
2023-10-31	Allow hex literals for numbers	Aryadev Chavali
	As strto(ul\|ll) allow the parsing of hex literals of the form `0x`, we allow lexing of hex literals which start with `x`. They're lexed into C hex literals which work for strtol.
2023-10-31	Lexer now returns errors on failure	Aryadev Chavali
	Currently only for invalid character literals, but still a possible problem.
2023-10-28	Ignore comments (using semicolons) in lexer	Aryadev Chavali
	Easier to do it here than at the parser.
2023-10-28	Introduced a column and line for each token	Aryadev Chavali
	Accurate error reporting can be introduced using this.
2023-10-26	Added support in lexer for negative numbers	Aryadev Chavali
	Though we deal with unsigned numbers internally, it should be possible to read and manipulate negative numbers through 2s complement. Later on we'll add support for signed operations via 2s complement, so this should be allowed.
2023-10-26	Lexer forces uppercase for symbols	Aryadev Chavali

2023-10-26	Auto fill licenses	Aryadev Chavali

2023-10-26	Unified literal for numbers, main program now tokenises	Aryadev Chavali

2023-10-25	Separated lexer from main file in asm	Aryadev Chavali