permacomputing

Source repository for the main permacomputing wiki site
git clone http://git.permacomputing.net/repos/permacomputing.git # read-only access
Log | Files | Refs
commit cf577e441db16035b32d0da2fe519c8d07bd9931
parent 81a62685905961721c013e87741f5d3271dccd40
Author: neau <neau@web>
Date:   Wed, 22 Jun 2022 01:59:05 +0200

empty web commit

Diffstat:

Mstack-based.mdwn | 4+++-


1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/stack-based.mdwn b/stack-based.mdwn
@@ -1,4 +1,6 @@
-Stack machines are arguably the simplest kind architecture. Their LIFO structure is quite suitable for block-oriented languages. The code size for a stack machine can be very compact because most instructions have no operand field.
+Stack machines are arguably the simplest kind of computer architecture. Their LIFO structure is quite suitable for block-oriented languages. The code size for a stack machine can be very compact because most instructions have no operand field.
+
+## Primitives
 
 * POP Remove an item at index, closing the hole left in the stack.
 * ROLL Remove an item at index, push it on top of the stack.