|
|
1.1 ! root 1: .\" Copyright (c) 1980, 1990 The Regents of the University of California. ! 2: .\" All rights reserved. ! 3: .\" ! 4: .\" Redistribution and use in source and binary forms are permitted provided ! 5: .\" that: (1) source distributions retain this entire copyright notice and ! 6: .\" comment, and (2) distributions including binaries display the following ! 7: .\" acknowledgement: ``This product includes software developed by the ! 8: .\" University of California, Berkeley and its contributors'' in the ! 9: .\" documentation or other materials provided with the distribution and in ! 10: .\" all advertising materials mentioning features or use of this software. ! 11: .\" Neither the name of the University nor the names of its contributors may ! 12: .\" be used to endorse or promote products derived from this software without ! 13: .\" specific prior written permission. ! 14: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 15: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 16: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 17: .\" ! 18: .\" @(#)pxref.1 6.3 (Berkeley) 6/26/90 ! 19: .\" ! 20: .Dd June 26, 1990 ! 21: .Dt PXREF 1 ! 22: .Sh NAME ! 23: .Nm pxref ! 24: .Nd Pascal cross-reference program ! 25: .Sh SYNOPSIS ! 26: .Nm pxref ! 27: .Op Fl ! 28: .Ar name ! 29: .Sh DESCRIPTION ! 30: .Nm Pxref ! 31: makes a line numbered listing and a cross-reference of identifier usage ! 32: for the program in ! 33: .Ar name . ! 34: The optional ! 35: .Sq Fl ! 36: argument suppresses the listing. The keywords ! 37: .Ic goto ! 38: and ! 39: .Ic label ! 40: are treated as identifiers for the purpose of the cross-reference. ! 41: .Ic Include ! 42: directives are not processed, but cause the placement of an entry ! 43: indexed by `#include' in the cross-reference. ! 44: .Sh SEE ALSO ! 45: .Em Berkeley Pascal User's Manual ! 46: .Sh AUTHOR ! 47: Niklaus Wirth ! 48: .Sh HISTORY ! 49: .Nm Pxref ! 50: appeared in 3 BSD. ! 51: .Sh BUGS ! 52: Identifiers are trimmed to 10 characters.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.