📄 gtools.htm
字号:
<html>
<head>
<title>StrongForth.f Programming-Tools Glossary</title>
</head>
<body>
<h1>StrongForth.f Programming-Tools Glossary</h1>
<hr><p><pre><b>? ( -- )</b></pre></p>
<p>Interpretation: <b><kbd>( ADDRESS -- )</kbd></b>
<br>Display the value stored at <kbd>ADDRESS</kbd> by
performing the execution semantics of <kbd>@</kbd> and
<kbd>.</kbd>.</p>
<p>Compilation:
<br>Append the runtime semantics given below to the current
definition.</p>
<p>Runtime: <b><kbd>( ADDRESS -- )</kbd></b>
<br>Display the value stored at <kbd>ADDRESS</kbd> by
performing the execution semantics of <kbd>@</kbd> and
<kbd>.</kbd>.</p>
<p><kbd>?</kbd> is an immediate word.</p>
<hr><p><pre><b>CS-PICK ( ORIG/DEST UNSIGNED -- 1ST DEST )</b></pre></p>
<p>Interpretation:<br>
Interpretation semantics for this word are undefined.</p>
<p>Execution:
<br>Remove <kbd>UNSIGNED</kbd>. Copy <kbd>DEST</kbd> to the top of
the control-flow stack. <kbd>DEST</kbd> is idenditcal to the item at
position <kbd>UNSIGNED</kbd> of the control-flow stack. An ambiguous
condition exists if there are less than <kbd>UNSIGNED</kbd> plus one
items of data type <kbd>ORIG/DEST</kbd> on the control-flow stack
before <kbd>CS-PICK</kbd> is executed.</p>
<p>If the control-flow stack is implemented using the data stack,
<kbd>UNSIGNED</kbd> shall be the topmost item on the data stack.</p>
<hr><p><pre><b>CS-ROLL ( ORIG/DEST UNSIGNED -- ORIG/DEST )</b></pre></p>
<p>Interpretation:<br>
Interpretation semantics for this word are undefined.</p>
<p>Execution:
<br>Remove <kbd>UNSIGNED</kbd>. Rotate <kbd>UNSIGNED</kbd> plus one
elements on top of the control-flow stack so that the item at position
<kbd>UNSIGNED</kbd> is on top of the control-flow stack. An ambiguous
condition exists if there are less than <kbd>UNSIGNED</kbd> plus one
items of data type <kbd>ORIG/DEST</kbd> on the control-flow stack
before <kbd>CS-ROLL</kbd> is executed.</p>
<p>If the control-flow stack is implemented using the data stack,
<kbd>UNSIGNED</kbd> shall be the topmost item on the data stack.</p>
<hr><p><pre><b>DUMP ( ADDRESS UNSIGNED -- )</b></pre></p>
<p>Display the contents of <kbd>UNSIGNED</kbd> consecutive
address units starting at <kbd>ADDRESS</kbd>.</p>
<hr><p><pre><b>DUMP ( ADDRESS -> SINGLE UNSIGNED -- )</b></pre></p>
<p>Display the contents of <kbd>UNSIGNED</kbd> consecutive
memory cells starting at address <kbd>ADDRESS -> SINGLE</kbd>.</p>
<hr><p><pre><b>DUMP ( ADDRESS -> DOUBLE UNSIGNED -- )</b></pre></p>
<p>Display the contents of <kbd>UNSIGNED</kbd> consecutive
double memory cells starting at address <kbd>ADDRESS -> DOUBLE</kbd>.</p>
<hr><p><pre><b>DUMP ( CADDRESS UNSIGNED -- )</b></pre></p>
<p>Display <kbd>UNSIGNED</kbd> consecutive
characters starting at address <kbd>CADDRESS</kbd>.</p>
<hr><p><pre><b>EDITOR ( -- )</b></pre></p>
<p>Replace the first word list in the search order with a
word list that is reserved for the editor.</p>
<p><kbd>EDITOR</kbd> is a vocabulary.</p>
<hr><p><pre><b>SEE ( "<spaces><em>name</em>" -- )</b></pre></p>
<p>Skip leading space delimiters. Parse <em>name</em> delimited by a
space. Find <em>name</em>. Display a human-readable representation of
<em>name</em>'s definition, including its stack diagram.</p>
<hr><p><pre><b>WORDS ( "<spaces><em>name</em>" -- )</b></pre></p>
<p>List all names and stack diagrams of the definitions in the
first word list of the search order whose name are identical to
<em>name</em>. If the parameter <em>name</em> is not provided,
list all names and stack diagrams of all definitions in the
first word list of the search order. Each definition is displayed
on a separate line.</p>
<hr><p><pre><b>[ELSE] ( -- )</b></pre></p>
<p>Compilation:
<br>Perform the execution semantics given below.</p>
<p>Execution: <kbd><b>( "<spaces><em>name</em>" ... -- )</b></kbd>
<br>Skip leading spaces, parse and discard space-delimited words
from the parse area, including nested occurrences of
<kbd>[IF] ... [THEN]</kbd>
and <kbd>[IF] ... [ELSE] ... [THEN]</kbd>,
until the word <kbd>[THEN]</kbd> has been
parsed and discarded. If the parse area becomes exhausted, it is
refilled as with <kbd>REFILL</kbd>.</p>
<p><kbd>[ELSE]</kbd> is an immediate word.</p>
<hr><p><pre><b>[IF] ( SINGLE | SINGLE "<spaces><em>name</em>" ... -- )</b></pre></p>
<p>Compilation:
<br>Perform the execution semantics given below.</p>
<p>Execution:
<br>If any bit of <kbd>SINGLE</kbd> is not zero, continue execution.
Otherwise, skip leading spaces, parse and discard space-delimited
words from the parse area, including nested occurrences of
<kbd>[IF] ... [THEN]</kbd>
and <kbd>[IF] ... [ELSE] ... [THEN]</kbd>,
until either the word <kbd>[ELSE]</kbd> or
the word <kbd>[THEN]</kbd> has been parsed
and discarded. If the parse area becomes exhausted, it is
refilled as with <kbd>REFILL</kbd>.</p>
<p>An ambiguous condition exists if <kbd>[IF]</kbd>
is <kbd>POSTPONE</kbd>d, or if the
end of the input buffer is reached and cannot be refilled before
the terminating <kbd>[ELSE]</kbd> or <kbd>[THEN]</kbd> is parsed.</p>
<p><kbd>[IF]</kbd> is an immediate word.</p>
<hr><p><pre><b>[THEN] ( -- )</b></pre></p>
<p>Compilation:
<br>Perform the execution semantics given below.</p>
<p>Execution:
<br>Continue execution.</p>
<p><kbd>[THEN]</kbd> is an immediate word.</p>
<hr>
<p><a href="http://home.vrweb.de/s.becher/">Dr. Stephan Becher</a> - January 31st, 2009</p>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -