65 | 65 |
|
66 | 66 |
### And at some point...
|
67 | 67 |
|
68 | |
* `const`s, that can be used in defining the size of tables, etc
|
|
68 |
* `const`s that can be used in defining the size of tables, etc.
|
69 | 69 |
* Remove the need for `forward` and `vector () table` (make grammar changes)
|
70 | 70 |
* Tests, and implementation, ensuring a routine can be assigned to a vector of "wider" type
|
71 | 71 |
* Check that the buffer being read or written to through pointer, appears in approporiate inputs or outputs set.
|
|
72 |
(Associate each pointer with the buffer it points into.)
|
|
73 |
* `static` pointers -- currently not possible because pointers must be zero-page, thus `@`, thus uninitialized.
|
72 | 74 |
* `interrupt` routines -- to indicate that "the supervisor" has stored values on the stack, so we can trash them.
|
73 | |
* error messages that include the line number of the source code
|
74 | |
* add absolute addressing in shl/shr, absolute-indexed for add, sub, etc.
|
75 | |
* automatic tail-call optimization (could be tricky, w/constraints?)
|
76 | |
* possibly `ld x, [ptr] + y`, possibly `st x, [ptr] + y`
|
|
75 |
* Error messages that include the line number of the source code.
|
|
76 |
* Add absolute addressing in shl/shr, absolute-indexed for add, sub, etc.
|
|
77 |
* Automatic tail-call optimization (could be tricky, w/constraints?)
|
|
78 |
* Possibly `ld x, [ptr] + y`, possibly `st x, [ptr] + y`.
|
77 | 79 |
* Maybe even `copy [ptra] + y, [ptrb] + y`, which can be compiled to indirect LDA then indirect STA!
|
78 | |
|
79 | |
Things it will not do
|
80 | |
---------------------
|
81 | |
|
82 | |
(this will be moved to a FAQ document at some point)
|
83 | |
|
84 | |
* Check that a vector is initialized before it's called.
|
85 | |
* Check for recursive calls, or prevent bad things happening because of recursive calls.
|
86 | |
(You can always recursively call yourself through a vector.)
|