Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The software stack data-type as an operating system service

The software stack data-type as an operating system service 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGFORTH Newsletter Association for Computing Machinery

The software stack data-type as an operating system service

ACM SIGFORTH Newsletter , Volume 4 (4) – Dec 1, 1994

Loading next page...
 
/lp/association-for-computing-machinery/the-software-stack-data-type-as-an-operating-system-service-BckKEa112y

References (1)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1994 by ACM Inc.
ISSN
1047-4544
DOI
10.1145/190670.190671
Publisher site
See Article on Publisher Site

Abstract

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

Journal

ACM SIGFORTH NewsletterAssociation for Computing Machinery

Published: Dec 1, 1994

There are no references for this article.