src/common/calprnt.c

#ifndef lint
static const char       RCSid[] = "$Id: calprnt.c,v 2.5 2003/11/14 17:22:06 schorsch Exp $";
#endif
/*
 *  calprint.c - routines for printing calcomp expressions.
 */

#include "copyright.h"

#include  <stdio.h>

#include  "rterror.h"
#include  "calcomp.h"


void
eprint(                         /* print a parse tree */
        EPNODE  *ep,
        FILE  *fp
)
{
    static EPNODE  *curdef = NULL;
    EPNODE  *ep1 = NULL;

    switch (ep->type) {

        case VAR:
            fputs(ep->v.ln->name, fp);
            break;

        case SYM:
            fputs(ep->v.name, fp);
            break;

        case FUNC:
            eprint(ep->v.kid, fp);
            fputc('(', fp);
            ep1 = ep->v.kid->sibling;
            while (ep1 != NULL) {
                eprint(ep1, fp);
                if ((ep1 = ep1->sibling) != NULL)
                    fputs(", ", fp);
            }
            fputc(')', fp);
            break;

        case ARG:
            if (curdef == NULL || curdef->v.kid->type != FUNC ||
                        (ep1 = ekid(curdef->v.kid, ep->v.chan)) == NULL) {
                eputs("Bad argument!\n");
                quit(1);
            }
            eprint(ep1, fp);
            break;

        case NUM:
            fprintf(fp, "%.9g", ep->v.num);
            break;

        case UMINUS:
            fputc('-', fp);
            eprint(ep->v.kid, fp);
            break;

        case CHAN:
            fprintf(fp, "$%d", ep->v.chan);
            break;
        
        case '=':
        case ':':
            ep1 = curdef;
            curdef = ep;
            eprint(ep->v.kid, fp);
            fputc(' ', fp);
            fputc(ep->type, fp);
            fputc(' ', fp);
            eprint(ep->v.kid->sibling, fp);
            curdef = ep1;
            break;
            
        case '+':
        case '-':
        case '*':
        case '/':
        case '^':
            fputc('(', fp);
            eprint(ep->v.kid, fp);
            fputc(' ', fp);
            fputc(ep->type, fp);
            fputc(' ', fp);
            eprint(ep->v.kid->sibling, fp);
            fputc(')', fp);
            break;

        default:
            eputs("Bad expression!\n");
            quit(1);

    }

}


void
dprint(                 /* print a definition (all if no name) */
        char  *name,
        FILE  *fp
)
{
    EPNODE  *ep;
    
    if (name == NULL)
        for (ep = dfirst(); ep != NULL; ep = dnext()) {
            eprint(ep, fp);
            fputs(";\n", fp);
        }
    else if ((ep = dlookup(name)) != NULL) {
        eprint(ep, fp);
        fputs(";\n", fp);
    } else {
        wputs(name);
        wputs(": undefined\n");
    }
}
Revision:	2.6
Committed:	Wed Oct 24 00:39:09 2012 UTC (11 years, 6 months ago) by greg
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rad5R2, rad4R2P2, rad5R0, rad5R1, rad4R2, rad4R2P1, rad5R3
Changes since 2.5:	+11 -9 lines
Log Message:	Finished ANSIfication
#	User	Rev	Content
1	greg	1.1	#ifndef lint
2	greg	2.6	static const char RCSid[] = "$Id: calprnt.c,v 2.5 2003/11/14 17:22:06 schorsch Exp $";
3	greg	1.1	#endif
4			/*
5			* calprint.c - routines for printing calcomp expressions.
6	greg	2.2	*/
7
8	greg	2.3	#include "copyright.h"
9	greg	1.1
10			#include <stdio.h>
11
12	schorsch	2.4	#include "rterror.h"
13	greg	1.1	#include "calcomp.h"
14
15
16	greg	2.2	void
17	greg	2.6	eprint( /* print a parse tree */
18			EPNODE *ep,
19			FILE *fp
20			)
21	greg	1.1	{
22			static EPNODE *curdef = NULL;
23	greg	2.6	EPNODE *ep1 = NULL;
24	greg	1.1
25			switch (ep->type) {
26
27			case VAR:
28			fputs(ep->v.ln->name, fp);
29			break;
30
31			case SYM:
32			fputs(ep->v.name, fp);
33			break;
34
35			case FUNC:
36			eprint(ep->v.kid, fp);
37	greg	2.2	fputc('(', fp);
38	greg	1.1	ep1 = ep->v.kid->sibling;
39			while (ep1 != NULL) {
40			eprint(ep1, fp);
41			if ((ep1 = ep1->sibling) != NULL)
42			fputs(", ", fp);
43			}
44	greg	2.2	fputc(')', fp);
45	greg	1.1	break;
46
47			case ARG:
48			if (curdef == NULL \|\| curdef->v.kid->type != FUNC \|\|
49			(ep1 = ekid(curdef->v.kid, ep->v.chan)) == NULL) {
50			eputs("Bad argument!\n");
51			quit(1);
52			}
53			eprint(ep1, fp);
54			break;
55
56			case NUM:
57			fprintf(fp, "%.9g", ep->v.num);
58			break;
59
60			case UMINUS:
61	greg	2.2	fputc('-', fp);
62	greg	1.2	eprint(ep->v.kid, fp);
63	greg	1.1	break;
64
65			case CHAN:
66			fprintf(fp, "$%d", ep->v.chan);
67			break;
68
69			case '=':
70			case ':':
71			ep1 = curdef;
72			curdef = ep;
73			eprint(ep->v.kid, fp);
74	greg	2.2	fputc(' ', fp);
75			fputc(ep->type, fp);
76			fputc(' ', fp);
77	greg	1.1	eprint(ep->v.kid->sibling, fp);
78			curdef = ep1;
79			break;
80
81			case '+':
82			case '-':
83			case '*':
84			case '/':
85			case '^':
86	greg	2.2	fputc('(', fp);
87	greg	1.1	eprint(ep->v.kid, fp);
88	greg	2.2	fputc(' ', fp);
89			fputc(ep->type, fp);
90			fputc(' ', fp);
91	greg	1.1	eprint(ep->v.kid->sibling, fp);
92	greg	2.2	fputc(')', fp);
93	greg	1.1	break;
94
95			default:
96			eputs("Bad expression!\n");
97			quit(1);
98
99			}
100
101			}
102
103
104	greg	2.2	void
105	greg	2.6	dprint( /* print a definition (all if no name) */
106			char *name,
107			FILE *fp
108			)
109	greg	1.1	{
110	greg	2.6	EPNODE *ep;
111	greg	1.1
112			if (name == NULL)
113			for (ep = dfirst(); ep != NULL; ep = dnext()) {
114			eprint(ep, fp);
115			fputs(";\n", fp);
116			}
117			else if ((ep = dlookup(name)) != NULL) {
118			eprint(ep, fp);
119			fputs(";\n", fp);
120			} else {
121			wputs(name);
122			wputs(": undefined\n");
123			}
124			}