Content deleted Content added
→Syntax: Added the minimum size of the stack required for the different operations Tags: nowiki added Visual edit |
|||
Line 50:
|-
! IMP !! Operator !! Parameter !! Meaning
!Minimum size of the stack required*
|-
| [Space] || [Space] || Number || Push the number onto the stack
|0
|-
| [Space] || [LF][Space] || - || Duplicate the top item on the stack
|1
|-
| [Space] || [Tab][Space] || Number
|''n''+1
|-
| [Space] || [LF][Tab] || - || Swap the top two items on the stack
|2
|-
| [Space] || [LF][LF] || - || Discard the top item on the stack
|1
|-
| [Space] || [Tab][LF] || Number
|may be less than '''''n''+1''',
but at least 1 item
(top of the stack)
is required
|-
| [Tab][Space] || [Space][Space] || - || Addition
|2
|-
| [Tab][Space] || [Space][Tab] || - || Subtraction
|2
|-
| [Tab][Space] || [Space][LF] || - || Multiplication
|2
|-
| [Tab][Space] || [Tab][Space] || - || Integer division
|2 (top may not be 0)
|-
| [Tab][Space] || [Tab][Tab] || - ||[[Modulo operation|Modulo]]
|2 (top may not be 0)
|-
| [Tab][Tab] || [Space] || - || Store in heap
|2
|-
| [Tab][Tab] || [Tab] || - || Retrieve from heap
|1
|-
| [LF] || [Space][Space] || Label || Mark a ___location in the program
|0
|-
| [LF] || [Space][Tab] || Label || Call a subroutine
|0
|-
| [LF] || [Space][LF] || Label || Jump to a label
|0
|-
| [LF] || [Tab][Space] || Label || Jump to a label if the top of the stack is zero
|1
|-
| [LF] || [Tab][Tab] || Label || Jump to a label if the top of the stack is negative
|1
|-
| [LF] || [Tab][LF] || - || End a subroutine and transfer control back to the caller
|0 ''(callstack: 1)''
|-
| [LF] || [LF][LF] || - || End the program
|0
|-
| [Tab][LF] || [Space][Space] || - || Output the character at the top of the stack
|1
|-
| [Tab][LF] || [Space][Tab] || - || Output the number at the top of the stack
|1
|-
| [Tab][LF] || [Tab][Space] || - || Read a character and place it in the ___location given by the top of the stack
|1
|-
| [Tab][LF] || [Tab][Tab] || - || Read a number and place it in the ___location given by the top of the stack
|1
|}
<nowiki>*</nowiki>Due to Haskell being lazily evaluated, the effect of the the stack being too small may only show when, for example, invoking the ''outputting a number'' side-effect.
The ''copy'' and ''slide'' operations were added in Whitespace 0.3.<ref name="whitespace"/>▼
▲<nowiki>**</nowiki>The ''copy'' and ''slide'' operations were added in Whitespace 0.3.<ref name="whitespace" />
=== Comments ===
| |||