From fd4d3a856fa8ff145501a55259012c83ff84b399 Mon Sep 17 00:00:00 2001 From: partain Date: Tue, 9 Jan 1996 18:40:23 +0000 Subject: [PATCH] [project @ 1996-01-09 18:40:14 by partain] --- ghc/utils/ugen/lex.c | 514 ++++++++++++++++++++++++++ ghc/utils/ugen/syntax.tab.c | 858 +++++++++++++++++++++++++++++++++++++++++++ ghc/utils/ugen/syntax.tab.h | 13 + ghc/utils/ugen/tree.c | 205 +++++++++++ ghc/utils/ugen/tree.h | 49 +++ 5 files changed, 1639 insertions(+) create mode 100644 ghc/utils/ugen/lex.c create mode 100644 ghc/utils/ugen/syntax.tab.c create mode 100644 ghc/utils/ugen/syntax.tab.h create mode 100644 ghc/utils/ugen/tree.c create mode 100644 ghc/utils/ugen/tree.h diff --git a/ghc/utils/ugen/lex.c b/ghc/utils/ugen/lex.c new file mode 100644 index 0000000..51c41fe --- /dev/null +++ b/ghc/utils/ugen/lex.c @@ -0,0 +1,514 @@ +# include "stdio.h" +# define U(x) x +# define NLSTATE yyprevious=YYNEWLINE +# define BEGIN yybgin = yysvec + 1 + +# define INITIAL 0 +# define YYLERR yysvec +# define YYSTATE (yyestate-yysvec-1) +# define YYOPTIM 1 +# define YYLMAX BUFSIZ +# define output(c) putc(c,yyout) +# define input() (((yytchar=yysptr>yysbuf?U(*--yysptr):getc(yyin))==10?(yylineno++,yytchar):yytchar)==EOF?0:yytchar) +# define unput(c) {yytchar= (c);if(yytchar=='\n')yylineno--;*yysptr++=yytchar;} +# define yymore() (yymorfg=1) +# define ECHO fprintf(yyout, "%s",yytext) +# define REJECT { nstr = yyreject(); goto yyfussy;} +int yyleng; extern char yytext[]; +int yymorfg; +extern char *yysptr, yysbuf[]; +int yytchar; +FILE *yyin = {stdin}, *yyout = {stdout}; +extern int yylineno; +struct yysvf { + struct yywork *yystoff; + struct yysvf *yyother; + int *yystops;}; +struct yysvf *yyestate; +extern struct yysvf yysvec[], *yybgin; +#define YYSTYPE long + +#ifdef __STDC__ +#define PROTO(x) x +#else +#define PROTO(x) () +#endif + +# include "syntax.tab.h" +# include +# include "id.h" +# include "tree.h" +# include "funs.h" +extern YYSTYPE yylval; +extern FILE *fc, *fhs; +#undef ECHO /* partain */ +#define ECHO /*fprintf(stderr, "%s", yytext)*/ + +# define YYNEWLINE 10 +yylex(){ +int nstr; extern int yyprevious; +while((nstr = yylook()) >= 0) +yyfussy: switch(nstr){ +case 0: +if(yywrap()) return(0); break; +case 1: + { ECHO; return(SEMICOL); } +break; +case 2: + { ECHO; return(COLON); } +break; +case 3: + { ECHO; return(STDEF); } +break; +case 4: + { ECHO; return(ENDDEF); } +break; +case 5: + { ECHO; return(TYPE); } +break; +case 6: + { ECHO; return(END); } +break; +case 7: +{ + ECHO; + yylval = (YYSTYPE) installid(yytext); + return(ID); + } +break; +case 8: + ECHO; +break; +case 9: + ECHO; +break; +case 10: +ECHO; +break; +case 11: +{ /* partain: for Haskell includes */ + ECHO; + yytext[yyleng-3] = '\0'; + fprintf(fhs, "\n%s", &yytext[3]); + } +break; +case 12: +{ + ECHO; + yytext[yyleng-2] = '\0'; + fprintf(fc, "\n%s", &yytext[2]); + } +break; +case -1: +break; +default: +fprintf(yyout,"bad switch yylook %d",nstr); +} return(0); } +/* end of yylex */ +int +yywrap() +{ + return(1); +} +int yyvstop[] = { +0, + +8, +0, + +9, +0, + +8, +0, + +8, +0, + +2, +8, +0, + +1, +8, +0, + +3, +8, +0, + +4, +8, +0, + +7, +8, +0, + +7, +8, +0, + +7, +8, +0, + +7, +0, + +7, +0, + +7, +0, + +6, +7, +0, + +7, +0, + +12, +0, + +10, +0, + +5, +7, +0, + +12, +0, + +11, +0, +0}; +# define YYTYPE char +struct yywork { YYTYPE verify, advance; } yycrank[] = { +0,0, 0,0, 1,3, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 1,4, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 1,5, 0,0, +0,0, 0,0, 0,0, 1,3, +6,15, 0,0, 0,0, 15,15, +1,6, 1,3, 20,19, 26,21, +0,0, 0,0, 0,0, 0,0, +15,15, 22,15, 0,0, 1,7, +1,8, 1,9, 22,27, 1,10, +0,0, 0,0, 1,11, 2,7, +2,8, 2,9, 0,0, 2,10, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 15,15, +0,0, 0,0, 0,0, 0,0, +15,22, 0,0, 0,0, 0,0, +0,0, 15,15, 15,15, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 1,12, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 2,12, 15,15, +17,23, 24,28, 0,0, 0,0, +0,0, 1,13, 0,0, 0,0, +12,17, 0,0, 0,0, 18,24, +5,14, 2,13, 1,3, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 13,18, 20,25, 26,29, +29,30, 0,0, 0,0, 0,0, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 0,0, 15,15, +0,0, 0,0, 11,16, 0,0, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 11,16, 11,16, +11,16, 11,16, 14,19, 0,0, +19,19, 0,0, 21,21, 0,0, +0,0, 0,0, 0,0, 14,19, +0,0, 19,19, 0,0, 21,21, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 14,20, 0,0, +19,20, 0,0, 21,26, 14,19, +0,0, 19,19, 0,0, 21,21, +14,19, 14,19, 19,19, 19,19, +21,21, 21,21, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 14,19, 0,0, +19,19, 0,0, 21,21, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +0,0, 0,0, 0,0, 0,0, +14,21, 0,0, 14,19, 0,0, +19,19, 0,0, 21,21, 0,0, +0,0}; +struct yysvf yysvec[] = { +0, 0, 0, +yycrank+-1, 0, 0, +yycrank+-9, yysvec+1, 0, +yycrank+0, 0, yyvstop+1, +yycrank+0, 0, yyvstop+3, +yycrank+1, 0, yyvstop+5, +yycrank+2, 0, yyvstop+7, +yycrank+0, 0, yyvstop+9, +yycrank+0, 0, yyvstop+12, +yycrank+0, 0, yyvstop+15, +yycrank+0, 0, yyvstop+18, +yycrank+79, 0, yyvstop+21, +yycrank+10, yysvec+11, yyvstop+24, +yycrank+16, yysvec+11, yyvstop+27, +yycrank+-201, 0, 0, +yycrank+-46, 0, 0, +yycrank+0, yysvec+11, yyvstop+30, +yycrank+12, yysvec+11, yyvstop+32, +yycrank+11, yysvec+11, yyvstop+34, +yycrank+-203, 0, 0, +yycrank+-13, yysvec+19, 0, +yycrank+-205, 0, 0, +yycrank+-15, yysvec+15, 0, +yycrank+0, yysvec+11, yyvstop+36, +yycrank+12, yysvec+11, yyvstop+39, +yycrank+0, 0, yyvstop+41, +yycrank+-14, yysvec+21, 0, +yycrank+0, 0, yyvstop+43, +yycrank+0, yysvec+11, yyvstop+45, +yycrank+15, 0, yyvstop+48, +yycrank+0, 0, yyvstop+50, +0, 0, 0}; +struct yywork *yytop = yycrank+330; +struct yysvf *yybgin = yysvec+1; +char yymatch[] = { +00 ,01 ,01 ,01 ,01 ,01 ,01 ,01 , +01 ,01 ,012 ,01 ,01 ,01 ,01 ,01 , +01 ,01 ,01 ,01 ,01 ,01 ,01 ,01 , +01 ,01 ,01 ,01 ,01 ,01 ,01 ,01 , +01 ,01 ,01 ,01 ,01 ,'%' ,01 ,01 , +01 ,01 ,'*' ,01 ,01 ,01 ,01 ,'/' , +'0' ,'0' ,'0' ,'0' ,'0' ,'0' ,'0' ,'0' , +'0' ,'0' ,01 ,01 ,01 ,01 ,01 ,01 , +01 ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' , +'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' , +'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' , +'A' ,'A' ,'A' ,01 ,01 ,01 ,01 ,'0' , +01 ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' , +'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' , +'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' ,'A' , +'A' ,'A' ,'A' ,01 ,01 ,'}' ,01 ,01 , +0}; +char yyextra[] = { +0,0,0,0,0,0,0,0, +0,0,0,0,0,0,0,0, +0}; +#ifndef lint +static char ncform_sccsid[] = "@(#)ncform 1.6 88/02/08 SMI"; /* from S5R2 1.2 */ +#endif + +int yylineno =1; +# define YYU(x) x +# define NLSTATE yyprevious=YYNEWLINE +char yytext[YYLMAX]; +struct yysvf *yylstate [YYLMAX], **yylsp, **yyolsp; +char yysbuf[YYLMAX]; +char *yysptr = yysbuf; +int *yyfnd; +extern struct yysvf *yyestate; +int yyprevious = YYNEWLINE; +yylook(){ + register struct yysvf *yystate, **lsp; + register struct yywork *yyt; + struct yysvf *yyz; + int yych, yyfirst; + struct yywork *yyr; +# ifdef LEXDEBUG + int debug; +# endif + char *yylastch; + /* start off machines */ +# ifdef LEXDEBUG + debug = 0; +# endif + yyfirst=1; + if (!yymorfg) + yylastch = yytext; + else { + yymorfg=0; + yylastch = yytext+yyleng; + } + for(;;){ + lsp = yylstate; + yyestate = yystate = yybgin; + if (yyprevious==YYNEWLINE) yystate++; + for (;;){ +# ifdef LEXDEBUG + if(debug)fprintf(yyout,"state %d\n",yystate-yysvec-1); +# endif + yyt = yystate->yystoff; + if(yyt == yycrank && !yyfirst){ /* may not be any transitions */ + yyz = yystate->yyother; + if(yyz == 0)break; + if(yyz->yystoff == yycrank)break; + } + *yylastch++ = yych = input(); + yyfirst=0; + tryagain: +# ifdef LEXDEBUG + if(debug){ + fprintf(yyout,"char "); + allprint(yych); + putchar('\n'); + } +# endif + yyr = yyt; + if ( (int)yyt > (int)yycrank){ + yyt = yyr + yych; + if (yyt <= yytop && yyt->verify+yysvec == yystate){ + if(yyt->advance+yysvec == YYLERR) /* error transitions */ + {unput(*--yylastch);break;} + *lsp++ = yystate = yyt->advance+yysvec; + goto contin; + } + } +# ifdef YYOPTIM + else if((int)yyt < (int)yycrank) { /* r < yycrank */ + yyt = yyr = yycrank+(yycrank-yyt); +# ifdef LEXDEBUG + if(debug)fprintf(yyout,"compressed state\n"); +# endif + yyt = yyt + yych; + if(yyt <= yytop && yyt->verify+yysvec == yystate){ + if(yyt->advance+yysvec == YYLERR) /* error transitions */ + {unput(*--yylastch);break;} + *lsp++ = yystate = yyt->advance+yysvec; + goto contin; + } + yyt = yyr + YYU(yymatch[yych]); +# ifdef LEXDEBUG + if(debug){ + fprintf(yyout,"try fall back character "); + allprint(YYU(yymatch[yych])); + putchar('\n'); + } +# endif + if(yyt <= yytop && yyt->verify+yysvec == yystate){ + if(yyt->advance+yysvec == YYLERR) /* error transition */ + {unput(*--yylastch);break;} + *lsp++ = yystate = yyt->advance+yysvec; + goto contin; + } + } + if ((yystate = yystate->yyother) && (yyt= yystate->yystoff) != yycrank){ +# ifdef LEXDEBUG + if(debug)fprintf(yyout,"fall back to state %d\n",yystate-yysvec-1); +# endif + goto tryagain; + } +# endif + else + {unput(*--yylastch);break;} + contin: +# ifdef LEXDEBUG + if(debug){ + fprintf(yyout,"state %d char ",yystate-yysvec-1); + allprint(yych); + putchar('\n'); + } +# endif + ; + } +# ifdef LEXDEBUG + if(debug){ + fprintf(yyout,"stopped at %d with ",*(lsp-1)-yysvec-1); + allprint(yych); + putchar('\n'); + } +# endif + while (lsp-- > yylstate){ + *yylastch-- = 0; + if (*lsp != 0 && (yyfnd= (*lsp)->yystops) && *yyfnd > 0){ + yyolsp = lsp; + if(yyextra[*yyfnd]){ /* must backup */ + while(yyback((*lsp)->yystops,-*yyfnd) != 1 && lsp > yylstate){ + lsp--; + unput(*yylastch--); + } + } + yyprevious = YYU(*yylastch); + yylsp = lsp; + yyleng = yylastch-yytext+1; + yytext[yyleng] = 0; +# ifdef LEXDEBUG + if(debug){ + fprintf(yyout,"\nmatch "); + sprint(yytext); + fprintf(yyout," action %d\n",*yyfnd); + } +# endif + return(*yyfnd++); + } + unput(*yylastch); + } + if (yytext[0] == 0 /* && feof(yyin) */) + { + yysptr=yysbuf; + return(0); + } + yyprevious = yytext[0] = input(); + if (yyprevious>0) + output(yyprevious); + yylastch=yytext; +# ifdef LEXDEBUG + if(debug)putchar('\n'); +# endif + } + } +yyback(p, m) + int *p; +{ +if (p==0) return(0); +while (*p) + { + if (*p++ == m) + return(1); + } +return(0); +} + /* the following are only used in the lex library */ +yyinput(){ + return(input()); + } +yyoutput(c) + int c; { + output(c); + } +yyunput(c) + int c; { + unput(c); + } diff --git a/ghc/utils/ugen/syntax.tab.c b/ghc/utils/ugen/syntax.tab.c new file mode 100644 index 0000000..9cb6e56 --- /dev/null +++ b/ghc/utils/ugen/syntax.tab.c @@ -0,0 +1,858 @@ + +/* A Bison parser, made from syntax.y with Bison version GNU Bison version 1.21 + */ + +#define YYBISON 1 /* Identify Bison output. */ + +#define ID 258 +#define TYPE 259 +#define SEMICOL 260 +#define COLON 261 +#define END 262 +#define STDEF 263 +#define ENDDEF 264 + +#line 1 "syntax.y" + +#define YYSTYPE long +# include "id.h" +# include "tree.h" +extern tree root; + +#ifndef YYLTYPE +typedef + struct yyltype + { + int timestamp; + int first_line; + int first_column; + int last_line; + int last_column; + char *text; + } + yyltype; + +#define YYLTYPE yyltype +#endif + +#ifndef YYSTYPE +#define YYSTYPE int +#endif +#include + +#ifndef __cplusplus +#ifndef __STDC__ +#define const +#endif +#endif + + + +#define YYFINAL 25 +#define YYFLAG -32768 +#define YYNTBASE 10 + +#define YYTRANSLATE(x) ((unsigned)(x) <= 264 ? yytranslate[x] : 15) + +static const char yytranslate[] = { 0, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, + 6, 7, 8, 9 +}; + +#if YYDEBUG != 0 +static const short yyprhs[] = { 0, + 0, 7, 9, 12, 19, 25, 27, 30 +}; + +static const short yyrhs[] = { 4, + 3, 5, 11, 7, 5, 0, 12, 0, 11, 12, + 0, 3, 6, 8, 13, 9, 5, 0, 3, 6, + 8, 9, 5, 0, 14, 0, 13, 14, 0, 3, + 6, 3, 5, 0 +}; + +#endif + +#if YYDEBUG != 0 +static const short yyrline[] = { 0, + 10, 16, 20, 26, 30, 36, 40, 46 +}; + +static const char * const yytname[] = { "$","error","$illegal.","ID","TYPE", +"SEMICOL","COLON","END","STDEF","ENDDEF","typdef","deflist","def","itemlist", +"item","" +}; +#endif + +static const short yyr1[] = { 0, + 10, 11, 11, 12, 12, 13, 13, 14 +}; + +static const short yyr2[] = { 0, + 6, 1, 2, 6, 5, 1, 2, 4 +}; + +static const short yydefact[] = { 0, + 0, 0, 0, 0, 0, 2, 0, 0, 3, 0, + 1, 0, 0, 0, 6, 0, 5, 0, 7, 0, + 4, 8, 0, 0, 0 +}; + +static const short yydefgoto[] = { 23, + 5, 6, 14, 15 +}; + +static const short yypact[] = { -1, + 2, 4, 7, -4, 1,-32768, 3, 8,-32768, -3, +-32768, 6, 9, -2,-32768, 12,-32768, 11,-32768, 13, +-32768,-32768, 17, 19,-32768 +}; + +static const short yypgoto[] = {-32768, +-32768, 15,-32768, 10 +}; + + +#define YYLAST 24 + + +static const short yytable[] = { 12, + 12, 7, 1, 4, 2, 13, 18, 8, 3, 4, + 10, 16, 11, 17, 20, 21, 24, 22, 25, 9, + 0, 0, 0, 19 +}; + +static const short yycheck[] = { 3, + 3, 6, 4, 3, 3, 9, 9, 7, 5, 3, + 8, 6, 5, 5, 3, 5, 0, 5, 0, 5, + -1, -1, -1, 14 +}; +/* -*-C-*- Note some compilers choke on comments on `#line' lines. */ +#line 3 "/usr/local/gnu/lib/bison.simple" + +/* Skeleton output parser for bison, + Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 1, or (at your option) + any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ + + +#ifndef alloca +#ifdef __GNUC__ +#define alloca __builtin_alloca +#else /* not GNU C. */ +#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) +#include +#else /* not sparc */ +#if defined (MSDOS) && !defined (__TURBOC__) +#include +#else /* not MSDOS, or __TURBOC__ */ +#if defined(_AIX) +#include + #pragma alloca +#else /* not MSDOS, __TURBOC__, or _AIX */ +#ifdef __hpux +#ifdef __cplusplus +extern "C" { +void *alloca (unsigned int); +}; +#else /* not __cplusplus */ +void *alloca (unsigned int); +#endif /* not __cplusplus */ +#endif /* __hpux */ +#endif /* not _AIX */ +#endif /* not MSDOS, or __TURBOC__ */ +#endif /* not sparc. */ +#endif /* not GNU C. */ +#endif /* alloca not defined. */ + +/* This is the parser code that is written into each bison parser + when the %semantic_parser declaration is not specified in the grammar. + It was written by Richard Stallman by simplifying the hairy parser + used when %semantic_parser is specified. */ + +/* Note: there must be only one dollar sign in this file. + It is replaced by the list of actions, each action + as one case of the switch. */ + +#define yyerrok (yyerrstatus = 0) +#define yyclearin (yychar = YYEMPTY) +#define YYEMPTY -2 +#define YYEOF 0 +#define YYACCEPT return(0) +#define YYABORT return(1) +#define YYERROR goto yyerrlab1 +/* Like YYERROR except do call yyerror. + This remains here temporarily to ease the + transition to the new meaning of YYERROR, for GCC. + Once GCC version 2 has supplanted version 1, this can go. */ +#define YYFAIL goto yyerrlab +#define YYRECOVERING() (!!yyerrstatus) +#define YYBACKUP(token, value) \ +do \ + if (yychar == YYEMPTY && yylen == 1) \ + { yychar = (token), yylval = (value); \ + yychar1 = YYTRANSLATE (yychar); \ + YYPOPSTACK; \ + goto yybackup; \ + } \ + else \ + { yyerror ("syntax error: cannot back up"); YYERROR; } \ +while (0) + +#define YYTERROR 1 +#define YYERRCODE 256 + +#ifndef YYPURE +#define YYLEX yylex() +#endif + +#ifdef YYPURE +#ifdef YYLSP_NEEDED +#define YYLEX yylex(&yylval, &yylloc) +#else +#define YYLEX yylex(&yylval) +#endif +#endif + +/* If nonreentrant, generate the variables here */ + +#ifndef YYPURE + +int yychar; /* the lookahead symbol */ +YYSTYPE yylval; /* the semantic value of the */ + /* lookahead symbol */ + +#ifdef YYLSP_NEEDED +YYLTYPE yylloc; /* location data for the lookahead */ + /* symbol */ +#endif + +int yynerrs; /* number of parse errors so far */ +#endif /* not YYPURE */ + +#if YYDEBUG != 0 +int yydebug; /* nonzero means print parse trace */ +/* Since this is uninitialized, it does not stop multiple parsers + from coexisting. */ +#endif + +/* YYINITDEPTH indicates the initial size of the parser's stacks */ + +#ifndef YYINITDEPTH +#define YYINITDEPTH 200 +#endif + +/* YYMAXDEPTH is the maximum size the stacks can grow to + (effective only if the built-in stack extension method is used). */ + +#if YYMAXDEPTH == 0 +#undef YYMAXDEPTH +#endif + +#ifndef YYMAXDEPTH +#define YYMAXDEPTH 10000 +#endif + +/* Prevent warning if -Wstrict-prototypes. */ +#ifdef __GNUC__ +int yyparse (void); +#endif + +#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ +#define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT) +#else /* not GNU C or C++ */ +#ifndef __cplusplus + +/* This is the most reliable way to avoid incompatibilities + in available built-in functions on various systems. */ +static void +__yy_bcopy (from, to, count) + char *from; + char *to; + int count; +{ + register char *f = from; + register char *t = to; + register int i = count; + + while (i-- > 0) + *t++ = *f++; +} + +#else /* __cplusplus */ + +/* This is the most reliable way to avoid incompatibilities + in available built-in functions on various systems. */ +static void +__yy_bcopy (char *from, char *to, int count) +{ + register char *f = from; + register char *t = to; + register int i = count; + + while (i-- > 0) + *t++ = *f++; +} + +#endif +#endif + +#line 184 "/usr/local/gnu/lib/bison.simple" +int +yyparse() +{ + register int yystate; + register int yyn; + register short *yyssp; + register YYSTYPE *yyvsp; + int yyerrstatus; /* number of tokens to shift before error messages enabled */ + int yychar1; /* lookahead token as an internal (translated) token number */ + + short yyssa[YYINITDEPTH]; /* the state stack */ + YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ + + short *yyss = yyssa; /* refer to the stacks thru separate pointers */ + YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ + +#ifdef YYLSP_NEEDED + YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ + YYLTYPE *yyls = yylsa; + YYLTYPE *yylsp; + +#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) +#else +#define YYPOPSTACK (yyvsp--, yyssp--) +#endif + + int yystacksize = YYINITDEPTH; + +#ifdef YYPURE + int yychar; + YYSTYPE yylval; + int yynerrs; +#ifdef YYLSP_NEEDED + YYLTYPE yylloc; +#endif +#endif + + YYSTYPE yyval; /* the variable used to return */ + /* semantic values from the action */ + /* routines */ + + int yylen; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Starting parse\n"); +#endif + + yystate = 0; + yyerrstatus = 0; + yynerrs = 0; + yychar = YYEMPTY; /* Cause a token to be read. */ + + /* Initialize stack pointers. + Waste one element of value and location stack + so that they stay on the same level as the state stack. + The wasted elements are never initialized. */ + + yyssp = yyss - 1; + yyvsp = yyvs; +#ifdef YYLSP_NEEDED + yylsp = yyls; +#endif + +/* Push a new state, which is found in yystate . */ +/* In all cases, when you get here, the value and location stacks + have just been pushed. so pushing a state here evens the stacks. */ +yynewstate: + + *++yyssp = yystate; + + if (yyssp >= yyss + yystacksize - 1) + { + /* Give user a chance to reallocate the stack */ + /* Use copies of these so that the &'s don't force the real ones into memory. */ + YYSTYPE *yyvs1 = yyvs; + short *yyss1 = yyss; +#ifdef YYLSP_NEEDED + YYLTYPE *yyls1 = yyls; +#endif + + /* Get the current used size of the three stacks, in elements. */ + int size = yyssp - yyss + 1; + +#ifdef yyoverflow + /* Each stack pointer address is followed by the size of + the data in use in that stack, in bytes. */ + yyoverflow("parser stack overflow", + &yyss1, size * sizeof (*yyssp), + &yyvs1, size * sizeof (*yyvsp), +#ifdef YYLSP_NEEDED + &yyls1, size * sizeof (*yylsp), +#endif + &yystacksize); + + yyss = yyss1; yyvs = yyvs1; +#ifdef YYLSP_NEEDED + yyls = yyls1; +#endif +#else /* no yyoverflow */ + /* Extend the stack our own way. */ + if (yystacksize >= YYMAXDEPTH) + { + yyerror("parser stack overflow"); + return 2; + } + yystacksize *= 2; + if (yystacksize > YYMAXDEPTH) + yystacksize = YYMAXDEPTH; + yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); + __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); + yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); + __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); +#ifdef YYLSP_NEEDED + yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); + __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp)); +#endif +#endif /* no yyoverflow */ + + yyssp = yyss + size - 1; + yyvsp = yyvs + size - 1; +#ifdef YYLSP_NEEDED + yylsp = yyls + size - 1; +#endif + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Stack size increased to %d\n", yystacksize); +#endif + + if (yyssp >= yyss + yystacksize - 1) + YYABORT; + } + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Entering state %d\n", yystate); +#endif + + goto yybackup; + yybackup: + +/* Do appropriate processing given the current state. */ +/* Read a lookahead token if we need one and don't already have one. */ +/* yyresume: */ + + /* First try to decide what to do without reference to lookahead token. */ + + yyn = yypact[yystate]; + if (yyn == YYFLAG) + goto yydefault; + + /* Not known => get a lookahead token if don't already have one. */ + + /* yychar is either YYEMPTY or YYEOF + or a valid token in external form. */ + + if (yychar == YYEMPTY) + { +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Reading a token: "); +#endif + yychar = YYLEX; + } + + /* Convert token to internal form (in yychar1) for indexing tables with */ + + if (yychar <= 0) /* This means end of input. */ + { + yychar1 = 0; + yychar = YYEOF; /* Don't call YYLEX any more */ + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Now at end of input.\n"); +#endif + } + else + { + yychar1 = YYTRANSLATE(yychar); + +#if YYDEBUG != 0 + if (yydebug) + { + fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); + /* Give the individual parser a way to print the precise meaning + of a token, for further debugging info. */ +#ifdef YYPRINT + YYPRINT (stderr, yychar, yylval); +#endif + fprintf (stderr, ")\n"); + } +#endif + } + + yyn += yychar1; + if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) + goto yydefault; + + yyn = yytable[yyn]; + + /* yyn is what to do for this token type in this state. + Negative => reduce, -yyn is rule number. + Positive => shift, yyn is new state. + New state is final state => don't bother to shift, + just return success. + 0, or most negative number => error. */ + + if (yyn < 0) + { + if (yyn == YYFLAG) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + else if (yyn == 0) + goto yyerrlab; + + if (yyn == YYFINAL) + YYACCEPT; + + /* Shift the lookahead token. */ + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); +#endif + + /* Discard the token being shifted unless it is eof. */ + if (yychar != YYEOF) + yychar = YYEMPTY; + + *++yyvsp = yylval; +#ifdef YYLSP_NEEDED + *++yylsp = yylloc; +#endif + + /* count tokens shifted since error; after three, turn off error status. */ + if (yyerrstatus) yyerrstatus--; + + yystate = yyn; + goto yynewstate; + +/* Do the default action for the current state. */ +yydefault: + + yyn = yydefact[yystate]; + if (yyn == 0) + goto yyerrlab; + +/* Do a reduction. yyn is the number of a rule to reduce with. */ +yyreduce: + yylen = yyr2[yyn]; + yyval = yyvsp[1-yylen]; /* implement default value of the action */ + +#if YYDEBUG != 0 + if (yydebug) + { + int i; + + fprintf (stderr, "Reducing via rule %d (line %d), ", + yyn, yyrline[yyn]); + + /* Print the symbols being reduced, and their result. */ + for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) + fprintf (stderr, "%s ", yytname[yyrhs[i]]); + fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); + } +#endif + + + switch (yyn) { + +case 1: +#line 12 "syntax.y" +{ + root = mktypdef(yyvsp[-4], yyvsp[-2]); + ; + break;} +case 2: +#line 18 "syntax.y" +{ + yyval = yyvsp[0]; + ; + break;} +case 3: +#line 22 "syntax.y" +{ + yyval = (long) mkdeflist(yyvsp[-1], yyvsp[0]); + ; + break;} +case 4: +#line 28 "syntax.y" +{ + yyval = (long) mkdef(yyvsp[-5], yyvsp[-2]); + ; + break;} +case 5: +#line 32 "syntax.y" +{ + yyval = (long) mkdef(yyvsp[-4], mkemitemlist()); + ; + break;} +case 6: +#line 38 "syntax.y" +{ + yyval = yyvsp[0]; + ; + break;} +case 7: +#line 42 "syntax.y" +{ + yyval = (long) mkitemlist(yyvsp[-1], yyvsp[0]); + ; + break;} +case 8: +#line 48 "syntax.y" +{ + yyval = (long) mkitem(yyvsp[-3], yyvsp[-1]); + ; + break;} +} + /* the action file gets copied in in place of this dollarsign */ +#line 457 "/usr/local/gnu/lib/bison.simple" + + yyvsp -= yylen; + yyssp -= yylen; +#ifdef YYLSP_NEEDED + yylsp -= yylen; +#endif + +#if YYDEBUG != 0 + if (yydebug) + { + short *ssp1 = yyss - 1; + fprintf (stderr, "state stack now"); + while (ssp1 != yyssp) + fprintf (stderr, " %d", *++ssp1); + fprintf (stderr, "\n"); + } +#endif + + *++yyvsp = yyval; + +#ifdef YYLSP_NEEDED + yylsp++; + if (yylen == 0) + { + yylsp->first_line = yylloc.first_line; + yylsp->first_column = yylloc.first_column; + yylsp->last_line = (yylsp-1)->last_line; + yylsp->last_column = (yylsp-1)->last_column; + yylsp->text = 0; + } + else + { + yylsp->last_line = (yylsp+yylen-1)->last_line; + yylsp->last_column = (yylsp+yylen-1)->last_column; + } +#endif + + /* Now "shift" the result of the reduction. + Determine what state that goes to, + based on the state we popped back to + and the rule number reduced by. */ + + yyn = yyr1[yyn]; + + yystate = yypgoto[yyn - YYNTBASE] + *yyssp; + if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) + yystate = yytable[yystate]; + else + yystate = yydefgoto[yyn - YYNTBASE]; + + goto yynewstate; + +yyerrlab: /* here on detecting error */ + + if (! yyerrstatus) + /* If not already recovering from an error, report this error. */ + { + ++yynerrs; + +#ifdef YYERROR_VERBOSE + yyn = yypact[yystate]; + + if (yyn > YYFLAG && yyn < YYLAST) + { + int size = 0; + char *msg; + int x, count; + + count = 0; + /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ + for (x = (yyn < 0 ? -yyn : 0); + x < (sizeof(yytname) / sizeof(char *)); x++) + if (yycheck[x + yyn] == x) + size += strlen(yytname[x]) + 15, count++; + msg = (char *) malloc(size + 15); + if (msg != 0) + { + strcpy(msg, "parse error"); + + if (count < 5) + { + count = 0; + for (x = (yyn < 0 ? -yyn : 0); + x < (sizeof(yytname) / sizeof(char *)); x++) + if (yycheck[x + yyn] == x) + { + strcat(msg, count == 0 ? ", expecting `" : " or `"); + strcat(msg, yytname[x]); + strcat(msg, "'"); + count++; + } + } + yyerror(msg); + free(msg); + } + else + yyerror ("parse error; also virtual memory exceeded"); + } + else +#endif /* YYERROR_VERBOSE */ + yyerror("parse error"); + } + + goto yyerrlab1; +yyerrlab1: /* here on error raised explicitly by an action */ + + if (yyerrstatus == 3) + { + /* if just tried and failed to reuse lookahead token after an error, discard it. */ + + /* return failure if at end of input */ + if (yychar == YYEOF) + YYABORT; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); +#endif + + yychar = YYEMPTY; + } + + /* Else will try to reuse lookahead token + after shifting the error token. */ + + yyerrstatus = 3; /* Each real token shifted decrements this */ + + goto yyerrhandle; + +yyerrdefault: /* current state does not do anything special for the error token. */ + +#if 0 + /* This is wrong; only states that explicitly want error tokens + should shift them. */ + yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ + if (yyn) goto yydefault; +#endif + +yyerrpop: /* pop the current state because it cannot handle the error token */ + + if (yyssp == yyss) YYABORT; + yyvsp--; + yystate = *--yyssp; +#ifdef YYLSP_NEEDED + yylsp--; +#endif + +#if YYDEBUG != 0 + if (yydebug) + { + short *ssp1 = yyss - 1; + fprintf (stderr, "Error: state stack now"); + while (ssp1 != yyssp) + fprintf (stderr, " %d", *++ssp1); + fprintf (stderr, "\n"); + } +#endif + +yyerrhandle: + + yyn = yypact[yystate]; + if (yyn == YYFLAG) + goto yyerrdefault; + + yyn += YYTERROR; + if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) + goto yyerrdefault; + + yyn = yytable[yyn]; + if (yyn < 0) + { + if (yyn == YYFLAG) + goto yyerrpop; + yyn = -yyn; + goto yyreduce; + } + else if (yyn == 0) + goto yyerrpop; + + if (yyn == YYFINAL) + YYACCEPT; + +#if YYDEBUG != 0 + if (yydebug) + fprintf(stderr, "Shifting error token, "); +#endif + + *++yyvsp = yylval; +#ifdef YYLSP_NEEDED + *++yylsp = yylloc; +#endif + + yystate = yyn; + goto yynewstate; +} +#line 51 "syntax.y" diff --git a/ghc/utils/ugen/syntax.tab.h b/ghc/utils/ugen/syntax.tab.h new file mode 100644 index 0000000..f7ab221 --- /dev/null +++ b/ghc/utils/ugen/syntax.tab.h @@ -0,0 +1,13 @@ +#ifndef YYSTYPE +#define YYSTYPE int +#endif +#define ID 258 +#define TYPE 259 +#define SEMICOL 260 +#define COLON 261 +#define END 262 +#define STDEF 263 +#define ENDDEF 264 + + +extern YYSTYPE yylval; diff --git a/ghc/utils/ugen/tree.c b/ghc/utils/ugen/tree.c new file mode 100644 index 0000000..f3b3c15 --- /dev/null +++ b/ghc/utils/ugen/tree.c @@ -0,0 +1,205 @@ +#include "id.h" +#include "tree.h" + +extern char *malloc(); + +struct Stypdef { + Ttree tag; + id Xgtid; + tree Xgtdeflist; +}; + +struct Sdeflist { + Ttree tag; + tree Xgdeflist; + tree Xgdef; +}; + +struct Sdef { + Ttree tag; + id Xgdid; + tree Xgditemlist; +}; + +struct Sitemlist { + Ttree tag; + tree Xgitemlist; + tree Xgitem; +}; + +struct Semitemlist { + Ttree tag; +}; + +struct Sitem { + Ttree tag; + id Xgitemfunid; + id Xgitemtypid; +}; + +Ttree ttree(t) + tree t; +{ + return(t -> tag); +} + + +/************** typdef ******************/ + +tree mktypdef(PPgtid, PPgtdeflist) + id PPgtid; + tree PPgtdeflist; +{ + register struct Stypdef *pp = + (struct Stypdef *) malloc(sizeof(struct Stypdef)); + pp -> tag = typdef; + pp -> Xgtid = PPgtid; + pp -> Xgtdeflist = PPgtdeflist; + return((tree)pp); +} + +id *Rgtid(t) + struct Stypdef *t; +{ + if(t -> tag != typdef) + printf("gtid: illegal selection; was %d\n", t -> tag); + return(& t -> Xgtid); +} + +tree *Rgtdeflist(t) + struct Stypdef *t; +{ + if(t -> tag != typdef) + printf("gtdeflist: illegal selection; was %d\n", t -> tag); + return(& t -> Xgtdeflist); +} + +/************** deflist ******************/ + +tree mkdeflist(PPgdeflist, PPgdef) + tree PPgdeflist; + tree PPgdef; +{ + register struct Sdeflist *pp = + (struct Sdeflist *) malloc(sizeof(struct Sdeflist)); + pp -> tag = deflist; + pp -> Xgdeflist = PPgdeflist; + pp -> Xgdef = PPgdef; + return((tree)pp); +} + +tree *Rgdeflist(t) + struct Sdeflist *t; +{ + if(t -> tag != deflist) + printf("gdeflist: illegal selection; was %d\n", t -> tag); + return(& t -> Xgdeflist); +} + +tree *Rgdef(t) + struct Sdeflist *t; +{ + if(t -> tag != deflist) + printf("gdef: illegal selection; was %d\n", t -> tag); + return(& t -> Xgdef); +} + +/************** def ******************/ + +tree mkdef(PPgdid, PPgditemlist) + id PPgdid; + tree PPgditemlist; +{ + register struct Sdef *pp = + (struct Sdef *) malloc(sizeof(struct Sdef)); + pp -> tag = def; + pp -> Xgdid = PPgdid; + pp -> Xgditemlist = PPgditemlist; + return((tree)pp); +} + +id *Rgdid(t) + struct Sdef *t; +{ + if(t -> tag != def) + printf("gdid: illegal selection; was %d\n", t -> tag); + return(& t -> Xgdid); +} + +tree *Rgditemlist(t) + struct Sdef *t; +{ + if(t -> tag != def) + printf("gditemlist: illegal selection; was %d\n", t -> tag); + return(& t -> Xgditemlist); +} + +/************** itemlist ******************/ + +tree mkitemlist(PPgitemlist, PPgitem) + tree PPgitemlist; + tree PPgitem; +{ + register struct Sitemlist *pp = + (struct Sitemlist *) malloc(sizeof(struct Sitemlist)); + pp -> tag = itemlist; + pp -> Xgitemlist = PPgitemlist; + pp -> Xgitem = PPgitem; + return((tree)pp); +} + +tree *Rgitemlist(t) + struct Sitemlist *t; +{ + if(t -> tag != itemlist) + printf("gitemlist: illegal selection; was %d\n", t -> tag); + return(& t -> Xgitemlist); +} + +tree *Rgitem(t) + struct Sitemlist *t; +{ + if(t -> tag != itemlist) + printf("gitem: illegal selection; was %d\n", t -> tag); + return(& t -> Xgitem); +} + +/************** emitemlist ******************/ + +tree mkemitemlist() +{ + register struct Semitemlist *pp = + (struct Semitemlist *) malloc(sizeof(struct Semitemlist)); + pp -> tag = emitemlist; + return((tree)pp); +} + +/************** item ******************/ + +tree mkitem(PPgitemfunid, PPgitemtypid) + id PPgitemfunid; + id PPgitemtypid; +{ + register struct Sitem *pp = + (struct Sitem *) malloc(sizeof(struct Sitem)); + pp -> tag = item; + pp -> Xgitemfunid = PPgitemfunid; + pp -> Xgitemtypid = PPgitemtypid; + return((tree)pp); +} + +id *Rgitemfunid(t) + struct Sitem *t; +{ + if(t -> tag != item) + printf("gitemfunid: illegal selection; was %d\n", t -> tag); + return(& t -> Xgitemfunid); +} + +id *Rgitemtypid(t) + struct Sitem *t; +{ + if(t -> tag != item) + printf("gitemtypid: illegal selection; was %d\n", t -> tag); + return(& t -> Xgitemtypid); +} diff --git a/ghc/utils/ugen/tree.h b/ghc/utils/ugen/tree.h new file mode 100644 index 0000000..2a71f88 --- /dev/null +++ b/ghc/utils/ugen/tree.h @@ -0,0 +1,49 @@ +#ifndef tree_defined +#define tree_defined +typedef enum { + typdef, + deflist, + def, + itemlist, + emitemlist, + item +} Ttree; + +typedef struct { Ttree tag; } *tree; + +/* Compatibility defines */ +extern Ttree ttree(); + +#endif +extern tree mktypdef(); +extern id *Rgtid(); +#define gtid(xyzxyz) (*Rgtid(xyzxyz)) +extern tree *Rgtdeflist(); +#define gtdeflist(xyzxyz) (*Rgtdeflist(xyzxyz)) + +extern tree mkdeflist(); +extern tree *Rgdeflist(); +#define gdeflist(xyzxyz) (*Rgdeflist(xyzxyz)) +extern tree *Rgdef(); +#define gdef(xyzxyz) (*Rgdef(xyzxyz)) + +extern tree mkdef(); +extern id *Rgdid(); +#define gdid(xyzxyz) (*Rgdid(xyzxyz)) +extern tree *Rgditemlist(); +#define gditemlist(xyzxyz) (*Rgditemlist(xyzxyz)) + +extern tree mkitemlist(); +extern tree *Rgitemlist(); +#define gitemlist(xyzxyz) (*Rgitemlist(xyzxyz)) +extern tree *Rgitem(); +#define gitem(xyzxyz) (*Rgitem(xyzxyz)) + +extern tree mkemitemlist(); + +extern tree mkitem(); +extern id *Rgitemfunid(); +#define gitemfunid(xyzxyz) (*Rgitemfunid(xyzxyz)) +extern id *Rgitemtypid(); +#define gitemtypid(xyzxyz) (*Rgitemtypid(xyzxyz)) + -- 1.7.10.4