2017-11-20 14:10:43 +00:00
|
|
|
SixtyPical Syntax
|
|
|
|
=================
|
2015-10-17 12:50:21 +00:00
|
|
|
|
|
|
|
This is a test suite, written in [Falderal][] format, for the syntax of
|
|
|
|
the Sixtypical language, disgregarding execution, static analysis, etc.
|
|
|
|
|
2015-10-20 08:33:30 +00:00
|
|
|
Note that these example programs are intended to be syntactically correct,
|
|
|
|
but not necessarily sensible programs.
|
|
|
|
|
2015-10-17 12:50:21 +00:00
|
|
|
[Falderal]: http://catseye.tc/node/Falderal
|
|
|
|
|
2017-11-20 14:10:43 +00:00
|
|
|
-> Functionality "Check syntax of SixtyPical program" is implemented by
|
2018-02-06 16:14:44 +00:00
|
|
|
-> shell command "bin/sixtypical --parse-only --traceback %(test-body-file) && echo ok"
|
2015-10-17 12:50:21 +00:00
|
|
|
|
2017-11-20 14:10:43 +00:00
|
|
|
-> Tests for functionality "Check syntax of SixtyPical program"
|
2015-10-17 12:50:21 +00:00
|
|
|
|
|
|
|
Rudimentary program.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, 0
|
|
|
|
| add a, 1
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2015-10-18 17:54:28 +00:00
|
|
|
Program with comments.
|
|
|
|
|
|
|
|
| // Welcome to my program.
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, 0
|
|
|
|
| add a, 1 // We are adding the thing.
|
2018-04-18 11:01:53 +00:00
|
|
|
| sub a, 1
|
|
|
|
| shl a
|
|
|
|
| shr a
|
|
|
|
| and a, 1
|
|
|
|
| or a, 1
|
|
|
|
| xor a, 1
|
2015-10-18 17:54:28 +00:00
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2015-10-18 17:47:47 +00:00
|
|
|
Hex literals.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, $ff
|
|
|
|
| add a, $01
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Syntax error.
|
2015-10-17 12:50:21 +00:00
|
|
|
|
|
|
|
| routine foo (
|
|
|
|
| ld a, 0
|
|
|
|
| add a, 1
|
|
|
|
| )
|
|
|
|
? SyntaxError
|
|
|
|
|
2015-10-18 17:47:47 +00:00
|
|
|
Another syntax error.
|
2015-10-18 15:22:36 +00:00
|
|
|
|
|
|
|
| byte glee
|
|
|
|
| {
|
|
|
|
| ld a, 0
|
|
|
|
| add a, 1
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2015-10-17 12:50:21 +00:00
|
|
|
Extern routines
|
|
|
|
|
|
|
|
| routine chrout
|
|
|
|
| inputs a
|
|
|
|
| trashes a
|
|
|
|
| @ 65490
|
|
|
|
|
|
|
|
|
| routine chrin
|
|
|
|
| outputs a
|
|
|
|
| trashes x
|
|
|
|
| @ 65487
|
|
|
|
= ok
|
2015-10-18 12:37:35 +00:00
|
|
|
|
2017-12-13 15:23:06 +00:00
|
|
|
Trash.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| trash a
|
|
|
|
| trash n
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2018-03-28 13:52:16 +00:00
|
|
|
`nop`.
|
|
|
|
|
|
|
|
| routine main
|
|
|
|
| {
|
|
|
|
| nop
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2015-10-18 12:37:35 +00:00
|
|
|
If with not
|
|
|
|
|
|
|
|
| routine foo {
|
|
|
|
| ld y, 0
|
|
|
|
| cmp y, 10
|
|
|
|
| if not z {
|
|
|
|
| inc y
|
|
|
|
| cmp y, 10
|
|
|
|
| }
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Repeat loop
|
|
|
|
|
|
|
|
| routine foo {
|
|
|
|
| ld y, 0
|
|
|
|
| repeat {
|
|
|
|
| inc y
|
|
|
|
| cmp y, 10
|
|
|
|
| } until z
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
"While" loop
|
|
|
|
|
|
|
|
| routine foo inputs y {
|
|
|
|
| repeat {
|
|
|
|
| cmp y, 10
|
|
|
|
| if not z {
|
|
|
|
| inc y
|
|
|
|
| }
|
2015-10-18 14:32:28 +00:00
|
|
|
| } until z
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Repeat forever
|
|
|
|
|
|
|
|
| routine foo inputs y {
|
|
|
|
| repeat {
|
|
|
|
| inc y
|
|
|
|
| } forever
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Repeat with not
|
|
|
|
|
|
|
|
| routine foo inputs y {
|
|
|
|
| repeat {
|
|
|
|
| inc y
|
|
|
|
| } until not z
|
2015-10-18 12:37:35 +00:00
|
|
|
| }
|
|
|
|
= ok
|
2015-10-18 15:22:36 +00:00
|
|
|
|
2018-03-08 16:54:12 +00:00
|
|
|
Basic "open-faced for" loops, up and down.
|
|
|
|
|
|
|
|
| byte table[256] tab
|
|
|
|
|
|
|
|
|
| routine foo trashes a, x, c, z, v {
|
|
|
|
| ld x, 0
|
2018-03-14 09:51:24 +00:00
|
|
|
| for x up to 15 {
|
2018-03-08 16:54:12 +00:00
|
|
|
| ld a, tab + x
|
|
|
|
| }
|
|
|
|
| ld x, 15
|
2018-03-14 09:51:24 +00:00
|
|
|
| for x down to 0 {
|
2018-03-08 16:54:12 +00:00
|
|
|
| ld a, tab + x
|
|
|
|
| }
|
|
|
|
| }
|
2018-04-19 12:18:52 +00:00
|
|
|
= ok
|
|
|
|
|
|
|
|
Other blocks.
|
|
|
|
|
|
|
|
| routine main trashes a, x, c, z, v {
|
|
|
|
| with interrupts off {
|
|
|
|
| save a, x, c {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
| }
|
|
|
|
| save a, x, c {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
| }
|
2018-03-08 16:54:12 +00:00
|
|
|
= ok
|
|
|
|
|
2017-11-24 11:30:20 +00:00
|
|
|
User-defined memory addresses of different types.
|
|
|
|
|
|
|
|
| byte byt
|
|
|
|
| word wor
|
2018-02-05 17:01:25 +00:00
|
|
|
| vector routine trashes a vec
|
2017-11-24 11:30:20 +00:00
|
|
|
| buffer[2048] buf
|
|
|
|
| pointer ptr
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2018-04-18 13:21:03 +00:00
|
|
|
Tables of different types and some operations on them.
|
2018-02-05 17:01:25 +00:00
|
|
|
|
2018-04-18 13:21:03 +00:00
|
|
|
| byte table[256] many
|
|
|
|
| word table[256] wmany
|
|
|
|
| vector (routine trashes a) table[256] vmany
|
2018-02-05 17:01:25 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
2018-04-18 13:21:03 +00:00
|
|
|
| ld x, 0
|
|
|
|
| ld a, 0
|
|
|
|
| st off, c
|
|
|
|
| add a, many + x
|
|
|
|
| sub a, many + x
|
|
|
|
| cmp a, many + x
|
|
|
|
| and a, many + x
|
|
|
|
| or a, many + x
|
|
|
|
| xor a, many + x
|
|
|
|
| shl many + x
|
|
|
|
| shr many + x
|
|
|
|
| inc many + x
|
|
|
|
| dec many + x
|
2018-02-05 17:01:25 +00:00
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2018-03-05 10:38:20 +00:00
|
|
|
The number of entries in a table must be
|
|
|
|
greater than 0 and less than or equal to 256.
|
2018-02-14 13:53:22 +00:00
|
|
|
|
|
|
|
| word table[512] many
|
|
|
|
|
|
|
|
|
| routine main
|
|
|
|
| inputs many
|
|
|
|
| outputs many
|
|
|
|
| trashes a, x, n, z
|
|
|
|
| {
|
|
|
|
| ld x, 0
|
|
|
|
| copy 9999, many + x
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2018-03-05 10:38:20 +00:00
|
|
|
| word table[0] many
|
2018-02-14 13:53:22 +00:00
|
|
|
|
|
|
|
|
| routine main
|
|
|
|
| inputs many
|
|
|
|
| outputs many
|
|
|
|
| trashes a, x, n, z
|
|
|
|
| {
|
|
|
|
| ld x, 0
|
|
|
|
| copy 9999, many + x
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2018-03-05 10:38:20 +00:00
|
|
|
| word table[48] many
|
2018-02-14 13:53:22 +00:00
|
|
|
|
|
|
|
|
| routine main
|
|
|
|
| inputs many
|
|
|
|
| outputs many
|
|
|
|
| trashes a, x, n, z
|
|
|
|
| {
|
|
|
|
| ld x, 0
|
|
|
|
| copy 9999, many + x
|
|
|
|
| }
|
2018-03-05 10:38:20 +00:00
|
|
|
= ok
|
2018-02-14 13:53:22 +00:00
|
|
|
|
2018-02-05 18:12:48 +00:00
|
|
|
Typedefs of different types.
|
|
|
|
|
|
|
|
| typedef byte octet
|
2018-02-06 11:34:21 +00:00
|
|
|
| typedef octet table[256] twokay
|
2018-02-05 18:12:48 +00:00
|
|
|
| typedef routine trashes a game_routine
|
|
|
|
| vector game_routine start_game
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Can't have two typedefs with the same name.
|
|
|
|
|
|
|
|
| typedef byte frank
|
|
|
|
| typedef word frank
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2018-03-27 11:36:33 +00:00
|
|
|
Constants.
|
|
|
|
|
|
|
|
| const lives 3
|
|
|
|
| const days lives
|
|
|
|
| const w1 1000
|
|
|
|
| const w2 word 0
|
|
|
|
|
|
|
|
|
| typedef byte table[days] them
|
|
|
|
|
|
|
|
|
| byte lark: lives
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, lives
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Can't have two constants with the same name.
|
|
|
|
|
|
|
|
| const w1 1000
|
|
|
|
| const w1 word 0
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2016-06-16 16:03:31 +00:00
|
|
|
Explicit memory address.
|
2015-10-18 15:22:36 +00:00
|
|
|
|
|
|
|
| byte screen @ 1024
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, 100
|
|
|
|
| st a, screen
|
2018-04-18 11:01:53 +00:00
|
|
|
| shl screen
|
|
|
|
| shr screen
|
2015-10-18 15:22:36 +00:00
|
|
|
| }
|
|
|
|
= ok
|
2015-10-18 16:32:12 +00:00
|
|
|
|
2016-06-16 16:02:13 +00:00
|
|
|
Initialized memory locations.
|
|
|
|
|
2016-06-16 16:03:31 +00:00
|
|
|
| byte lives : 3
|
2016-06-16 16:02:13 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, lives
|
|
|
|
| st a, lives
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2016-06-16 16:10:43 +00:00
|
|
|
Cannot have both initial value and explicit address.
|
|
|
|
|
|
|
|
| byte screen : 3 @ 1024
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, lives
|
|
|
|
| st a, lives
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2016-06-16 16:08:57 +00:00
|
|
|
User-defined locations of other types.
|
|
|
|
|
2018-02-06 11:34:21 +00:00
|
|
|
| byte table[256] screen @ 1024
|
2016-06-16 16:08:57 +00:00
|
|
|
| word r1
|
|
|
|
| word r2 @ 60000
|
|
|
|
| word r3 : 2000
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2018-03-29 09:45:18 +00:00
|
|
|
Initialized byte table, initialized with ASCII string.
|
2017-12-12 16:41:49 +00:00
|
|
|
|
2018-02-06 11:34:21 +00:00
|
|
|
| byte table[32] message : "WHAT DO YOU WANT TO DO NEXT?"
|
2017-12-12 16:41:49 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Can't initialize anything but a byte table with a string.
|
|
|
|
|
|
|
|
| word message : "WHAT DO YOU WANT TO DO NEXT?"
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2018-03-29 09:45:18 +00:00
|
|
|
Initialized byte table, initialized with list of bytes.
|
|
|
|
|
|
|
|
| byte table[8] charmap : 0, 255, 129, 192, 0, 1, 2, 4
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2015-10-18 16:32:12 +00:00
|
|
|
Can't access an undeclared memory location.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, 0
|
|
|
|
| st a, lives
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
|
|
|
Can't define two memory locations with the same name.
|
|
|
|
|
|
|
|
| byte lives
|
|
|
|
| byte lives
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld a, 0
|
|
|
|
| st a, lives
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
|
|
|
Can't shadow the name of a register or a flag.
|
|
|
|
|
|
|
|
| byte a
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
|
|
|
| byte z
|
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2015-10-19 11:22:44 +00:00
|
|
|
Can't call routine that hasn't been defined.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld x, 0
|
|
|
|
| ld y, 1
|
|
|
|
| call up
|
|
|
|
| call up
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2017-12-12 13:17:00 +00:00
|
|
|
But you can call a routine that is yet to be defined, further on.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld x, 0
|
|
|
|
| ld y, 1
|
|
|
|
| call up
|
|
|
|
| call up
|
|
|
|
| }
|
|
|
|
| routine up {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2015-10-18 16:32:12 +00:00
|
|
|
Can't define two routines with the same name.
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| inc x
|
|
|
|
| inc y
|
|
|
|
| }
|
|
|
|
| routine main {
|
|
|
|
| ld x, 0
|
|
|
|
| ld y, 1
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
2015-10-18 16:40:53 +00:00
|
|
|
|
2017-12-08 13:41:48 +00:00
|
|
|
Declaring byte and word table memory location.
|
2015-10-18 16:40:53 +00:00
|
|
|
|
2018-02-06 11:34:21 +00:00
|
|
|
| byte table[256] tab
|
2015-10-18 16:40:53 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld x, 0
|
|
|
|
| ld y, 0
|
|
|
|
| ld a, tab + x
|
|
|
|
| st a, tab + y
|
|
|
|
| }
|
|
|
|
= ok
|
2015-10-18 18:41:26 +00:00
|
|
|
|
2017-12-08 13:41:48 +00:00
|
|
|
| word one
|
2018-02-06 11:34:21 +00:00
|
|
|
| word table[256] many
|
2017-12-08 13:41:48 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| ld x, 0
|
|
|
|
| copy one, many + x
|
|
|
|
| copy word 0, many + x
|
|
|
|
| copy many + x, one
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2015-10-20 08:33:30 +00:00
|
|
|
Declaring and calling a vector.
|
2015-10-18 18:41:26 +00:00
|
|
|
|
2018-02-05 17:01:25 +00:00
|
|
|
| vector routine
|
2015-10-19 12:04:08 +00:00
|
|
|
| inputs a
|
|
|
|
| outputs x
|
|
|
|
| trashes a, x, z, n
|
2018-02-05 17:01:25 +00:00
|
|
|
| cinv @ 788
|
2015-10-18 18:41:26 +00:00
|
|
|
|
|
|
|
|
| routine foo {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
| routine main {
|
2015-10-18 22:15:40 +00:00
|
|
|
| with interrupts off {
|
|
|
|
| copy foo, cinv
|
|
|
|
| }
|
2015-10-20 08:33:30 +00:00
|
|
|
| call cinv
|
2015-10-18 18:41:26 +00:00
|
|
|
| }
|
|
|
|
= ok
|
2015-10-19 12:04:08 +00:00
|
|
|
|
|
|
|
Only vectors can be decorated with constraints like that.
|
|
|
|
|
2018-02-05 11:18:35 +00:00
|
|
|
| byte cinv
|
2015-10-19 12:04:08 +00:00
|
|
|
| inputs a
|
|
|
|
| outputs x
|
|
|
|
| trashes a, x, z, n
|
2018-02-05 11:18:35 +00:00
|
|
|
| @ 788
|
2015-10-19 12:04:08 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
2015-10-20 13:10:33 +00:00
|
|
|
|
2017-12-11 17:49:02 +00:00
|
|
|
Constraints set may only contain labels.
|
|
|
|
|
2018-02-05 17:01:25 +00:00
|
|
|
| vector routine
|
2017-12-11 17:49:02 +00:00
|
|
|
| inputs a
|
|
|
|
| outputs 200
|
|
|
|
| trashes a, x, z, n
|
2018-02-05 17:01:25 +00:00
|
|
|
| cinv @ 788
|
2017-12-11 17:49:02 +00:00
|
|
|
|
|
|
|
|
| routine foo {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
| routine main {
|
|
|
|
| with interrupts off {
|
|
|
|
| copy foo, cinv
|
|
|
|
| }
|
|
|
|
| call cinv
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2017-12-11 16:57:18 +00:00
|
|
|
A vector can name itself in its inputs, outputs, and trashes.
|
|
|
|
|
2018-02-05 17:01:25 +00:00
|
|
|
| vector routine
|
2017-12-11 16:57:18 +00:00
|
|
|
| inputs cinv, a
|
|
|
|
| outputs cinv, x
|
|
|
|
| trashes a, x, z, n
|
2018-02-05 17:01:25 +00:00
|
|
|
| cinv @ 788
|
2017-12-11 16:57:18 +00:00
|
|
|
|
|
|
|
|
| routine foo {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
| routine main {
|
|
|
|
| with interrupts off {
|
|
|
|
| copy foo, cinv
|
|
|
|
| }
|
|
|
|
| call cinv
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2018-02-12 15:59:20 +00:00
|
|
|
A routine can be copied into a vector before the routine appears in the program.
|
|
|
|
This is known as a "forward reference". You are only allowed to make forward
|
|
|
|
references in the source of a `copy` instruction.
|
2017-12-12 14:09:17 +00:00
|
|
|
|
2018-02-05 17:01:25 +00:00
|
|
|
| vector routine
|
2018-02-02 17:16:31 +00:00
|
|
|
| inputs cinv, a
|
|
|
|
| outputs cinv, x
|
|
|
|
| trashes a, x, z, n
|
2018-02-05 17:01:25 +00:00
|
|
|
| cinv @ 788
|
2017-12-12 14:23:34 +00:00
|
|
|
| routine main {
|
|
|
|
| with interrupts off {
|
|
|
|
| copy foo, cinv
|
|
|
|
| }
|
|
|
|
| call cinv
|
|
|
|
| }
|
|
|
|
| routine foo {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
2017-12-12 14:09:17 +00:00
|
|
|
= ok
|
|
|
|
|
2015-10-20 13:10:33 +00:00
|
|
|
goto.
|
|
|
|
|
|
|
|
| routine foo {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
| routine main {
|
|
|
|
| goto foo
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2017-12-12 13:17:00 +00:00
|
|
|
| routine main {
|
|
|
|
| goto foo
|
|
|
|
| }
|
|
|
|
| routine foo {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
2018-02-05 17:01:25 +00:00
|
|
|
| vector routine foo
|
2015-10-20 13:10:33 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| goto foo
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
| routine main {
|
|
|
|
| goto foo
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
2017-11-24 12:35:36 +00:00
|
|
|
Buffers and pointers.
|
|
|
|
|
|
|
|
| buffer[2048] buf
|
|
|
|
| pointer ptr
|
2018-04-18 09:57:57 +00:00
|
|
|
| pointer ptrb
|
2017-12-01 13:52:56 +00:00
|
|
|
| byte foo
|
2017-11-24 12:35:36 +00:00
|
|
|
|
|
|
|
|
| routine main {
|
2017-12-01 12:36:58 +00:00
|
|
|
| copy ^buf, ptr
|
2017-11-24 12:35:36 +00:00
|
|
|
| copy 123, [ptr] + y
|
2017-12-01 13:52:56 +00:00
|
|
|
| copy [ptr] + y, foo
|
2018-04-18 09:57:57 +00:00
|
|
|
| copy [ptr] + y, [ptrb] + y
|
2017-11-24 12:35:36 +00:00
|
|
|
| }
|
|
|
|
= ok
|
2018-02-06 11:52:50 +00:00
|
|
|
|
|
|
|
Routines can be defined in a new style.
|
|
|
|
|
|
|
|
| typedef routine
|
|
|
|
| inputs x
|
|
|
|
| outputs x
|
|
|
|
| trashes z, n
|
|
|
|
| routine_type
|
|
|
|
|
|
|
|
|
| vector routine_type vec
|
|
|
|
|
|
|
|
|
| define foo routine
|
|
|
|
| inputs x
|
|
|
|
| outputs x
|
|
|
|
| trashes z, n
|
|
|
|
| {
|
|
|
|
| inc x
|
|
|
|
| }
|
|
|
|
|
|
|
|
|
| routine main
|
|
|
|
| outputs vec
|
|
|
|
| trashes a, z, n
|
|
|
|
| {
|
|
|
|
| copy foo, vec
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Only routines can be defined in the new style.
|
|
|
|
|
|
|
|
| define foo byte table[256]
|
|
|
|
|
|
|
|
|
| routine main
|
|
|
|
| trashes a, z, n
|
|
|
|
| {
|
|
|
|
| ld a, 0
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
2018-02-09 12:33:45 +00:00
|
|
|
|
|
|
|
Memory locations can be defined static to a routine.
|
|
|
|
|
|
|
|
| define foo routine
|
|
|
|
| inputs x
|
|
|
|
| outputs x
|
|
|
|
| trashes z, n
|
|
|
|
| static byte t : 0
|
|
|
|
| {
|
|
|
|
| st x, t
|
|
|
|
| inc t
|
|
|
|
| ld x, t
|
|
|
|
| }
|
|
|
|
|
|
|
|
|
| define main routine
|
|
|
|
| trashes a, x, z, n
|
|
|
|
| static byte t : 0
|
|
|
|
| {
|
|
|
|
| ld x, t
|
|
|
|
| call foo
|
|
|
|
| }
|
|
|
|
= ok
|
|
|
|
|
|
|
|
Static memory locations must always be given an initial value.
|
|
|
|
|
|
|
|
| define main routine
|
|
|
|
| inputs x
|
|
|
|
| outputs x
|
|
|
|
| trashes z, n
|
|
|
|
| static byte t
|
|
|
|
| {
|
|
|
|
| st x, t
|
|
|
|
| inc t
|
|
|
|
| ld x, t
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
|
|
|
Name of a static cannot shadow an existing global or static.
|
|
|
|
|
|
|
|
| byte t
|
|
|
|
|
|
|
|
|
| define main routine
|
|
|
|
| inputs x
|
|
|
|
| outputs x
|
|
|
|
| trashes z, n
|
|
|
|
| static byte t
|
|
|
|
| {
|
|
|
|
| st x, t
|
|
|
|
| inc t
|
|
|
|
| ld x, t
|
|
|
|
| }
|
|
|
|
? SyntaxError
|
|
|
|
|
|
|
|
| define main routine
|
|
|
|
| inputs x
|
|
|
|
| outputs x
|
|
|
|
| trashes z, n
|
|
|
|
| static byte t
|
|
|
|
| static byte t
|
|
|
|
| {
|
|
|
|
| st x, t
|
|
|
|
| inc t
|
|
|
|
| ld x, t
|
|
|
|
| }
|
|
|
|
? SyntaxError
|