Annotation of 43BSDReno/contrib/isode-beta/pepy/posy.1, revision 1.1.1.1

1.1       root        1: .TH POSY 1 "15 Sep 1987"
                      2: .\" $Header: /f/osi/pepy/RCS/posy.1,v 7.0 89/11/23 22:11:58 mrose Rel $
                      3: .\"
                      4: .\"
                      5: .\" $Log:      posy.1,v $
                      6: .\" Revision 7.0  89/11/23  22:11:58  mrose
                      7: .\" Release 6.0
                      8: .\" 
                      9: .SH NAME
                     10: posy \- PEPY optional structure\-generator (yacc\-based)
                     11: .SH SYNOPSIS
                     12: .in +.5i
                     13: .ti -.5i
                     14: .B posy
                     15: \%[\-a]
                     16: \%[\-d]
                     17: \%[\-f]
                     18: \%[\-h\fIoption\fP]
                     19: \%[\-o\0newmodule.py]
                     20: \%[\-s]
                     21: \fImodule.py\fR
                     22: .in -.5i
                     23: .SH DESCRIPTION
                     24: The \fIposy\fR program reads a description of a \fIpresentation\fR module and
                     25: augments the module for use with \fIpepy\fR\0(1).
                     26: It also produces an \*(lq#include\*(rq file containing equivalent
                     27: \fIC\fR language structure definitions for the module.
                     28: .PP
                     29: The `\-a' switch directs \fIposy\fR to augment the #include file with
                     30: commentary text.
                     31: .PP
                     32: Normally, \fIposy\fR ignores all \fIpepy\fR\-style augmentations except the 
                     33: \*(lqverbatim\*(rq actions occuring at the very beginning and end of the
                     34: module.
                     35: The `\-d' switch directs \fIposy\fR to ignore the verbatim actions as well.
                     36: .PP
                     37: The `\-f' switch directs \fIposy\fR to generate \fIC\fR routines to deallocate
                     38: the structures it defines.
                     39: These are appended to the augmented module definition
                     40: (as a consequence,
                     41: use of the `\-f' switch forces use of the `\-d' switch).
                     42: .PP
                     43: The `\-h' switch enables additional heuristics when \fIposy\fR generates a
                     44: \fIC\fR language structure definition.
                     45: Option `0' enables the default heuristics.
                     46: Enabling any other option also results in enabling option `0'.
                     47: Option `1' enables \*(lqclever\*(rq but non\-unique structure naming.
                     48: Option `2' enables the generation of arrays rather than linked-lists
                     49: whenever possible.
                     50: .PP
                     51: The `\-o' switch sets the name of the output file.
                     52: If this switch is not specified,
                     53: the standard output is used
                     54: (\fIposy\fR can not derive the name of the output file from the input file
                     55: since both should have extension \*(lq.py\*(rq).
                     56: .PP
                     57: Normally, \fIposy\fR prints the name of each type as it works.
                     58: The `\-s' switch disables this behavior.
                     59: .SH FILES
                     60: .nf
                     61: .ta \w'\fImodule\fR-types.h  'u
                     62: \fImodule\fR-types.h   \fIC\fR structure defintions from \fImodule\fR
                     63: .re
                     64: .fi
                     65: .SH "SEE ALSO"
                     66: pepy(1),
                     67: .br
                     68: \fIThe ISO Development Environment: User's Manual\fR
                     69: .SH AUTHOR
                     70: Marshall T. Rose

unix.superglobalmegacorp.com

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