1
0
mirror of https://github.com/catseye/SixtyPical.git synced 2024-11-22 17:32:01 +00:00
SixtyPical/README.markdown

64 lines
2.4 KiB
Markdown
Raw Normal View History

2014-03-31 22:31:30 +00:00
SixtyPical
==========
SixtyPical is a very low-level programming language, similar to 6502 assembly,
with static analysis through abstract interpretation.
In practice, this means it catches things like
* 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
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.
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
Documentation
-------------
2014-04-01 13:33:57 +00:00
2017-11-21 11:13:21 +00:00
* [Design Goals](doc/Design%20Goals.md)
* [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)
TODO
----
* `word table` type.
* `vector table` type.
* zero-page memory locations.
2015-10-18 18:02:07 +00:00
* indirect addressing.
2017-11-17 15:57:43 +00:00
* `low` and `high` address operators (turn `word` type into `byte`.) Possibly.
* save registers on stack or in memory (this preserves them = not trashed)
2015-10-18 18:02:07 +00:00
At some point...
* initialized `byte table` memory locations
* always analyze before executing or compiling, unless told not to
2015-10-23 15:37:18 +00:00
* `trash` instruction.
* `interrupt` routines.
* 6502-mnemonic aliases (`sec`, `clc`)
* other handy aliases (`eq` for `z`, etc.)
* 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.
* check and disallow recursion.
* automatic tail-call optimization (could be tricky, w/constraints?)
* re-order routines and optimize tail-calls to fallthroughs