Return to parens.1 CVS log

Up to [CSRG BSD Unix] / 43BSD / contrib / icon / man / man1

Annotation of 43BSD/contrib/icon/man/man1/parens.1, revision 1.1.1.1

1.1       root        1: .so tmac.ilib
                      2: .TH PARENS 1 "The University of Arizona \- 8/15/84"
                      3: .SH NAME
                      4: parens \- produce strings of balanced parentheses
                      5: .SH SYNOPSIS
                      6: \f3parens\fP [\-\f3b \fIn\fR] [\-\f3n \fIn\fR] [\-\f3l \fIs\fR] [\-\f3r \fIs\fR] [\-\f3v\fR]
                      7: .SH DESCRIPTION
                      8: \fIParens\fR produces parenthesis-balanced strings in which the
                      9: parentheses are randomly distributed.
                     10: .PP
                     11: The following options may appear in any order:
                     12: .IP \-\f3b\0\fIn\fR .75i
                     13: Bound the length of the strings to \fIn\fR left and right parentheses each. The default is 10.
                     14: .IP \-\f3n\0\fIn\fR
                     15: Produce \fIn\fR strings. The default is 10.
                     16: .IP \-\f3l\0\fIs\fR
                     17: Use \fIs\fR for the left parenthesis. The default is \*M(\fR .
                     18: .IP \-\f3r\0\fIs\fR
                     19: Use \fIs\fR for the right parenthesis. The default is \*M)\fR .
                     20: .IP \-\f3v\fR
                     21: Randomly vary the length of the strings between 0 and the bound.
                     22: In the absence of this option, all strings are the exactly as long
                     23: as the specified bound.
                     24: .SH SEE ALSO
                     25: Arnold, D. B. and M. R. Sleep. ``Uniform Random Generation of
                     26: Balanced Parenthesis Strings'', \fIACM Transactions on Programming
                     27: Languages and Systems\fR, Vol. 2. No. 1 (1980), pp. 122-128.
                     28: .SH AUTHOR
                     29: Ralph E. Griswold

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.