2014-03-31 22:31:30 +00:00
|
|
|
SixtyPical
|
|
|
|
|
==========
|
|
|
|
|
|
2014-04-01 12:01:27 +00:00
|
|
|
SixtyPical is a very low-level programming language, similar to 6502 assembly,
|
2015-10-16 08:30:24 +00:00
|
|
|
with static analysis through abstract interpretation.
|
2014-04-01 12:01:27 +00:00
|
|
|
|
2015-10-16 08:30:24 +00:00
|
|
|
In practice, this means it catches things like
|
2014-04-01 12:01:27 +00:00
|
|
|
|
2015-10-16 08:30:24 +00:00
|
|
|
* you forgot to clear carry before adding something to the accumulator
|
|
|
|
|
* a subroutine that you call trashes a register you thought was preserved
|
2015-10-22 18:20:48 +00:00
|
|
|
* you tried to write the address of something that was not a routine, to
|
|
|
|
|
a jump vector
|
2014-04-04 17:27:51 +00:00
|
|
|
|
2015-10-22 18:20:48 +00:00
|
|
|
and suchlike. It also provides some convenient operations and abstractions
|
|
|
|
|
based on common machine-language programming idioms, such as
|
|
|
|
|
|
|
|
|
|
* copying values from one register to another (via a third register when
|
|
|
|
|
there are no underlying instructions that directly support it)
|
|
|
|
|
* explicit tail calls
|
|
|
|
|
* indirect subroutine calls
|
|
|
|
|
|
|
|
|
|
The reference implementation can execute, analyze, and compile SixtyPical
|
|
|
|
|
programs to 6502 machine code.
|
2014-04-11 21:50:03 +00:00
|
|
|
|
2015-10-16 08:30:24 +00:00
|
|
|
It is a **work in progress**, currently at the **proof-of-concept** stage.
|
2014-04-12 11:55:33 +00:00
|
|
|
|
2017-11-17 16:12:59 +00:00
|
|
|
The current development version of SixtyPical is 0.8-PRE.
|
2014-04-12 11:55:33 +00:00
|
|
|
|
2015-10-16 09:00:51 +00:00
|
|
|
Documentation
|
|
|
|
|
-------------
|
2014-04-01 13:33:57 +00:00
|
|
|
|
2017-11-21 11:13:21 +00:00
|
|
|
* [Design Goals](doc/Design%20Goals.md)
|
2015-10-16 09:54:12 +00:00
|
|
|
* [SixtyPical specification](doc/SixtyPical.md)
|
2017-11-21 11:13:21 +00:00
|
|
|
* [SixtyPical revision history](HISTORY.md)
|
2017-11-17 15:48:38 +00:00
|
|
|
* [Literate test suite for SixtyPical syntax](tests/SixtyPical%20Syntax.md)
|
|
|
|
|
* [Literate test suite for SixtyPical execution](tests/SixtyPical%20Execution.md)
|
|
|
|
|
* [Literate test suite for SixtyPical analysis](tests/SixtyPical%20Analysis.md)
|
|
|
|
|
* [Literate test suite for SixtyPical compilation](tests/SixtyPical%20Compilation.md)
|
|
|
|
|
* [6502 Opcodes used/not used in SixtyPical](doc/6502%20Opcodes.md)
|
2015-10-16 09:00:51 +00:00
|
|
|
|
|
|
|
|
TODO
|
|
|
|
|
----
|
|
|
|
|
|
2017-12-01 13:52:56 +00:00
|
|
|
Insist the buffer being read or written to through pointer, appears in approporiate set.
|
|
|
|
|
|
|
|
|
|
Add to pointer.
|
|
|
|
|
|
2017-11-23 17:08:40 +00:00
|
|
|
### `word table` and `vector table` types
|
|
|
|
|
|
|
|
|
|
### `low` and `high` address operators
|
2017-11-21 12:10:31 +00:00
|
|
|
|
2017-11-23 17:08:40 +00:00
|
|
|
To turn `word` type into `byte`.
|
2017-11-21 12:10:31 +00:00
|
|
|
|
2017-11-23 17:08:40 +00:00
|
|
|
### save registers on stack
|
2017-11-21 12:10:31 +00:00
|
|
|
|
2017-11-23 17:08:40 +00:00
|
|
|
This preserves them, so semantically, they can be used even though they
|
|
|
|
|
are trashed inside the block.
|
2017-11-21 12:10:31 +00:00
|
|
|
|
2017-11-23 17:08:40 +00:00
|
|
|
### And at some point...
|
2015-10-18 15:22:36 +00:00
|
|
|
|
2016-06-16 16:03:31 +00:00
|
|
|
* initialized `byte table` memory locations
|
2016-06-16 16:02:13 +00:00
|
|
|
* always analyze before executing or compiling, unless told not to
|
2015-10-23 15:37:18 +00:00
|
|
|
* `trash` instruction.
|
2015-10-19 12:04:08 +00:00
|
|
|
* `interrupt` routines.
|
2015-10-18 15:22:36 +00:00
|
|
|
* 6502-mnemonic aliases (`sec`, `clc`)
|
|
|
|
|
* other handy aliases (`eq` for `z`, etc.)
|
2015-10-19 12:04:08 +00:00
|
|
|
* have `copy` instruction able to copy a constant to a user-def mem loc, etc.
|
2015-10-18 18:02:07 +00:00
|
|
|
* add absolute addressing in shl/shr, absolute-indexed for add, sub, etc.
|
2015-10-18 18:41:26 +00:00
|
|
|
* check and disallow recursion.
|
2016-06-16 16:02:13 +00:00
|
|
|
* automatic tail-call optimization (could be tricky, w/constraints?)
|
|
|
|
|
* re-order routines and optimize tail-calls to fallthroughs
|
