Skip Navigation

The Computer Journal 1974 17(1):44-51; doi:10.1093/comjnl/17.1.44
© 1974 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 Cohen, J.
Right arrow Articles by Carton, E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Non-deterministic FORTRAN

J. Cohen1 * and E. Carton2 §

1 Physics Department, Brandeis University, Waltham, Massachusetts, USA, 2 Mathematics Department, Brandeis University, Waltham, Massachusetts, USA

This paper presents extensions to FORTRAN that enable programmers to write Floyd's non-deterministic algorithms. The paper also describes a syntax-directed translator of non-deterministic FORTRAN programs into standard FORTRAN. It is shown that is suitable conventions are made as the form of input programs, there exists a simple finite-state grammar that can be used to drive the translation. Two examples are given: (1) a program to solve the eight queens problem and (2) a selective top-down parser that can be useful in syntax-directed translation.

Received June 1972. Revised January 1973.

* Physics Department, Brandeis University, Waltham, Massachusetts 02154, USA.

§ Senior Student, Mathematics Department, Brandeis University, Waltham, Massachusetts 02154, USA, now a graduate student, Computer Science Department, University of Maryland.

Brandeis University, Waltham, Massachusetts, 02154, USA


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.