![[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.8 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/parse.y,v 1.7 2001/08/20 09:50:35 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:
66: extern int gdef;
67: extern SNODE parse_snode;
68: extern int main_parser;
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.6 noro 92: %token <i> STRUCT POINT NEWSTRUCT ANS FDEF PFDEF GLOBAL CMP OR AND CAR CDR QUOTED
1.7 noro 93: %token <i> DO WHILE FOR IF ELSE BREAK RETURN CONTINUE PARIF MAP RECMAP TIMER GF2NGEN GFPNGEN GETOPT
1.1 noro 94: %token <i> FOP_AND FOP_OR FOP_IMPL FOP_REPL FOP_EQUIV FOP_NOT LOP
95: %token <p> FORMULA UCASE LCASE STR SELF BOPASS
96: %token <p> '+' '-' '*' '/' '^' '%'
97:
98: %type <p> desc rawstr
99: %type <f> expr pexpr opt
100: %type <s> stat complex
1.4 noro 101: %type <n> stats node _node pvars members optlist
1.1 noro 102:
103: %right '=' BOPASS
104: %right '?' ':'
105: %right FOP_NOT
106: %left FOP_EQUIV
107: %left FOP_REPL
108: %left FOP_IMPL
109: %left FOP_OR
110: %left FOP_AND
111: %left LOP
112: %left LCASE
113: %left OR
114: %left AND
115: %left '&'
116: %left CMP
117: %left '+' '-'
118: %left PLUS
119: %left MINUS
120: %left '*' '/' '%'
121: %right '^'
122: %right '!'
123: %right SELF
124: %left POINT
125:
126: %%
127:
128: start : stat
129: { parse_snode = $1; YYACCEPT; }
130: ;
131: stat : tail
132: { $$ = 0; }
133: | GLOBAL { gdef=1; } pvars { gdef=0; } tail
134: { $$ = 0; }
1.4 noro 135: | STRUCT rawstr '{' members '}' tail
1.1 noro 136: { structdef($2,$4); $$ = 0; }
137: | expr tail
138: { $$ = mksnode(1,S_SINGLE,$1); }
139: | complex
140: { $$ = $1; }
141: | BREAK tail
142: { $$ = mksnode(0,S_BREAK); }
143: | CONTINUE tail
144: { $$ = mksnode(0,S_CONTINUE); }
145: | RETURN tail
146: { $$ = mksnode(1,S_RETURN,0); }
147: | RETURN expr tail
148: { $$ = mksnode(1,S_RETURN,$2); }
149: | IF '(' node ')' stat
150: { $$ = mksnode(4,S_IFELSE,$1,$3,$5,0); $5?$$->ln=$5->ln:0; NOPR; }
151: | IF '(' node ')' stat ELSE stat
152: { $$ = mksnode(4,S_IFELSE,$1,$3,$5,$7); $7?$$->ln=$7->ln:0; NOPR; }
153: | FOR '(' node ';' node ';' node ')' stat
154: { $$ = mksnode(5,S_FOR,$1,$3,$5?$5:ONENODE,$7,$9); $9?$$->ln=$9->ln:0; NOPR; }
155: | WHILE '(' node ')' stat
156: { $$ = mksnode(5,S_FOR,$1,0,$3,0,$5); $5?$$->ln=$5->ln:0; NOPR; }
157: | DO stat WHILE '(' node ')' tail
158: { $$ = mksnode(3,S_DO,$1,$2,$5); }
159: | LCASE '(' node ')' ':' '=' expr tail
160: { $$ = mksnode(3,S_PFDEF,$1,$3,$7); NOPR; }
161: | PFDEF LCASE '(' node ')'
162: { $$ = mksnode(3,S_PFDEF,$2,$4,0); NOPR; }
163: | FDEF LCASE { mkpvs(); } '(' node ')' desc '{' stats '}'
164: {
165: mkuf($2,asir_infile->name,$5,
166: mksnode(1,S_CPLX,$9),$1,asir_infile->ln,$7);
167: $$ = 0; NOPR;
168: }
169: | error tail
170: { yyerrok; $$ = 0; }
171: ;
172: tail : ';'
173: { if ( main_parser ) prresult = 1; }
174: | '$'
175: { if ( main_parser ) prresult = 0; }
176: desc :
177: { $$ = 0; }
178: | STR
179: { $$ = $1; }
180: ;
181: complex : '{' stats '}'
182: { $$ = mksnode(1,S_CPLX,$2); }
183: ;
184: members : rawstr
185: { MKNODE($$,$1,0); }
186: | members ',' rawstr
187: { appendtonode($1,$3,&$$); }
188: ;
189: pvars : UCASE
190: { val = (pointer)makepvar($1); MKNODE($$,val,0); }
191: | pvars ',' UCASE
192: { appendtonode($1,(pointer)makepvar($3),&$$); }
193: ;
194: stats :
195: { $$ = 0; }
196: | stats stat
197: { appendtonode($1,(pointer)$2,&$$); }
198: ;
199: node :
200: { $$ = 0; }
201: | _node
202: { $$ = $1; }
203: ;
204: _node : expr
205: { MKNODE($$,$1,0); }
206: | _node ',' expr
207: { appendtonode($1,(pointer)$3,&$$); }
208: ;
209: optlist : opt
210: { MKNODE($$,$1,0); }
211: | optlist ',' opt
212: { appendtonode($1,(pointer)$3,&$$); }
213: ;
214: rawstr : UCASE
215: { $$ = $1; }
216: | LCASE
217: { $$ = $1; }
218: ;
219: opt : rawstr '=' expr
220: { $$ = mkfnode(2,I_OPT,$1,$3); }
221: ;
222: pexpr : STR
223: { $$ = mkfnode(1,I_STR,$1); }
224: | FORMULA
225: { $$ = mkfnode(1,I_FORMULA,$1); }
226: | ANS
227: { $$ = mkfnode(1,I_ANS,$1); }
228: | GF2NGEN
229: { $$ = mkfnode(0,I_GF2NGEN); }
230: | GFPNGEN
231: { $$ = mkfnode(0,I_GFPNGEN); }
232: | LCASE
233: {
234: FUNC f;
235:
236: searchf(noargsysf,$1,&f);
237: if ( f )
238: $$ = mkfnode(2,I_FUNC,f,0);
239: else {
240: searchc($1,&f);
241: if ( f )
242: $$ = mkfnode(2,I_FUNC,f,mkfnode(1,I_LIST,0));
243: else {
244: searchf(sysf,$1,&f);
245: if ( !f )
246: searchf(ubinf,$1,&f);
247: if ( !f )
248: searchpf($1,&f);
249: if ( !f )
250: searchf(usrf,$1,&f);
251: if ( f )
252: makesrvar(f,(P *)&val);
253: else
254: makevar($1,(P *)&val);
255: $$ = mkfnode(1,I_FORMULA,val);
256: }
257: }
258: }
259: | LCASE '(' node ')'
260: {
261: searchf(sysf,$1,(FUNC *)&val);
262: if ( !val )
263: searchf(ubinf,$1,(FUNC *)&val);
264: if ( !val )
265: searchpf($1,(FUNC *)&val);
266: if ( !val )
267: searchf(usrf,$1,(FUNC *)&val);
268: if ( !val )
269: appenduf($1,(FUNC *)&val);
270: $$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$3));
271: }
272:
273: | LCASE '(' node '|' optlist ')'
274: {
275: searchf(sysf,$1,(FUNC *)&val);
276: if ( !val )
277: searchf(ubinf,$1,(FUNC *)&val);
278: if ( !val )
279: searchpf($1,(FUNC *)&val);
280: if ( !val )
281: searchf(usrf,$1,(FUNC *)&val);
282: if ( !val )
283: appenduf($1,(FUNC *)&val);
284: $$ = mkfnode(3,I_FUNC_OPT,val,
285: mkfnode(1,I_LIST,$3),mkfnode(1,I_LIST,$5));
286: }
287: | LCASE '{' node '}' '(' node ')'
288: {
289: searchpf($1,(FUNC *)&val);
290: $$ = mkfnode(2,I_PFDERIV,val,mkfnode(1,I_LIST,$6),mkfnode(1,I_LIST,$3));
291: }
292: | GETOPT '(' rawstr ')'
293: {
294: $$ = mkfnode(2,I_GETOPT,$3);
295: }
296: | MAP '(' LCASE ',' node ')'
297: {
298: searchf(sysf,$3,(FUNC *)&val);
299: if ( !val )
300: searchf(ubinf,$3,(FUNC *)&val);
301: if ( !val )
302: searchpf($3,(FUNC *)&val);
303: if ( !val )
304: searchf(usrf,$3,(FUNC *)&val);
305: if ( !val )
306: appenduf($3,(FUNC *)&val);
307: $$ = mkfnode(2,I_MAP,val,mkfnode(1,I_LIST,$5));
1.7 noro 308: }
309: | RECMAP '(' LCASE ',' node ')'
310: {
311: searchf(sysf,$3,(FUNC *)&val);
312: if ( !val )
313: searchf(ubinf,$3,(FUNC *)&val);
314: if ( !val )
315: searchpf($3,(FUNC *)&val);
316: if ( !val )
317: searchf(usrf,$3,(FUNC *)&val);
318: if ( !val )
319: appenduf($3,(FUNC *)&val);
320: $$ = mkfnode(2,I_RECMAP,val,mkfnode(1,I_LIST,$5));
1.1 noro 321: }
322: | TIMER '(' expr ',' expr ',' expr ')'
323: {
324: $$ = mkfnode(3,I_TIMER,$3,$5,$7);
325: }
326: | PARIF '(' LCASE ',' node ')'
327: {
328: searchf(parif,$3,(FUNC *)&val);
329: if ( !val )
330: mkparif($3,(FUNC *)&val);
331: $$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$5));
332: }
333: | '(' '*' expr ')' '(' node ')'
334: {
335: $$ = mkfnode(2,I_IFUNC,$3,mkfnode(1,I_LIST,$6));
336: }
337: | CAR '(' expr ')'
338: { $$ = mkfnode(1,I_CAR,$3); }
339: | CDR '(' expr ')'
340: { $$ = mkfnode(1,I_CDR,$3); }
341: | '(' expr ')'
1.8 ! noro 342: { $$ = mkfnode(1,I_PAREN,$2); }
1.1 noro 343: | UCASE
344: {
345: if ( main_parser )
346: $$ = mkfnode(2,I_PVAR,makepvar($1),0);
347: else {
348: ind = searchpvar($1);
349: if ( ind == -1 ) {
350: fprintf(stderr,"%s : no such variable.\n",$1);
351: YYABORT;
352: } else
353: $$ = mkfnode(2,I_PVAR,ind,0);
354: }
355: }
356: | pexpr '[' expr ']'
357: {
358: if ( $1->id == I_PVAR || $1->id == I_INDEX ) {
359: appendtonode((NODE)$1->arg[1],(pointer)$3,&a);
360: $1->arg[1] = (pointer)a; $$ = $1;
361: } else {
362: MKNODE(a,$3,0);
363: $$ = mkfnode(2,I_INDEX,(pointer)$1,a);
364: }
365: }
366: | pexpr POINT rawstr
1.4 noro 367: { $$ = mkfnode(2,I_POINT,$1,$3); }
1.1 noro 368: ;
369: expr : pexpr
370: { $$ = $1; }
371: | '(' STRUCT rawstr ')' pexpr
372: { $$ = mkfnode(3,I_CAST,structtoindex($3),$5,0); }
373: | expr '=' expr
374: { $$ = mkfnode(2,I_ASSPVAR,$1,$3); }
375: | expr BOPASS expr
376: { $$ = mkfnode(2,I_ASSPVAR,$1,mkfnode(3,I_BOP,$2,$1,$3)); }
377: | expr SELF
378: { $$ = mkfnode(2,I_POSTSELF,$2,$1); }
379: | SELF expr
380: { $$ = mkfnode(2,I_PRESELF,$1,$2); }
381: | '[' node ']'
382: { $$ = mkfnode(1,I_LIST,$2); }
383: | '+' expr %prec PLUS
384: { $$ = $2; }
385: | '-' expr %prec MINUS
386: { $$ = mkfnode(3,I_BOP,$1,0,$2); }
387: | expr '+' expr
388: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
389: | expr '-' expr
390: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
391: | expr '*' expr
392: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
393: | expr '/' expr
394: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
395: | expr '%' expr
396: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
397: | expr '^' expr
398: { $$ = mkfnode(3,I_BOP,$2,$1,$3); }
399: | expr CMP expr
400: { $$ = mkfnode(3,I_COP,$2,$1,$3); }
401: | '!' expr
402: { $$ = mkfnode(1,I_NOT,$2); }
403: | expr OR expr
404: { $$ = mkfnode(2,I_OR,$1,$3); }
405: | expr AND expr
406: { $$ = mkfnode(2,I_AND,$1,$3); }
407: | FOP_NOT expr
408: { $$ = mkfnode(3,I_LOP,$1,$2,0); }
409: | expr FOP_AND expr
410: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
411: | expr FOP_OR expr
412: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
413: | expr FOP_IMPL expr
414: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
415: | expr FOP_REPL expr
416: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
417: | expr FOP_EQUIV expr
418: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
419: | expr LOP expr
420: { $$ = mkfnode(3,I_LOP,$2,$1,$3); }
421: | expr '?' expr ':' expr
422: { $$ = mkfnode(3,I_CE,$1,$3,$5); }
423: | '<' node '>'
424: { $$ = mkfnode(1,I_EV,$2); }
425: | NEWSTRUCT '(' rawstr ')'
426: { $$ = mkfnode(1,I_NEWCOMP,(int)structtoindex($3)); }
1.6 noro 427: | QUOTED '(' expr ')'
428: { MKQUOTE(quote,$3); $$ = mkfnode(1,I_FORMULA,(pointer)quote); }
1.1 noro 429: ;
430: %%