Skip Navigation

The Computer Journal 1967 10(1):60-63; doi:10.1093/comjnl/10.1.60
© 1967 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Brooker, R. A.
Right arrow Articles by Clark, S. R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An index directed compiler

R. A. Brooker1 * and S. R. Clark2 §

1 Department of Computer Science, The University, Manchester, UK, 2 Commonwealth Scholar, Department of Computer Science, The University, Manchester, UK

This paper describes a system for discriminating between many possible combinations of conditions and invoking a routine to deal with them. It is illustrated with reference to a situation which may arise in a compiler, namely the treatment of different combinations of operands and operators.


* Department of Computer Science, The University, Manchester, 13.

§ Commonwealth Scholar, Department of Computer Science, The University, Manchester, 13.


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.