![[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.34 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/parse.y,v 1.33 2008/09/01 06:20:33 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:
1.28 noro 70: int prresult,saveresult;
1.1 noro 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.23 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
1.22 noro 131: {
132: parse_snode = $1;
133: if ( yychar >= 0 )
134: fprintf(stderr,
135: "Warning: a token was wasted after an 'if' statement without 'else'.\n");
136: YYACCEPT;
137: }
1.1 noro 138: ;
139: stat : tail
140: { $$ = 0; }
141: | GLOBAL { gdef=1; } pvars { gdef=0; } tail
1.19 noro 142: { $$ = 0; NOPR; }
143: | MGLOBAL { mgdef=1; } pvars { mgdef=0; } tail
144: { $$ = 0; NOPR; }
145: | LOCAL { ldef=1; } pvars { ldef=0; } tail
146: { $$ = 0; NOPR; }
1.18 noro 147: | LOCALF vars tail
1.19 noro 148: { appenduflist($2); $$ = 0; NOPR; }
1.4 noro 149: | STRUCT rawstr '{' members '}' tail
1.19 noro 150: { structdef($2,$4); $$ = 0; NOPR; }
1.1 noro 151: | expr tail
152: { $$ = mksnode(1,S_SINGLE,$1); }
153: | complex
154: { $$ = $1; }
155: | BREAK tail
156: { $$ = mksnode(0,S_BREAK); }
157: | CONTINUE tail
158: { $$ = mksnode(0,S_CONTINUE); }
159: | RETURN tail
1.34 ! noro 160: { $$ = mksnode(1,S_RETURN,NULLP); }
1.1 noro 161: | RETURN expr tail
162: { $$ = mksnode(1,S_RETURN,$2); }
163: | IF '(' node ')' stat
1.34 ! noro 164: { $$ = mksnode(4,S_IFELSE,$1,$3,$5,NULLP); $5?$$->ln=$5->ln:0; NOPR; }
1.1 noro 165: | IF '(' node ')' stat ELSE stat
166: { $$ = mksnode(4,S_IFELSE,$1,$3,$5,$7); $7?$$->ln=$7->ln:0; NOPR; }
167: | FOR '(' node ';' node ';' node ')' stat
168: { $$ = mksnode(5,S_FOR,$1,$3,$5?$5:ONENODE,$7,$9); $9?$$->ln=$9->ln:0; NOPR; }
169: | WHILE '(' node ')' stat
1.34 ! noro 170: { $$ = mksnode(5,S_FOR,$1,NULLP,$3,NULLP,$5); $5?$$->ln=$5->ln:0; NOPR; }
1.1 noro 171: | DO stat WHILE '(' node ')' tail
1.28 noro 172: { $$ = mksnode(3,S_DO,$1,$2,$5); NOPR; }
1.1 noro 173: | LCASE '(' node ')' ':' '=' expr tail
174: { $$ = mksnode(3,S_PFDEF,$1,$3,$7); NOPR; }
1.20 noro 175: | PFDEF LCASE '(' node ')' tail
1.34 ! noro 176: { $$ = mksnode(3,S_PFDEF,$2,$4,NULLP); NOPR; }
1.19 noro 177: | FDEF LCASE { mkpvs($2); } '(' { ldef = 1; } node { ldef = -1; } ')' desc '{' stats '}'
1.1 noro 178: {
1.19 noro 179: mkuf($2,asir_infile->name,$6,
180: mksnode(1,S_CPLX,$11),$1,asir_infile->ln,$9,CUR_MODULE);
1.28 noro 181: $$ = 0; NOPR;
1.15 noro 182: }
1.16 noro 183: | MODDEF LCASE tail
1.27 noro 184: {
185: CUR_MODULE = mkmodule($2);
186: MPVS = CUR_MODULE->pvs;
187: $$ = mksnode(1,S_MODULE,CUR_MODULE); NOPR;
188: }
1.16 noro 189: | MODEND tail
1.34 ! noro 190: { CUR_MODULE = 0; MPVS = 0; $$ = mksnode(1,S_MODULE,NULLP); NOPR; }
1.1 noro 191: | error tail
192: { yyerrok; $$ = 0; }
193: ;
194: tail : ';'
195: { if ( main_parser ) prresult = 1; }
196: | '$'
197: { if ( main_parser ) prresult = 0; }
1.14 takayama 198: ;
1.1 noro 199: desc :
200: { $$ = 0; }
201: | STR
202: { $$ = $1; }
203: ;
204: complex : '{' stats '}'
205: { $$ = mksnode(1,S_CPLX,$2); }
206: ;
207: members : rawstr
208: { MKNODE($$,$1,0); }
209: | members ',' rawstr
210: { appendtonode($1,$3,&$$); }
211: ;
1.17 noro 212: vars : LCASE
213: { MKNODE($$,$1,0); }
214: | vars ',' LCASE
215: { appendtonode($1,$3,&$$); }
216: ;
1.1 noro 217: pvars : UCASE
218: { val = (pointer)makepvar($1); MKNODE($$,val,0); }
219: | pvars ',' UCASE
220: { appendtonode($1,(pointer)makepvar($3),&$$); }
221: ;
222: stats :
223: { $$ = 0; }
224: | stats stat
225: { appendtonode($1,(pointer)$2,&$$); }
226: ;
227: node :
228: { $$ = 0; }
229: | _node
230: { $$ = $1; }
231: ;
232: _node : expr
233: { MKNODE($$,$1,0); }
234: | _node ',' expr
235: { appendtonode($1,(pointer)$3,&$$); }
236: ;
237: optlist : opt
238: { MKNODE($$,$1,0); }
239: | optlist ',' opt
240: { appendtonode($1,(pointer)$3,&$$); }
241: ;
242: rawstr : UCASE
243: { $$ = $1; }
244: | LCASE
245: { $$ = $1; }
246: ;
247: opt : rawstr '=' expr
248: { $$ = mkfnode(2,I_OPT,$1,$3); }
249: ;
250: pexpr : STR
251: { $$ = mkfnode(1,I_STR,$1); }
252: | FORMULA
253: { $$ = mkfnode(1,I_FORMULA,$1); }
254: | ANS
255: { $$ = mkfnode(1,I_ANS,$1); }
256: | GF2NGEN
257: { $$ = mkfnode(0,I_GF2NGEN); }
258: | GFPNGEN
259: { $$ = mkfnode(0,I_GFPNGEN); }
1.10 noro 260: | GFSNGEN
261: { $$ = mkfnode(0,I_GFSNGEN); }
1.1 noro 262: | LCASE
263: {
264: FUNC f;
265:
266: searchf(noargsysf,$1,&f);
267: if ( f )
1.34 ! noro 268: $$ = mkfnode(2,I_FUNC,f,NULLP);
1.1 noro 269: else {
270: searchc($1,&f);
271: if ( f )
1.34 ! noro 272: $$ = mkfnode(2,I_FUNC,f,mkfnode(1,I_LIST,NULLP));
1.1 noro 273: else {
1.25 noro 274: gen_searchf_searchonly($1,(FUNC *)&f);
1.1 noro 275: if ( f )
276: makesrvar(f,(P *)&val);
277: else
278: makevar($1,(P *)&val);
279: $$ = mkfnode(1,I_FORMULA,val);
280: }
281: }
282: }
283: | LCASE '(' node ')'
284: {
1.9 noro 285: gen_searchf($1,(FUNC *)&val);
1.17 noro 286: print_crossref(val);
1.1 noro 287: $$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$3));
288: }
289:
290: | LCASE '(' node '|' optlist ')'
291: {
1.9 noro 292: gen_searchf($1,(FUNC *)&val);
1.17 noro 293: print_crossref(val);
1.1 noro 294: $$ = mkfnode(3,I_FUNC_OPT,val,
295: mkfnode(1,I_LIST,$3),mkfnode(1,I_LIST,$5));
296: }
1.9 noro 297: | MAP '(' LCASE ',' node ')'
298: {
299: gen_searchf($3,(FUNC *)&val);
1.17 noro 300: print_crossref(val);
1.9 noro 301: $$ = mkfnode(2,I_MAP,val,mkfnode(1,I_LIST,$5));
302: }
303: | RECMAP '(' LCASE ',' node ')'
304: {
305: gen_searchf($3,(FUNC *)&val);
1.17 noro 306: print_crossref(val);
1.9 noro 307: $$ = mkfnode(2,I_RECMAP,val,mkfnode(1,I_LIST,$5));
308: }
1.1 noro 309: | LCASE '{' node '}' '(' node ')'
310: {
311: searchpf($1,(FUNC *)&val);
1.31 noro 312: $$ = mkfnode(3,I_PFDERIV,val,mkfnode(1,I_LIST,$6),mkfnode(1,I_LIST,$3));
1.1 noro 313: }
314: | GETOPT '(' rawstr ')'
315: {
316: $$ = mkfnode(2,I_GETOPT,$3);
317: }
1.9 noro 318: | GETOPT '(' ')'
1.1 noro 319: {
1.34 ! noro 320: $$ = mkfnode(2,I_GETOPT,NULLP);
1.1 noro 321: }
322: | TIMER '(' expr ',' expr ',' expr ')'
323: {
324: $$ = mkfnode(3,I_TIMER,$3,$5,$7);
1.12 noro 325: }
326: | PARIF '(' LCASE ')'
327: {
328: searchf(parif,$3,(FUNC *)&val);
329: if ( !val )
330: mkparif($3,(FUNC *)&val);
1.34 ! noro 331: $$ = mkfnode(2,I_FUNC,val,NULLP);
1.1 noro 332: }
333: | PARIF '(' LCASE ',' node ')'
334: {
335: searchf(parif,$3,(FUNC *)&val);
336: if ( !val )
337: mkparif($3,(FUNC *)&val);
338: $$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$5));
339: }
340: | '(' '*' expr ')' '(' node ')'
341: {
1.34 ! noro 342: $$ = mkfnode(2,I_IFUNC,$3,mkfnode(1,I_LIST,$6),NULLP);
1.33 noro 343: }
344: | '(' '*' expr ')' '(' node '|' optlist ')'
345: {
346: $$ = mkfnode(3,I_IFUNC,$3,mkfnode(1,I_LIST,$6),
347: mkfnode(1,I_LIST,$8));
1.26 noro 348: }
349: | UCASE '(' node ')'
350: {
351: if ( main_parser || allow_create_var )
1.34 ! noro 352: t = mkfnode(2,I_PVAR,makepvar($1),NULLP);
1.26 noro 353: else {
354: ind = searchpvar($1);
355: if ( ind == -1 ) {
356: fprintf(stderr,"%s : no such variable.\n",$1);
357: YYABORT;
358: } else
1.34 ! noro 359: t = mkfnode(2,I_PVAR,ind,NULLP);
1.26 noro 360: }
361: $$ = mkfnode(2,I_IFUNC,t,mkfnode(1,I_LIST,$3));
1.1 noro 362: }
363: | CAR '(' expr ')'
364: { $$ = mkfnode(1,I_CAR,$3); }
365: | CDR '(' expr ')'
366: { $$ = mkfnode(1,I_CDR,$3); }
367: | '(' expr ')'
1.8 noro 368: { $$ = mkfnode(1,I_PAREN,$2); }
1.1 noro 369: | UCASE
370: {
1.13 noro 371: if ( main_parser || allow_create_var )
1.34 ! noro 372: $$ = mkfnode(2,I_PVAR,makepvar($1),NULLP);
1.1 noro 373: else {
374: ind = searchpvar($1);
375: if ( ind == -1 ) {
376: fprintf(stderr,"%s : no such variable.\n",$1);
377: YYABORT;
378: } else
1.34 ! noro 379: $$ = mkfnode(2,I_PVAR,ind,NULLP);
1.1 noro 380: }
381: }
382: | pexpr '[' expr ']'
383: {
384: if ( $1->id == I_PVAR || $1->id == I_INDEX ) {
385: appendtonode((NODE)$1->arg[1],(pointer)$3,&a);
386: $1->arg[1] = (pointer)a; $$ = $1;
387: } else {
388: MKNODE(a,$3,0);
389: $$ = mkfnode(2,I_INDEX,(pointer)$1,a);
390: }
391: }
392: | pexpr POINT rawstr
1.4 noro 393: { $$ = mkfnode(2,I_POINT,$1,$3); }
1.1 noro 394: ;
395: expr : pexpr
396: { $$ = $1; }
397: | '(' STRUCT rawstr ')' pexpr
1.34 ! noro 398: { $$ = mkfnode(3,I_CAST,structtoindex($3),$5,NULLP); }
1.1 noro 399: | expr '=' expr
400: { $$ = mkfnode(2,I_ASSPVAR,$1,$3); }
401: | expr BOPASS expr
402: { $$ = mkfnode(2,I_ASSPVAR,$1,mkfnode(3,I_BOP,$2,$1,$3)); }
403: | expr SELF
404: { $$ = mkfnode(2,I_POSTSELF,$2,$1); }
405: | SELF expr
406: { $$ = mkfnode(2,I_PRESELF,$1,$2); }
407: | '[' node ']'
408: { $$ = mkfnode(1,I_LIST,$2); }
409: | '+' expr %prec PLUS
410: { $$ = $2; }
411: | '-' expr %prec MINUS
1.11 noro 412: { $$ = mkfnode(1,I_MINUS,$2); }
1.1 noro 413: | expr '+' expr
414: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
415: | expr '-' expr
416: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
417: | expr '*' expr
418: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
419: | expr '/' expr
420: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
421: | expr '%' expr
422: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
423: | expr '^' expr
424: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
425: | expr CMP expr
426: { $$ = mkfnode(3,I_COP,$2,$1,$3); }
427: | '!' expr
428: { $$ = mkfnode(1,I_NOT,$2); }
429: | expr OR expr
430: { $$ = mkfnode(2,I_OR,$1,$3); }
431: | expr AND expr
432: { $$ = mkfnode(2,I_AND,$1,$3); }
433: | FOP_NOT expr
1.34 ! noro 434: { $$ = mkfnode(3,I_LOP,$1,$2,NULLP); }
1.1 noro 435: | expr FOP_AND expr
436: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
437: | expr FOP_OR expr
438: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
439: | expr FOP_IMPL expr
440: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
441: | expr FOP_REPL expr
442: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
443: | expr FOP_EQUIV expr
444: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
445: | expr LOP expr
446: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
447: | expr '?' expr ':' expr
448: { $$ = mkfnode(3,I_CE,$1,$3,$5); }
449: | '<' node '>'
450: { $$ = mkfnode(1,I_EV,$2); }
451: | NEWSTRUCT '(' rawstr ')'
452: { $$ = mkfnode(1,I_NEWCOMP,(int)structtoindex($3)); }
1.6 noro 453: | QUOTED '(' expr ')'
454: { MKQUOTE(quote,$3); $$ = mkfnode(1,I_FORMULA,(pointer)quote); }
1.32 noro 455: | '[' node '|' expr ']'
456: { $$ = mkfnode(2,I_CONS,$2,$4); }
1.21 noro 457: | '`' expr
458: { MKQUOTE(quote,$2); $$ = mkfnode(1,I_FORMULA,(pointer)quote); }
1.1 noro 459: ;
460: %%