|
|
1.1 ! root 1: .th APL I 7/10/78 ! 2: .sh NAME ! 3: apl \*- The UCSF APL interpreter ! 4: .sh SYNOPSIS ! 5: .bd apl ! 6: .sh DESCRIPTION ! 7: The UCSF APL interpreter contains all the APL 360 operators ! 8: plus execute (epsilon), scan, and relational character operators. ! 9: The maximum workspace size is about 50,000 bytes. ! 10: .s3 ! 11: Function definition is not what you would expect. Functions are ! 12: created and modified with the system editor. Type `)EDIT fname' ! 13: or `)EX fname' to creat or modify a function. Type `)READ ! 14: fname' if it exists and doesn't need editing. ! 15: .s3 ! 16: The following I-beams are recognized by APL: ! 17: .in +.6i ! 18: .s3 ! 19: 1iF Open F for reading. ! 20: .s3 ! 21: 2iF Create F for writing. ! 22: .s3 ! 23: 3iF Append to F. ! 24: .s3 ! 25: 1i0, 2i0, 3i0 Close the named channel. ! 26: .in ! 27: .s3 ! 28: Only one read channel and ! 29: one write channel may be open simultaneously. When a file is open ! 30: for reading, references to the quad or quote-quad variable are ! 31: actually references to the named file. When open for writing, ! 32: assignments to the quad variable are written to the file. ! 33: .s3 ! 34: .in +.6i ! 35: 10iC Send command C to the shell. ! 36: .in ! 37: The command will be executed ! 38: as if it were typed at a UNIX terminal. This is equivalent to ! 39: the `!' feature of the editor. ! 40: .s3 ! 41: Monadic I-beam functions are: 20 for the time of day, 21 ! 42: to return CPU time used, 22 to return WS free in bytes, ! 43: 24 to return the starting time, 25 to return the date, ! 44: 28 to return the starting date, 29 to read the index ! 45: origin, 30 to read the terminal width, 31 to read the ! 46: printing precision (or `digits'), and 32 to ! 47: run the shell. ! 48: .sh BUGS ! 49: No trace function or state indicator. ! 50: .s3 ! 51: No `)WSID' command. The existing system commands take ! 52: only one argument. ! 53: .s3 ! 54: A `)WRITE fname' command is needed to get at functions which ! 55: exist only in workspaces.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.