Documentation fix (thanks D. Joe)

This commit is contained in:
Neale Pickett 2013-02-26 22:26:25 -07:00
parent 62a5d85f9a
commit 60e48c2b90
1 changed files with 7 additions and 7 deletions

View File

@ -13,12 +13,12 @@ Forf was heavily influenced by the PostScript programming language.
About Stacks About Stacks
============ ============
Central to the operation of Forf is the notion of a stack, or queue. A Central to the operation of Forf is the notion of a stack. A stack is a
stack is a first-in-first-out (FIFO) list, like a stack of dishes. last-in-first-out (LIFO) list, like a stack of dishes. Items can be
Items can be "pushed" onto the top of the stack, or "popped" off the top "pushed" onto the top of the stack, or "popped" off the top of the stack.
of the stack. Items may only be pushed or popped, meaning the top stack Items may only be pushed or popped, meaning the top stack element is the
element is the only element that can be accessed. To get to the third only element that can be accessed. To get to the third item down in a
item down in a stack, it is necessary to first pop two items off. stack, it is necessary to first pop two items off.
Data Types Data Types
@ -51,7 +51,7 @@ procedures is evaluated, it pops zero or more elements off the data
stack, does something with them, and then pushes zero or more elements stack, does something with them, and then pushes zero or more elements
back onto the stack. back onto the stack.
The "+" procudure, for instance, pops two values, adds them, and pushes The "+" procedure, for instance, pops two values, adds them, and pushes
the result. The following data stack: the result. The following data stack:
[bottom] 58 88 5 [top] [bottom] 58 88 5 [top]