![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to parse.y CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / parse|
Return to parse.y CVS log | Up to [local] / OpenXM_contrib2 / asir2000 / parse |
1.2 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.3 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.21 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/parse.y,v 1.20 2003/05/23 00:11:59 noro Exp $
1.2 noro 49: */
1.1 noro 50: %{
51: #define malloc(x) GC_malloc(x)
52: #define realloc(x,y) GC_realloc(x,y)
53: #define free(x) GC_free(x)
54:
55: #if defined(TOWNS)
56: #include <alloca.h>
57: #endif
58: #include <ctype.h>
59: #include "ca.h"
60: #include <sys/types.h>
61: #include <sys/stat.h>
62: #include "parse.h"
63:
64: #define NOPR (prresult=0)
65:
1.19 noro 66: extern int gdef,mgdef,ldef;
1.1 noro 67: extern SNODE parse_snode;
1.13 noro 68: extern int main_parser, allow_create_var;
1.1 noro 69:
70: int prresult;
71:
72: static int ind;
73: static FNODE t;
74: static NODE a,b;
75: static NODE2 a2;
76: static pointer val;
1.6 noro 77: static QUOTE quote;
1.1 noro 78: extern jmp_buf env;
79: %}
80:
81: %start start
82:
83: %union {
84: FNODE f;
85: SNODE s;
86: NODE n;
87: NODE2 n2;
88: int i;
89: pointer p;
90: }
91:
1.19 noro 92: %token <i> STRUCT POINT NEWSTRUCT ANS FDEF PFDEF MODDEF MODEND
1.21 ! noro 93: %token <i> GLOBAL MGLOBAL LOCAL LOCALF CMP OR AND CAR CDR QUOTED COLONCOLON
1.10 noro 94: %token <i> DO WHILE FOR IF ELSE BREAK RETURN CONTINUE PARIF MAP RECMAP TIMER GF2NGEN GFPNGEN GFSNGEN GETOPT
1.1 noro 95: %token <i> FOP_AND FOP_OR FOP_IMPL FOP_REPL FOP_EQUIV FOP_NOT LOP
96: %token <p> FORMULA UCASE LCASE STR SELF BOPASS
97: %token <p> '+' '-' '*' '/' '^' '%'
98:
99: %type <p> desc rawstr
100: %type <f> expr pexpr opt
101: %type <s> stat complex
1.17 noro 102: %type <n> stats node _node pvars vars members optlist
1.1 noro 103:
104: %right '=' BOPASS
105: %right '?' ':'
1.21 ! noro 106: %left '`'
1.1 noro 107: %right FOP_NOT
108: %left FOP_EQUIV
109: %left FOP_REPL
110: %left FOP_IMPL
111: %left FOP_OR
112: %left FOP_AND
113: %left LOP
114: %left LCASE
115: %left OR
116: %left AND
117: %left '&'
118: %left CMP
119: %left '+' '-'
120: %left PLUS
121: %left MINUS
122: %left '*' '/' '%'
123: %right '^'
124: %right '!'
125: %right SELF
126: %left POINT
127:
128: %%
129:
130: start : stat
131: { parse_snode = $1; YYACCEPT; }
132: ;
133: stat : tail
134: { $$ = 0; }
135: | GLOBAL { gdef=1; } pvars { gdef=0; } tail
1.19 noro 136: { $$ = 0; NOPR; }
137: | MGLOBAL { mgdef=1; } pvars { mgdef=0; } tail
138: { $$ = 0; NOPR; }
139: | LOCAL { ldef=1; } pvars { ldef=0; } tail
140: { $$ = 0; NOPR; }
1.18 noro 141: | LOCALF vars tail
1.19 noro 142: { appenduflist($2); $$ = 0; NOPR; }
1.4 noro 143: | STRUCT rawstr '{' members '}' tail
1.19 noro 144: { structdef($2,$4); $$ = 0; NOPR; }
1.1 noro 145: | expr tail
146: { $$ = mksnode(1,S_SINGLE,$1); }
147: | complex
148: { $$ = $1; }
149: | BREAK tail
150: { $$ = mksnode(0,S_BREAK); }
151: | CONTINUE tail
152: { $$ = mksnode(0,S_CONTINUE); }
153: | RETURN tail
154: { $$ = mksnode(1,S_RETURN,0); }
155: | RETURN expr tail
156: { $$ = mksnode(1,S_RETURN,$2); }
157: | IF '(' node ')' stat
158: { $$ = mksnode(4,S_IFELSE,$1,$3,$5,0); $5?$$->ln=$5->ln:0; NOPR; }
159: | IF '(' node ')' stat ELSE stat
160: { $$ = mksnode(4,S_IFELSE,$1,$3,$5,$7); $7?$$->ln=$7->ln:0; NOPR; }
161: | FOR '(' node ';' node ';' node ')' stat
162: { $$ = mksnode(5,S_FOR,$1,$3,$5?$5:ONENODE,$7,$9); $9?$$->ln=$9->ln:0; NOPR; }
163: | WHILE '(' node ')' stat
164: { $$ = mksnode(5,S_FOR,$1,0,$3,0,$5); $5?$$->ln=$5->ln:0; NOPR; }
165: | DO stat WHILE '(' node ')' tail
166: { $$ = mksnode(3,S_DO,$1,$2,$5); }
167: | LCASE '(' node ')' ':' '=' expr tail
168: { $$ = mksnode(3,S_PFDEF,$1,$3,$7); NOPR; }
1.20 noro 169: | PFDEF LCASE '(' node ')' tail
1.1 noro 170: { $$ = mksnode(3,S_PFDEF,$2,$4,0); NOPR; }
1.19 noro 171: | FDEF LCASE { mkpvs($2); } '(' { ldef = 1; } node { ldef = -1; } ')' desc '{' stats '}'
1.1 noro 172: {
1.19 noro 173: mkuf($2,asir_infile->name,$6,
174: mksnode(1,S_CPLX,$11),$1,asir_infile->ln,$9,CUR_MODULE);
1.1 noro 175: $$ = 0; NOPR;
1.15 noro 176: }
1.16 noro 177: | MODDEF LCASE tail
178: { CUR_MODULE = mkmodule($2); MPVS = CUR_MODULE->pvs; $$ = 0; NOPR; }
179: | MODEND tail
180: { CUR_MODULE = 0; MPVS = 0; $$ = 0; NOPR; }
1.1 noro 181: | error tail
182: { yyerrok; $$ = 0; }
183: ;
184: tail : ';'
185: { if ( main_parser ) prresult = 1; }
186: | '$'
187: { if ( main_parser ) prresult = 0; }
1.14 takayama 188: ;
1.1 noro 189: desc :
190: { $$ = 0; }
191: | STR
192: { $$ = $1; }
193: ;
194: complex : '{' stats '}'
195: { $$ = mksnode(1,S_CPLX,$2); }
196: ;
197: members : rawstr
198: { MKNODE($$,$1,0); }
199: | members ',' rawstr
200: { appendtonode($1,$3,&$$); }
201: ;
1.17 noro 202: vars : LCASE
203: { MKNODE($$,$1,0); }
204: | vars ',' LCASE
205: { appendtonode($1,$3,&$$); }
206: ;
1.1 noro 207: pvars : UCASE
208: { val = (pointer)makepvar($1); MKNODE($$,val,0); }
209: | pvars ',' UCASE
210: { appendtonode($1,(pointer)makepvar($3),&$$); }
211: ;
212: stats :
213: { $$ = 0; }
214: | stats stat
215: { appendtonode($1,(pointer)$2,&$$); }
216: ;
217: node :
218: { $$ = 0; }
219: | _node
220: { $$ = $1; }
221: ;
222: _node : expr
223: { MKNODE($$,$1,0); }
224: | _node ',' expr
225: { appendtonode($1,(pointer)$3,&$$); }
226: ;
227: optlist : opt
228: { MKNODE($$,$1,0); }
229: | optlist ',' opt
230: { appendtonode($1,(pointer)$3,&$$); }
231: ;
232: rawstr : UCASE
233: { $$ = $1; }
234: | LCASE
235: { $$ = $1; }
236: ;
237: opt : rawstr '=' expr
238: { $$ = mkfnode(2,I_OPT,$1,$3); }
239: ;
240: pexpr : STR
241: { $$ = mkfnode(1,I_STR,$1); }
242: | FORMULA
243: { $$ = mkfnode(1,I_FORMULA,$1); }
244: | ANS
245: { $$ = mkfnode(1,I_ANS,$1); }
246: | GF2NGEN
247: { $$ = mkfnode(0,I_GF2NGEN); }
248: | GFPNGEN
249: { $$ = mkfnode(0,I_GFPNGEN); }
1.10 noro 250: | GFSNGEN
251: { $$ = mkfnode(0,I_GFSNGEN); }
1.1 noro 252: | LCASE
253: {
254: FUNC f;
255:
256: searchf(noargsysf,$1,&f);
257: if ( f )
258: $$ = mkfnode(2,I_FUNC,f,0);
259: else {
260: searchc($1,&f);
261: if ( f )
262: $$ = mkfnode(2,I_FUNC,f,mkfnode(1,I_LIST,0));
263: else {
264: searchf(sysf,$1,&f);
265: if ( !f )
266: searchf(ubinf,$1,&f);
267: if ( !f )
268: searchpf($1,&f);
269: if ( !f )
270: searchf(usrf,$1,&f);
271: if ( f )
272: makesrvar(f,(P *)&val);
273: else
274: makevar($1,(P *)&val);
275: $$ = mkfnode(1,I_FORMULA,val);
276: }
277: }
278: }
279: | LCASE '(' node ')'
280: {
1.9 noro 281: gen_searchf($1,(FUNC *)&val);
1.17 noro 282: print_crossref(val);
1.1 noro 283: $$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$3));
284: }
285:
286: | LCASE '(' node '|' optlist ')'
287: {
1.9 noro 288: gen_searchf($1,(FUNC *)&val);
1.17 noro 289: print_crossref(val);
1.1 noro 290: $$ = mkfnode(3,I_FUNC_OPT,val,
291: mkfnode(1,I_LIST,$3),mkfnode(1,I_LIST,$5));
292: }
1.9 noro 293: | MAP '(' LCASE ',' node ')'
294: {
295: gen_searchf($3,(FUNC *)&val);
1.17 noro 296: print_crossref(val);
1.9 noro 297: $$ = mkfnode(2,I_MAP,val,mkfnode(1,I_LIST,$5));
298: }
299: | RECMAP '(' LCASE ',' node ')'
300: {
301: gen_searchf($3,(FUNC *)&val);
1.17 noro 302: print_crossref(val);
1.9 noro 303: $$ = mkfnode(2,I_RECMAP,val,mkfnode(1,I_LIST,$5));
304: }
1.1 noro 305: | LCASE '{' node '}' '(' node ')'
306: {
307: searchpf($1,(FUNC *)&val);
308: $$ = mkfnode(2,I_PFDERIV,val,mkfnode(1,I_LIST,$6),mkfnode(1,I_LIST,$3));
309: }
310: | GETOPT '(' rawstr ')'
311: {
312: $$ = mkfnode(2,I_GETOPT,$3);
313: }
1.9 noro 314: | GETOPT '(' ')'
1.1 noro 315: {
1.9 noro 316: $$ = mkfnode(2,I_GETOPT,0);
1.1 noro 317: }
318: | TIMER '(' expr ',' expr ',' expr ')'
319: {
320: $$ = mkfnode(3,I_TIMER,$3,$5,$7);
1.12 noro 321: }
322: | PARIF '(' LCASE ')'
323: {
324: searchf(parif,$3,(FUNC *)&val);
325: if ( !val )
326: mkparif($3,(FUNC *)&val);
327: $$ = mkfnode(2,I_FUNC,val,0);
1.1 noro 328: }
329: | PARIF '(' LCASE ',' node ')'
330: {
331: searchf(parif,$3,(FUNC *)&val);
332: if ( !val )
333: mkparif($3,(FUNC *)&val);
334: $$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$5));
335: }
336: | '(' '*' expr ')' '(' node ')'
337: {
338: $$ = mkfnode(2,I_IFUNC,$3,mkfnode(1,I_LIST,$6));
339: }
340: | CAR '(' expr ')'
341: { $$ = mkfnode(1,I_CAR,$3); }
342: | CDR '(' expr ')'
343: { $$ = mkfnode(1,I_CDR,$3); }
344: | '(' expr ')'
1.8 noro 345: { $$ = mkfnode(1,I_PAREN,$2); }
1.1 noro 346: | UCASE
347: {
1.13 noro 348: if ( main_parser || allow_create_var )
1.1 noro 349: $$ = mkfnode(2,I_PVAR,makepvar($1),0);
350: else {
351: ind = searchpvar($1);
352: if ( ind == -1 ) {
353: fprintf(stderr,"%s : no such variable.\n",$1);
354: YYABORT;
355: } else
356: $$ = mkfnode(2,I_PVAR,ind,0);
357: }
358: }
359: | pexpr '[' expr ']'
360: {
361: if ( $1->id == I_PVAR || $1->id == I_INDEX ) {
362: appendtonode((NODE)$1->arg[1],(pointer)$3,&a);
363: $1->arg[1] = (pointer)a; $$ = $1;
364: } else {
365: MKNODE(a,$3,0);
366: $$ = mkfnode(2,I_INDEX,(pointer)$1,a);
367: }
368: }
369: | pexpr POINT rawstr
1.4 noro 370: { $$ = mkfnode(2,I_POINT,$1,$3); }
1.1 noro 371: ;
372: expr : pexpr
373: { $$ = $1; }
374: | '(' STRUCT rawstr ')' pexpr
375: { $$ = mkfnode(3,I_CAST,structtoindex($3),$5,0); }
376: | expr '=' expr
377: { $$ = mkfnode(2,I_ASSPVAR,$1,$3); }
378: | expr BOPASS expr
379: { $$ = mkfnode(2,I_ASSPVAR,$1,mkfnode(3,I_BOP,$2,$1,$3)); }
380: | expr SELF
381: { $$ = mkfnode(2,I_POSTSELF,$2,$1); }
382: | SELF expr
383: { $$ = mkfnode(2,I_PRESELF,$1,$2); }
384: | '[' node ']'
385: { $$ = mkfnode(1,I_LIST,$2); }
386: | '+' expr %prec PLUS
387: { $$ = $2; }
388: | '-' expr %prec MINUS
1.11 noro 389: { $$ = mkfnode(1,I_MINUS,$2); }
1.1 noro 390: | expr '+' expr
391: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
392: | expr '-' expr
393: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
394: | expr '*' expr
395: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
396: | expr '/' expr
397: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
398: | expr '%' expr
399: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
400: | expr '^' expr
401: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
402: | expr CMP expr
403: { $$ = mkfnode(3,I_COP,$2,$1,$3); }
404: | '!' expr
405: { $$ = mkfnode(1,I_NOT,$2); }
406: | expr OR expr
407: { $$ = mkfnode(2,I_OR,$1,$3); }
408: | expr AND expr
409: { $$ = mkfnode(2,I_AND,$1,$3); }
410: | FOP_NOT expr
411: { $$ = mkfnode(3,I_LOP,$1,$2,0); }
412: | expr FOP_AND expr
413: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
414: | expr FOP_OR expr
415: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
416: | expr FOP_IMPL expr
417: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
418: | expr FOP_REPL expr
419: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
420: | expr FOP_EQUIV expr
421: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
422: | expr LOP expr
423: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
424: | expr '?' expr ':' expr
425: { $$ = mkfnode(3,I_CE,$1,$3,$5); }
426: | '<' node '>'
427: { $$ = mkfnode(1,I_EV,$2); }
428: | NEWSTRUCT '(' rawstr ')'
429: { $$ = mkfnode(1,I_NEWCOMP,(int)structtoindex($3)); }
1.6 noro 430: | QUOTED '(' expr ')'
431: { MKQUOTE(quote,$3); $$ = mkfnode(1,I_FORMULA,(pointer)quote); }
1.21 ! noro 432: | '`' expr
! 433: { MKQUOTE(quote,$2); $$ = mkfnode(1,I_FORMULA,(pointer)quote); }
1.1 noro 434: ;
435: %%