|
|
1.1 ! root 1: .\" Copyright (c) 1990 Regents of the University of California. ! 2: .\" All rights reserved. The Berkeley software License Agreement ! 3: .\" specifies the terms and conditions for redistribution. ! 4: .\" ! 5: .\" @(#)ratfor.1 6.4 (Berkeley) 7/24/90 ! 6: .\" ! 7: .Dd July 24, 1990 ! 8: .Dt RATFOR 1 ! 9: .Os ATT 7th ! 10: .Sh NAME ! 11: .Nm ratfor ! 12: .Nd rational Fortran dialect ! 13: .Sh SYNOPSIS ! 14: .Nm ratfor ! 15: .Op Ar option ... ! 16: .Op Ar filename ... ! 17: .Sh DESCRIPTION ! 18: .Nm Ratfor ! 19: converts a rational dialect of Fortran into ordinary irrational Fortran. ! 20: .Nm Ratfor ! 21: provides control flow constructs essentially identical to those in C: ! 22: .Tw Fl ! 23: .Tp statement grouping: ! 24: { statement; statement; statement } ! 25: .Tp decision-making: ! 26: .Ds I ! 27: if (condition) statement { else statement } ! 28: switch (integer value) { ! 29: \tcase integer: statement ! 30: \t... ! 31: \t[default]: statement ! 32: } ! 33: .De ! 34: .Tp loops: ! 35: .Ds L ! 36: while (condition) statement ! 37: for (expression; condition; expression) statement ! 38: do limits statement ! 39: repeat statement [until (condition)] ! 40: break ! 41: next ! 42: .De ! 43: .Tp ! 44: .Pp ! 45: and some syntactic sugar to make programs easier to read and write: ! 46: .Tw Fl ! 47: .Tp free form input: ! 48: multiple statements/line; automatic continuation ! 49: .Tp comments: ! 50: # this is a comment ! 51: .Tp translation of relationals: ! 52: >, >=, etc., become .GT., .GE., etc. ! 53: .Tp return (expression) ! 54: returns expression to caller from function ! 55: .Tp define: ! 56: define name replacement ! 57: .Tp include: ! 58: include filename ! 59: .Tp ! 60: .Pp ! 61: .Nm Ratfor ! 62: is best used with ! 63: .Xr f77 1 . ! 64: .Sh SEE ALSO ! 65: .Xr f77 1 ! 66: .br ! 67: B. W. Kernighan and P. J. Plauger, ! 68: .Em Software Tools , ! 69: Addison-Wesley, ! 70: 1976. ! 71: .Sh HISTORY ! 72: .Nm Ratfor ! 73: appeared in Version 7 AT&T UNIX.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.