Access the full text.
Sign up today, get DeepDyve free for 14 days.
The Software Stack Data-Type as an Operating System Service Jon W. Osterlund 722 E. 20th Street Greeley, CO 80631 ABSTRACT: Codes which manage compilation and use of named software stacks are described. An item on such a stack ordinarily consists of one word, but it may be extended by afzxed length through association with an au.xilliary field declared separately. In this way, structures such as buffers, inodes and I/0 redirection may be managed with the stacking discipline familiar to Forth users. Eight access methods are provided, which are bound to the desired stack within "domains" established by the user codes. Domains may be nested with one another, and with control structures such as BEGIN .. UNTIL, DO .. LOOP, and IF .. ELSE .. THEN. Examples illustrate correct use. Preface The "stack" and "R" are familiar to Forth users. It is possible, however, to use Forth without awareness of the stack-like characteristics of the dictionary, into which codes may be loaded and from which they may be forgotten, and it is also possible to be aware of many of Forth's advantages without knowledge of "reentembility" or of "list theory". These topics are beyond the present scope, but the
ACM SIGFORTH Newsletter – Association for Computing Machinery
Published: Dec 1, 1994
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.