version 1.1, 1999/12/03 07:39:12 |
version 1.17, 2003/05/16 07:56:16 |
|
|
/* $OpenXM: OpenXM/src/asir99/parse/parse.y,v 1.2 1999/11/18 05:42:03 noro Exp $ */ |
/* |
|
* Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED |
|
* All rights reserved. |
|
* |
|
* FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited, |
|
* non-exclusive and royalty-free license to use, copy, modify and |
|
* redistribute, solely for non-commercial and non-profit purposes, the |
|
* computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and |
|
* conditions of this Agreement. For the avoidance of doubt, you acquire |
|
* only a limited right to use the SOFTWARE hereunder, and FLL or any |
|
* third party developer retains all rights, including but not limited to |
|
* copyrights, in and to the SOFTWARE. |
|
* |
|
* (1) FLL does not grant you a license in any way for commercial |
|
* purposes. You may use the SOFTWARE only for non-commercial and |
|
* non-profit purposes only, such as academic, research and internal |
|
* business use. |
|
* (2) The SOFTWARE is protected by the Copyright Law of Japan and |
|
* international copyright treaties. If you make copies of the SOFTWARE, |
|
* with or without modification, as permitted hereunder, you shall affix |
|
* to all such copies of the SOFTWARE the above copyright notice. |
|
* (3) An explicit reference to this SOFTWARE and its copyright owner |
|
* shall be made on your publication or presentation in any form of the |
|
* results obtained by use of the SOFTWARE. |
|
* (4) In the event that you modify the SOFTWARE, you shall notify FLL by |
|
* e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification |
|
* for such modification or the source code of the modified part of the |
|
* SOFTWARE. |
|
* |
|
* THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL |
|
* MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND |
|
* EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS |
|
* FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES' |
|
* RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY |
|
* MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY. |
|
* UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT, |
|
* OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY |
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL |
|
* DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES |
|
* ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES |
|
* FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY |
|
* DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF |
|
* SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART |
|
* OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY |
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
|
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
|
* |
|
* $OpenXM: OpenXM_contrib2/asir2000/parse/parse.y,v 1.16 2003/05/14 09:18:38 noro Exp $ |
|
*/ |
%{ |
%{ |
#define malloc(x) GC_malloc(x) |
#define malloc(x) GC_malloc(x) |
#define realloc(x,y) GC_realloc(x,y) |
#define realloc(x,y) GC_realloc(x,y) |
#define free(x) GC_free(x) |
#define free(x) GC_free(x) |
|
|
#if defined(THINK_C) |
|
#define alloca(x) GC_malloc(x) |
|
#endif |
|
#if defined(TOWNS) |
#if defined(TOWNS) |
#include <alloca.h> |
#include <alloca.h> |
#endif |
#endif |
#include <ctype.h> |
#include <ctype.h> |
#include "ca.h" |
#include "ca.h" |
#if !defined(THINK_C) |
|
#include <sys/types.h> |
#include <sys/types.h> |
#include <sys/stat.h> |
#include <sys/stat.h> |
#endif |
|
#include "parse.h" |
#include "parse.h" |
|
|
#define NOPR (prresult=0) |
#define NOPR (prresult=0) |
|
|
extern int gdef; |
extern int gdef,mgdef; |
extern SNODE parse_snode; |
extern SNODE parse_snode; |
extern int main_parser; |
extern int main_parser, allow_create_var; |
|
|
int prresult; |
int prresult; |
|
|
|
|
static NODE a,b; |
static NODE a,b; |
static NODE2 a2; |
static NODE2 a2; |
static pointer val; |
static pointer val; |
|
static QUOTE quote; |
extern jmp_buf env; |
extern jmp_buf env; |
%} |
%} |
|
|
Line 45 extern jmp_buf env; |
|
Line 89 extern jmp_buf env; |
|
pointer p; |
pointer p; |
} |
} |
|
|
%token <i> STRUCT POINT NEWSTRUCT ANS FDEF PFDEF GLOBAL CMP OR AND CAR CDR |
%token <i> STRUCT POINT NEWSTRUCT ANS FDEF PFDEF MODDEF MODEND GLOBAL MGLOBAL GLOBALF CMP OR AND CAR CDR QUOTED |
%token <i> DO WHILE FOR IF ELSE BREAK RETURN CONTINUE PARIF MAP TIMER GF2NGEN GFPNGEN GETOPT |
%token <i> DO WHILE FOR IF ELSE BREAK RETURN CONTINUE PARIF MAP RECMAP TIMER GF2NGEN GFPNGEN GFSNGEN GETOPT |
%token <i> FOP_AND FOP_OR FOP_IMPL FOP_REPL FOP_EQUIV FOP_NOT LOP |
%token <i> FOP_AND FOP_OR FOP_IMPL FOP_REPL FOP_EQUIV FOP_NOT LOP |
%token <p> FORMULA UCASE LCASE STR SELF BOPASS |
%token <p> FORMULA UCASE LCASE STR SELF BOPASS |
%token <p> '+' '-' '*' '/' '^' '%' |
%token <p> '+' '-' '*' '/' '^' '%' |
Line 54 extern jmp_buf env; |
|
Line 98 extern jmp_buf env; |
|
%type <p> desc rawstr |
%type <p> desc rawstr |
%type <f> expr pexpr opt |
%type <f> expr pexpr opt |
%type <s> stat complex |
%type <s> stat complex |
%type <n> stats node _node pvars fields members optlist |
%type <n> stats node _node pvars vars members optlist |
|
|
%right '=' BOPASS |
%right '=' BOPASS |
%right '?' ':' |
%right '?' ':' |
|
|
{ $$ = 0; } |
{ $$ = 0; } |
| GLOBAL { gdef=1; } pvars { gdef=0; } tail |
| GLOBAL { gdef=1; } pvars { gdef=0; } tail |
{ $$ = 0; } |
{ $$ = 0; } |
| STRUCT rawstr '{' fields '}' tail |
| GLOBALF vars tail |
|
{ register_proto($2); $$ = 0; } |
|
| MGLOBAL { mgdef=1; } pvars { mgdef=0; } tail |
|
{ $$ = 0; } |
|
| STRUCT rawstr '{' members '}' tail |
{ structdef($2,$4); $$ = 0; } |
{ structdef($2,$4); $$ = 0; } |
| STRUCT rawstr '{' fields '}' pvars tail |
|
{ structdef($2,$4); setstruct($2,$6); $$ = 0; } |
|
| STRUCT rawstr pvars tail |
|
{ setstruct($2,$3); $$ = 0; } |
|
| expr tail |
| expr tail |
{ $$ = mksnode(1,S_SINGLE,$1); } |
{ $$ = mksnode(1,S_SINGLE,$1); } |
| complex |
| complex |
|
|
{ $$ = mksnode(3,S_PFDEF,$1,$3,$7); NOPR; } |
{ $$ = mksnode(3,S_PFDEF,$1,$3,$7); NOPR; } |
| PFDEF LCASE '(' node ')' |
| PFDEF LCASE '(' node ')' |
{ $$ = mksnode(3,S_PFDEF,$2,$4,0); NOPR; } |
{ $$ = mksnode(3,S_PFDEF,$2,$4,0); NOPR; } |
| FDEF LCASE { mkpvs(); } '(' node ')' desc '{' stats '}' |
| FDEF LCASE { mkpvs($2); } '(' node ')' desc '{' stats '}' |
{ |
{ |
mkuf($2,asir_infile->name,$5, |
mkuf($2,asir_infile->name,$5, |
mksnode(1,S_CPLX,$9),$1,asir_infile->ln,$7); |
mksnode(1,S_CPLX,$9),$1,asir_infile->ln,$7,CUR_MODULE); |
$$ = 0; NOPR; |
$$ = 0; NOPR; |
} |
} |
|
| MODDEF LCASE tail |
|
{ CUR_MODULE = mkmodule($2); MPVS = CUR_MODULE->pvs; $$ = 0; NOPR; } |
|
| MODEND tail |
|
{ CUR_MODULE = 0; MPVS = 0; $$ = 0; NOPR; } |
| error tail |
| error tail |
{ yyerrok; $$ = 0; } |
{ yyerrok; $$ = 0; } |
; |
; |
|
|
{ if ( main_parser ) prresult = 1; } |
{ if ( main_parser ) prresult = 1; } |
| '$' |
| '$' |
{ if ( main_parser ) prresult = 0; } |
{ if ( main_parser ) prresult = 0; } |
|
; |
desc : |
desc : |
{ $$ = 0; } |
{ $$ = 0; } |
| STR |
| STR |
|
|
complex : '{' stats '}' |
complex : '{' stats '}' |
{ $$ = mksnode(1,S_CPLX,$2); } |
{ $$ = mksnode(1,S_CPLX,$2); } |
; |
; |
fields : |
|
{ $$ = 0; } |
|
| fields members tail |
|
{ MKNODE(a,0,$2); appendtonode($1,(pointer)a,&$$); } |
|
| fields STRUCT rawstr members tail |
|
{ MKNODE(a,$3,$4); appendtonode($1,(pointer)a,&$$); } |
|
; |
|
members : rawstr |
members : rawstr |
{ MKNODE($$,$1,0); } |
{ MKNODE($$,$1,0); } |
| members ',' rawstr |
| members ',' rawstr |
{ appendtonode($1,$3,&$$); } |
{ appendtonode($1,$3,&$$); } |
; |
; |
|
vars : LCASE |
|
{ MKNODE($$,$1,0); } |
|
| vars ',' LCASE |
|
{ appendtonode($1,$3,&$$); } |
|
; |
pvars : UCASE |
pvars : UCASE |
{ val = (pointer)makepvar($1); MKNODE($$,val,0); } |
{ val = (pointer)makepvar($1); MKNODE($$,val,0); } |
| pvars ',' UCASE |
| pvars ',' UCASE |
|
|
{ $$ = mkfnode(0,I_GF2NGEN); } |
{ $$ = mkfnode(0,I_GF2NGEN); } |
| GFPNGEN |
| GFPNGEN |
{ $$ = mkfnode(0,I_GFPNGEN); } |
{ $$ = mkfnode(0,I_GFPNGEN); } |
|
| GFSNGEN |
|
{ $$ = mkfnode(0,I_GFSNGEN); } |
| LCASE |
| LCASE |
{ |
{ |
FUNC f; |
FUNC f; |
|
|
} |
} |
| LCASE '(' node ')' |
| LCASE '(' node ')' |
{ |
{ |
searchf(sysf,$1,(FUNC *)&val); |
gen_searchf($1,(FUNC *)&val); |
if ( !val ) |
print_crossref(val); |
searchf(ubinf,$1,(FUNC *)&val); |
|
if ( !val ) |
|
searchpf($1,(FUNC *)&val); |
|
if ( !val ) |
|
searchf(usrf,$1,(FUNC *)&val); |
|
if ( !val ) |
|
appenduf($1,(FUNC *)&val); |
|
$$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$3)); |
$$ = mkfnode(2,I_FUNC,val,mkfnode(1,I_LIST,$3)); |
} |
} |
|
|
| LCASE '(' node '|' optlist ')' |
| LCASE '(' node '|' optlist ')' |
{ |
{ |
searchf(sysf,$1,(FUNC *)&val); |
gen_searchf($1,(FUNC *)&val); |
if ( !val ) |
print_crossref(val); |
searchf(ubinf,$1,(FUNC *)&val); |
|
if ( !val ) |
|
searchpf($1,(FUNC *)&val); |
|
if ( !val ) |
|
searchf(usrf,$1,(FUNC *)&val); |
|
if ( !val ) |
|
appenduf($1,(FUNC *)&val); |
|
$$ = mkfnode(3,I_FUNC_OPT,val, |
$$ = mkfnode(3,I_FUNC_OPT,val, |
mkfnode(1,I_LIST,$3),mkfnode(1,I_LIST,$5)); |
mkfnode(1,I_LIST,$3),mkfnode(1,I_LIST,$5)); |
} |
} |
|
| MAP '(' LCASE ',' node ')' |
|
{ |
|
gen_searchf($3,(FUNC *)&val); |
|
print_crossref(val); |
|
$$ = mkfnode(2,I_MAP,val,mkfnode(1,I_LIST,$5)); |
|
} |
|
| RECMAP '(' LCASE ',' node ')' |
|
{ |
|
gen_searchf($3,(FUNC *)&val); |
|
print_crossref(val); |
|
$$ = mkfnode(2,I_RECMAP,val,mkfnode(1,I_LIST,$5)); |
|
} |
| LCASE '{' node '}' '(' node ')' |
| LCASE '{' node '}' '(' node ')' |
{ |
{ |
searchpf($1,(FUNC *)&val); |
searchpf($1,(FUNC *)&val); |
|
|
{ |
{ |
$$ = mkfnode(2,I_GETOPT,$3); |
$$ = mkfnode(2,I_GETOPT,$3); |
} |
} |
| MAP '(' LCASE ',' node ')' |
| GETOPT '(' ')' |
{ |
{ |
searchf(sysf,$3,(FUNC *)&val); |
$$ = mkfnode(2,I_GETOPT,0); |
if ( !val ) |
|
searchf(ubinf,$3,(FUNC *)&val); |
|
if ( !val ) |
|
searchpf($3,(FUNC *)&val); |
|
if ( !val ) |
|
searchf(usrf,$3,(FUNC *)&val); |
|
if ( !val ) |
|
appenduf($3,(FUNC *)&val); |
|
$$ = mkfnode(2,I_MAP,val,mkfnode(1,I_LIST,$5)); |
|
} |
} |
| TIMER '(' expr ',' expr ',' expr ')' |
| TIMER '(' expr ',' expr ',' expr ')' |
{ |
{ |
$$ = mkfnode(3,I_TIMER,$3,$5,$7); |
$$ = mkfnode(3,I_TIMER,$3,$5,$7); |
} |
} |
|
| PARIF '(' LCASE ')' |
|
{ |
|
searchf(parif,$3,(FUNC *)&val); |
|
if ( !val ) |
|
mkparif($3,(FUNC *)&val); |
|
$$ = mkfnode(2,I_FUNC,val,0); |
|
} |
| PARIF '(' LCASE ',' node ')' |
| PARIF '(' LCASE ',' node ')' |
{ |
{ |
searchf(parif,$3,(FUNC *)&val); |
searchf(parif,$3,(FUNC *)&val); |
|
|
| CDR '(' expr ')' |
| CDR '(' expr ')' |
{ $$ = mkfnode(1,I_CDR,$3); } |
{ $$ = mkfnode(1,I_CDR,$3); } |
| '(' expr ')' |
| '(' expr ')' |
{ $$ = $2; } |
{ $$ = mkfnode(1,I_PAREN,$2); } |
| UCASE |
| UCASE |
{ |
{ |
if ( main_parser ) |
if ( main_parser || allow_create_var ) |
$$ = mkfnode(2,I_PVAR,makepvar($1),0); |
$$ = mkfnode(2,I_PVAR,makepvar($1),0); |
else { |
else { |
ind = searchpvar($1); |
ind = searchpvar($1); |
|
|
} |
} |
} |
} |
| pexpr POINT rawstr |
| pexpr POINT rawstr |
{ memberofstruct($1,$3,&$$); } |
{ $$ = mkfnode(2,I_POINT,$1,$3); } |
; |
; |
expr : pexpr |
expr : pexpr |
{ $$ = $1; } |
{ $$ = $1; } |
|
|
| '+' expr %prec PLUS |
| '+' expr %prec PLUS |
{ $$ = $2; } |
{ $$ = $2; } |
| '-' expr %prec MINUS |
| '-' expr %prec MINUS |
{ $$ = mkfnode(3,I_BOP,$1,0,$2); } |
{ $$ = mkfnode(1,I_MINUS,$2); } |
| expr '+' expr |
| expr '+' expr |
{ $$ = mkfnode(3,I_BOP,$2,$1,$3); } |
{ $$ = mkfnode(3,I_BOP,$2,$1,$3); } |
| expr '-' expr |
| expr '-' expr |
|
|
{ $$ = mkfnode(1,I_EV,$2); } |
{ $$ = mkfnode(1,I_EV,$2); } |
| NEWSTRUCT '(' rawstr ')' |
| NEWSTRUCT '(' rawstr ')' |
{ $$ = mkfnode(1,I_NEWCOMP,(int)structtoindex($3)); } |
{ $$ = mkfnode(1,I_NEWCOMP,(int)structtoindex($3)); } |
|
| QUOTED '(' expr ')' |
|
{ MKQUOTE(quote,$3); $$ = mkfnode(1,I_FORMULA,(pointer)quote); } |
; |
; |
%% |
%% |