6502/SixtyPical
1
0
Fork 0
mirror of https://github.com/catseye/SixtyPical.git synced 2024-11-25 23:49:17 +00:00
Code Issues Projects Releases Wiki Activity

Update notes in README

Browse Source
This commit is contained in:
Chris Pressey 2018-02-09 11:32:16 +00:00
parent ca1c877a60
commit 8e1153ebb0
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
README.md
View File

@ -74,12 +74,15 @@ is probably NP-complete. But doing it adeuqately is probably not that hard.
### And at some point...
* `const`s, that can be used in defining the size of tables, etc
* Remove the need for `forward` and `vector () table` (make grammar changes)
* Tests, and implementation, ensuring a routine can be assigned to a vector of "wider" type
* Check that the buffer being read or written to through pointer, appears in approporiate inputs or outputs set.
* `interrupt` routines -- to indicate that "the supervisor" has stored values on the stack, so we can trash them.
* error messages that include the line number of the source code
* add absolute addressing in shl/shr, absolute-indexed for add, sub, etc.
* automatic tail-call optimization (could be tricky, w/constraints?)
* `st a, [ptr] + y`, possibly `ld x, [ptr] + y`, possibly `st x, [ptr] + y`
* possibly `ld x, [ptr] + y`, possibly `st x, [ptr] + y`
* Maybe even `copy [ptra] + y, [ptrb] + y`, which can be compiled to indirect LDA then indirect STA!
Things it will not do