mirror of
https://github.com/dschmenk/PLASMA.git
synced 2025-08-09 01:25:00 +00:00
Formatting
This commit is contained in:
@@ -5,6 +5,7 @@ LISP interpreted on a bytecode VM running on a 1 MHz 6502 is going to be sssllll
|
|||||||
## Missing features of LISP 1.5 in DRAWL
|
## Missing features of LISP 1.5 in DRAWL
|
||||||
|
|
||||||
- General recursion. The 6502 architecture limits recursion (but see tail recursion below), so don't expect too much here
|
- General recursion. The 6502 architecture limits recursion (but see tail recursion below), so don't expect too much here
|
||||||
|
- Many of the built-in functions from the LISP 1.5 manual. Most can be coded in LISP and loaded at startup
|
||||||
|
|
||||||
However, the code is partitioned to allow for easy extension so some of these missing features could be implemented.
|
However, the code is partitioned to allow for easy extension so some of these missing features could be implemented.
|
||||||
|
|
||||||
@@ -21,7 +22,7 @@ However, the code is partitioned to allow for easy extension so some of these mi
|
|||||||
- Bit-wise logic operations on 32 bit integers
|
- Bit-wise logic operations on 32 bit integers
|
||||||
- Hexadecimal input/output
|
- Hexadecimal input/output
|
||||||
|
|
||||||
The DRAWL implementation comes with the follwoing built-in:
|
The DRAWL implementation comes with the follwoing built-in functions:
|
||||||
|
|
||||||
### Constants
|
### Constants
|
||||||
- T = True
|
- T = True
|
||||||
@@ -81,9 +82,9 @@ The DRAWL implementation comes with the follwoing built-in:
|
|||||||
|
|
||||||
### Looping
|
### Looping
|
||||||
|
|
||||||
- FOR()
|
- FOR(...)
|
||||||
- WHILE()
|
- WHILE(...)
|
||||||
- UNTIL()
|
- UNTIL(...)
|
||||||
|
|
||||||
### Associations
|
### Associations
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user