mirror of
https://github.com/catseye/SixtyPical.git
synced 2024-09-01 21:29:07 +00:00
4.5 KiB
4.5 KiB
History of SixtyPical
0.12
copy
is now understood to trasha
, thuscopy ..., a
is not valid. Indirect addressing is supported inld
, as inld a, [ptr] + y
, to compensate.
0.11
- Each table has a specified size now (although, bounds checking is not performed.)
- Initialized
byte table
values need not have all 256 bytes initialized. - Syntax for types has changed.
routine
(with constraints) is a type, whilevector
is now a type constructor (takingroutine
s only) andtable
is also a type constructor. This permits a newvector table
type. - Added
typedef
, allowing the user to define type aliases for readability. - Added
define name routine {...}
syntax;routine name {...}
is now legacy. - Ability to copy vectors and routines into vector tables, and vectors out of same.
- Removed the evaluator. The reference implementation only analyzes and compiles.
- Fixed bug where index register wasn't required to be initialized before table access.
- Fixed bug where trampolines for indirect calls weren't including a final
RTS
.
0.10
- Can
call
andgoto
routines that are defined further down in the source code. - The
forward
modifier can also be used to indicate that the symbol being copied in acopy
to a vector is a routine that is defined further down in the source. - Initialized
word
memory locations. - Can
copy
a literal word to a word table. - Subtract word (constant or memory location) from word memory location.
trash
instruction explicitly indicates a value is no longer considered meaningful.copy []+y, a
can indirectly read a byte value into thea
register.- Initialized
byte table
memory locations. - Fixed bug which was preventing
if
branches to diverge in what they initialized, if it was already initialized when going into theif
. - Fixed a bug which was making it crash when trying to analyze
repeat forever
loops.
0.9
- Add word (constant or memory location) to word memory location.
- Add word to pointer (unchecked for now).
- Added
word table
type. - Can
copy
from word storage location to word table and back. - A
vector
can name itself in itsinputs
andoutputs
ortrashes
sets. - Implementation:
--debug
shows some extra info during analysis. - Fixed bug where
copy
ing literal word into word storage used wrong endianness. - Fixed bug where every memory location was allocated 2 bytes of storage, regardless of type.
- Tests: use https://github.com/tcarmelveilleux/dcc6502 to disassemble code for comparison.
0.8
- Explicit word literals prefixed with
word
token. - Can
copy
literals into user-defined destinations. - Fixed bug where loop variable wasn't being checked at end of
repeat
loop. buffer
andpointer
types.copy ^
syntax to load the addr of a buffer into a pointer.copy []+y
syntax to read and write values to and from memory through a pointer.
0.7
- User-defined
byte
locations can be given an initial value. word
type locations which can be defined andcopy
ed between.- Can
copy
directly from one user-definedbyte
location to another.
0.6
- Added
routine
andvector
types, andcopy
instruction. - Both routines and vectors can declare
inputs
,outputs
, andtrashes
, and these must be compatible to assign a routine or vector to a vector. - Added
goto
(tail call) instruction, jumps to routine or through vector. call
can call a subroutine indirectly, via a vector.- Routine name is now shown in analysis error messages.
0.5
- Added
byte table
type locations and indexed addressing (+ x
,+ y
). - Integer literals may be given in hexadecimal.
- Line comments may be included in source code by prefixing them with
//
.
0.4
- Added
repeat
loops to the language, which can repeat until a flag is set (ornot
set), or which can repeatforever
. if not
inverts the sense of the test.- Added explicitly-addressed memory locations.
0.3
- Added external routine declarations.
- Added ability to compile to 6502 machine code and output a
PRG
file.
0.2
A complete reboot of SixtyPical 0.1. The reference implementation was rewritten in Python. The language was much simplified. The aim was to get the analysis completely right before adding more sophisticated and useful features in future versions.
0.1
Initial inspired-but-messy version implemented in Haskell.