Skip Navigation

The Computer Journal 1977 20(1):56-62; doi:10.1093/comjnl/20.1.56
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Goodwin, D. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Conditions for underflow and overflow of an arithmetic stack

D. T. Goodwin *

Department of Computer Science, University of Keele, Keele, UK

The behaviour of an arithmetic stack is formally described as the loading of an arbitrary string of a context free language symbol by symbol on to a stack. Instances of a special symbol in the string being loaded invoke an operation which removes the top cell of the stack in some undefined way. Necessary and sufficient conditions for stack length boundedness are stated and proved. One application of the results concerns the choice between compile time and run time checks for underflow and overflow. Another concerns the testing for applicability of a certain algorithm for inverting Metcalfe-Reeves translators.

Received June 1975.

* Department of Computer Science, University of Keele, Keele, Staffordshire ST5 5BG


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.