%{ /* * CDDL HEADER START * * The contents of this file are subject to the terms of the * Common Development and Distribution License, Version 1.0 only * (the "License"). You may not use this file except in compliance * with the License. * * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE * or http://www.opensolaris.org/os/licensing. * See the License for the specific language governing permissions * and limitations under the License. * * When distributing Covered Code, include this CDDL HEADER in each * file and include the License file at usr/src/OPENSOLARIS.LICENSE. * If applicable, add the following below this CDDL HEADER, with the * fields enclosed by brackets "[]" replaced with your own identifying * information: Portions Copyright [yyyy] [name of copyright owner] * * CDDL HEADER END */ %} /* * Copyright 2005 Sun Microsystems, Inc. * All rights reserved. * Use is subject to license terms. */ /* Copyright (c) 1988 AT&T */ /* All Rights Reserved */ %{ /* from OpenSolaris "parser.y 6.15 05/06/10 SMI" */ /* * Portions Copyright (c) 2005 Gunnar Ritter, Freiburg i. Br., Germany * * Sccsid @(#)parser.y 1.8 (gritter) 11/26/05 */ void yyerror(char *); #include #include #include #ifndef __sun #define wcsetno(c) 0 #endif %} /* parser.y */ /* XCU4: add XSCON: %x exclusive start token */ /* XCU4: add ARRAY: %a yytext is char array */ /* XCU4: add POINTER: %p yytext is a pointer to char */ %token CHAR CCL NCCL STR DELIM SCON ITER NEWE NULLS XSCON ARRAY POINTER %nonassoc ARRAY POINTER %left XSCON SCON NEWE %left '/' /* * XCU4: lower the precedence of $ and ^ to less than the or operator * per Spec. 1170 */ %left '$' '^' %left '|' %left CHAR CCL NCCL '(' '.' STR NULLS %left ITER %left CAT %left '*' '+' '?' %{ #include "ldefs.c" #define YYSTYPE union _yystype_ union _yystype_ { int i; CHR *cp; }; int peekon = 0; /* need this to check if "^" came in a definition section */ %} %% %{ int i; int j,k; int g; CHR *p; static wchar_t L_PctUpT[]= {'%', 'T', 0}; static wchar_t L_PctLoT[]= {'%', 't', 0}; static wchar_t L_PctCbr[]= {'%', '}', 0}; %} acc : lexinput ={ # ifdef DEBUG if(debug) sect2dump(); # endif } ; lexinput: defns delim prods end | defns delim end ={ if(!funcflag)phead2(); funcflag = TRUE; } | error ={ # ifdef DEBUG if(debug) { sect1dump(); sect2dump(); } # endif fatal = 0; n_error++; error("Illegal definition"); fatal = 1; } ; end: delim | ; defns: defns STR STR ={ scopy($2.cp,dp); def[dptr] = dp; dp += slength($2.cp) + 1; scopy($3.cp,dp); subs[dptr++] = dp; if(dptr >= DEFSIZE) error("Too many definitions"); dp += slength($3.cp) + 1; if(dp >= dchar+DEFCHAR) error("Definitions too long"); subs[dptr]=def[dptr]=0; /* for lookup - require ending null */ } | ; delim: DELIM ={ # ifdef DEBUG if(sect == DEFSECTION && debug) sect1dump(); # endif sect++; } ; prods: prods pr ={ $$.i = mn2(RNEWE,$1.i,$2.i); } | pr ={ $$.i = $1.i;} ; pr: r NEWE ={ if(divflg == TRUE) i = mn1(S1FINAL,casecount); else i = mn1(FINAL,casecount); $$.i = mn2(RCAT,$1.i,i); divflg = FALSE; if((++casecount)>NACTIONS) error("Too many (>%d) pattern-action rules.", NACTIONS); } | error NEWE ={ # ifdef DEBUG if(debug) sect2dump(); # endif fatal = 0; yyline--; n_error++; error("Illegal rule"); fatal = 1; yyline++; } r: CHAR ={ $$.i = mn0($1.i); } | STR ={ p = (CHR *)$1.cp; i = mn0((unsigned)(*p++)); while(*p) i = mn2(RSTR,i,(unsigned)(*p++)); $$.i = i; } | '.' ={ $$.i = mn0(DOT); } | CCL ={ $$.i = mn1(RCCL,(intptr_t)$1.cp); } | NCCL ={ $$.i = mn1(RNCCL,(intptr_t)$1.cp); } | r '*' ={ $$.i = mn1(STAR,$1.i); } | r '+' ={ $$.i = mn1(PLUS,$1.i); } | r '?' ={ $$.i = mn1(QUEST,$1.i); } | r '|' r ={ $$.i = mn2(BAR,$1.i,$3.i); } | r r %prec CAT ={ $$.i = mn2(RCAT,$1.i,$2.i); } | r '/' r ={ if(!divflg){ j = mn1(S2FINAL,-casecount); i = mn2(RCAT,$1.i,j); $$.i = mn2(DIV,i,$3.i); } else { $$.i = mn2(RCAT,$1.i,$3.i); error("illegal extra slash"); } divflg = TRUE; } | r ITER ',' ITER '}' ={ if($2.i > $4.i){ i = $2.i; $2.i = $4.i; $4.i = i; } if($4.i <= 0) error("iteration range must be positive"); else { j = $1.i; for(k = 2; k<=$2.i;k++) j = mn2(RCAT,j,dupl($1.i)); for(i = $2.i+1; i<=$4.i; i++){ g = dupl($1.i); for(k=2;k<=i;k++) g = mn2(RCAT,g,dupl($1.i)); j = mn2(BAR,j,g); } $$.i = j; } } | r ITER '}' ={ if($2.i < 0)error("can't have negative iteration"); else if($2.i == 0) $$.i = mn0(RNULLS); else { j = $1.i; for(k=2;k<=$2.i;k++) j = mn2(RCAT,j,dupl($1.i)); $$.i = j; } } | r ITER ',' '}' ={ /* from n to infinity */ if($2.i < 0)error("can't have negative iteration"); else if($2.i == 0) $$.i = mn1(STAR,$1.i); else if($2.i == 1)$$.i = mn1(PLUS,$1.i); else { /* >= 2 iterations minimum */ j = $1.i; for(k=2;k<$2.i;k++) j = mn2(RCAT,j,dupl($1.i)); k = mn1(PLUS,dupl($1.i)); $$.i = mn2(RCAT,j,k); } } | SCON r ={ $$.i = mn2(RSCON,$2.i,(intptr_t)$1.cp); } /* XCU4: add XSCON */ | XSCON r ={ $$.i = mn2(RXSCON,$2.i,(intptr_t)$1.cp); } | '^' r ={ $$.i = mn1(CARAT,$2.i); } | r '$' ={ i = mn0('\n'); if(!divflg){ j = mn1(S2FINAL,-casecount); k = mn2(RCAT,$1.i,j); $$.i = mn2(DIV,k,i); } else $$.i = mn2(RCAT,$1.i,i); divflg = TRUE; } | '(' r ')' ={ $$.i = $2.i; } | NULLS ={ $$.i = mn0(RNULLS); } /* XCU4: add ARRAY and POINTER */ | ARRAY ={ isArray = 1; }; | POINTER ={ isArray = 0; }; ; %% int yylex(void) { CHR *p; int i; CHR *xp; int lex_startcond_lookupval; CHR *t, c; int n, j = 0, k, x; CHR ch; static int sectbegin; static CHR token[TOKENSIZE]; static int iter; int ccs; /* Current CodeSet. */ CHR *ccp; int exclusive_flag; /* XCU4: exclusive start flag */ # ifdef DEBUG yylval.i = 0; # endif if(sect == DEFSECTION) { /* definitions section */ while(!eof) { if(prev == '\n'){ /* next char is at beginning of line */ getl(p=buf); switch(*p){ case '%': switch(c= *(p+1)){ case '%': if(scomp(p, (CHR *)"%%")) { p++; while(*(++p)) if(!space(*p)) { warning("invalid string following %%%% be ignored"); break; } } lgate(); if(!ratfor)fprintf(fout,"# "); fprintf(fout,"define YYNEWLINE %d\n",ctable['\n']); if(!ratfor) { fprintf(fout,"int yylex(){\nint nstr = 0; extern int yyprevious;\n"); } sectbegin = TRUE; i = treesize*(sizeof(*name)+sizeof(*left)+ sizeof(*right)+sizeof(*nullstr)+sizeof(*parent))+ALITTLEEXTRA; p = myalloc(i,1); if(p == NULL) error("Too little core for parse tree"); free(p); name = myalloc(treesize,sizeof(*name)); left = myalloc(treesize,sizeof(*left)); right = myalloc(treesize,sizeof(*right)); nullstr = myalloc(treesize,sizeof(*nullstr)); parent = myalloc(treesize,sizeof(*parent)); if(name == 0 || left == 0 || right == 0 || parent == 0 || nullstr == 0) error("Too little core for parse tree"); return(freturn(DELIM)); case 'p': case 'P': /* %p or %pointer */ if ((*(p+2) == 'o') || (*(p+2) == 'O')) { if(lgatflg) error("Too late for %%pointer"); while(*p && !iswspace(*p)) p++; isArray = 0; continue; } /* has overridden number of positions */ p += 2; maxpos = siconv(p); if (maxpos<=0)error("illegal position number"); # ifdef DEBUG if (debug) printf("positions (%%p) now %d\n",maxpos); # endif if(report == 2)report = 1; continue; case 'n': case 'N': /* has overridden number of states */ p += 2; nstates = siconv(p); if(nstates<=0)error("illegal state number"); # ifdef DEBUG if(debug)printf( " no. states (%%n) now %d\n",nstates); # endif if(report == 2)report = 1; continue; case 'e': case 'E': /* has overridden number of tree nodes */ p += 2; treesize = siconv(p); if(treesize<=0)error("illegal number of parse tree nodes"); # ifdef DEBUG if (debug) printf("treesize (%%e) now %d\n",treesize); # endif if(report == 2)report = 1; continue; case 'o': case 'O': p += 2; outsize = siconv(p); if(outsize<=0)error("illegal size of output array"); if (report ==2) report=1; continue; case 'a': case 'A': /* %a or %array */ if ((*(p+2) == 'r') || (*(p+2) == 'R')) { if(lgatflg) error("Too late for %%array"); while(*p && !iswspace(*p)) p++; isArray = 1; continue; } /* has overridden number of transitions */ p += 2; ntrans = siconv(p); if(ntrans<=0)error("illegal translation number"); # ifdef DEBUG if (debug)printf("N. trans (%%a) now %d\n",ntrans); # endif if(report == 2)report = 1; continue; case 'k': case 'K': /* overriden packed char classes */ p += 2; free(pchar); pchlen = siconv(p); if(pchlen<=0)error("illegal number of packed character class"); # ifdef DEBUG if (debug) printf( "Size classes (%%k) now %d\n",pchlen); # endif pchar=pcptr=myalloc(pchlen, sizeof(*pchar)); if (report==2) report=1; continue; case 't': case 'T': /* character set specifier */ if(handleeuc) error("\ Character table (%t) is supported only in ASCII compatibility mode.\n"); ZCH = wcstol(p+2, NULL, 10); if (ZCH < NCH) ZCH = NCH; if (ZCH > 2*NCH) error("ch table needs redeclaration"); chset = TRUE; for(i = 0; i ZCH){ error("Character value %d out of range",n); continue; } while(digit(*p)) p++; if(!iswspace(*p)) error("bad translation format"); while(iswspace(*p)) p++; t = p; while(*t){ c = ctrans(&t); if(ctable[(unsigned)c]){ if (iswprint(c)) warning("Character '%lc' used twice",c); else error("Chararter %o used twice",c); } else ctable[(unsigned)c] = n; t++; } p = buf; } { char chused[2*NCH]; int kr; for(i=0; i= STARTSIZE) error("Too many start conditions"); sp += slength(sp) + 1; if(sp >= schar+STARTCHAR) error("Start conditions too long"); } continue; default: error("Invalid request %s",p); continue; } /* end of switch after seeing '%' */ break; case ' ': case '\t': /* must be code */ lgate(); if( p[1]=='/' && p[2]=='*' ) cpycom(p); else fprintf(fout, "%ls\n",p); continue; case '/': /* look for comments */ lgate(); if((*(p+1))=='*') cpycom(p); /* FALLTHRU */ default: /* definition */ while(*p && !iswspace(*p)) p++; if(*p == 0) continue; prev = *p; *p = 0; bptr = p+1; yylval.cp = (CHR *)buf; if(digit(buf[0])) warning("Substitution strings may not begin with digits"); return(freturn(STR)); } } else { /* still sect 1, but prev != '\n' */ p = bptr; while(*p && iswspace(*p)) p++; if(*p == 0) warning("No translation given - null string assumed"); scopy(p,token); yylval.cp = (CHR *)token; prev = '\n'; return(freturn(STR)); } } error("unexpected EOF before %%%%"); /* end of section one processing */ } else if(sect == RULESECTION){ /* rules and actions */ lgate(); while(!eof){ static int first_test=TRUE, first_value; static int reverse=FALSE; switch(c=gch()){ case '\0': if(n_error)error_tail(); return(freturn(0)); case '\n': if(prev == '\n') continue; x = NEWE; break; case ' ': case '\t': if(prev == '\n') copy_line = TRUE; if(sectbegin == TRUE){ cpyact(); copy_line = FALSE; while((c=gch()) && c != '\n'); continue; } if(!funcflag)phead2(); funcflag = TRUE; if(ratfor)fprintf(fout,"%d\n",30000+casecount); else fprintf(fout,"case %d:\n",casecount); if(cpyact()){ if(ratfor)fprintf(fout,"goto 30997\n"); else fprintf(fout,"break;\n"); } while((c=gch()) && c != '\n') { if (c=='/') { if((c=gch())=='*') { c=gch(); while(c !=EOF) { while (c=='*') if ((c=gch()) == '/') goto w_loop; c = gch(); } error("EOF inside comment"); } else warning("undefined string"); } else if (c=='}') error("illegal extra \"}\""); w_loop: ; } /* while ((c=gch())== ' ' || c == '\t') ; */ /* if (!space(c)) error("undefined action string"); */ if(peek == ' ' || peek == '\t' || sectbegin == TRUE){ fatal = 0; n_error++; error("executable statements should occur right after %%%%"); fatal = 1; continue; } x = NEWE; break; case '%': if(prev != '\n') goto character; if(peek == '{'){ /* included code */ getl(buf); while(!eof&& getl(buf) && scomp(L_PctCbr,buf)!=0) if(buf[0]=='/' && buf[1]=='*') cpycom(buf); else fprintf(fout,"%ls\n",buf); continue; } if(peek == '%'){ c = gch(); c = gch(); x = DELIM; break; } goto character; case '|': if(peek == ' ' || peek == '\t' || peek == '\n'){ if(ratfor)fprintf(fout,"%d\n",30000+casecount++); else fprintf(fout,"case %d:\n",casecount++); continue; } x = '|'; break; case '$': if(peek == '\n' || peek == ' ' || peek == '\t' || peek == '|' || peek == '/'){ x = c; break; } goto character; case '^': if(peekon && (prev == '}')){ x = c; break; } if(prev != '\n' && scon != TRUE) goto character; /* valid only at line begin */ x = c; break; case '?': case '+': case '*': if(prev == '\n' ) { fatal = 0; n_error++; error("illegal operator -- %c",c); fatal = 1; } /* FALLTHRU */ case '.': case '(': case ')': case ',': case '/': x = c; break; case '}': iter = FALSE; x = c; break; case '{': /* either iteration or definition */ if(digit(c=gch())){ /* iteration */ iter = TRUE; if(prev=='{') first_test = TRUE; ieval: i = 0; while(digit(c)){ token[i++] = c; c = gch(); } token[i] = 0; yylval.i = siconv(token); if(first_test) { first_test = FALSE; first_value = yylval.i; } else if(first_value>yylval.i)warning("the values between braces are reversed"); ch = c; munput('c',&ch); x = ITER; break; } else { /* definition */ i = 0; while(c && c!='}'){ token[i++] = c; if(i >= TOKENSIZE) error("definition too long"); c = gch(); } token[i] = 0; i = lookup(token,def); if(i < 0) error("definition %ls not found",token); else munput('s',(CHR *)(subs[i])); if (peek == '^') peekon = 1; continue; } case '<': /* start condition ? */ if(prev != '\n') /* not at line begin, not start */ goto character; t = slptr; do { i = 0; if(!isascii(c = gch())) error("Non-ASCII characters in start condition."); while(c != ',' && c && c != '>'){ token[i++] = c; if(i >= TOKENSIZE) error("string name too long"); if(!isascii(c = gch())) error("None-ASCII characters in start condition."); } token[i] = 0; if(i == 0) goto character; i = lookup(token,sname); lex_startcond_lookupval = i; if(i < 0) { fatal = 0; n_error++; error("undefined start condition %ls",token); fatal = 1; continue; } *slptr++ = i+1; } while(c && c != '>'); *slptr++ = 0; /* check if previous value re-usable */ for (xp=slist; xp slist+STARTSIZE) /* note not packed */ error("Too many start conditions used"); yylval.cp = (CHR *)t; /* XCU4: add XSCON */ if (exclusive[lex_startcond_lookupval]) x = XSCON; else x = SCON; break; case '"': i = 0; while((c=gch()) && c != '"' && c != '\n'){ if(c == '\\') c = usescape(c=gch()); remch(c); token[i++] = c; if(i >= TOKENSIZE){ warning("String too long"); i = TOKENSIZE-1; break; } } if(c == '\n') { yyline--; warning("Non-terminated string"); yyline++; } token[i] = 0; if(i == 0)x = NULLS; else if(i == 1){ yylval.i = (unsigned)token[0]; x = CHAR; } else { yylval.cp = (CHR *)token; x = STR; } break; case '[': reverse = FALSE; x = CCL; if((c = gch()) == '^'){ x = NCCL; reverse = TRUE; c = gch(); } i = 0; while(c != ']' && c){ static int light=TRUE, ESCAPE=FALSE; if(c == '-' && prev == '^' && reverse){ symbol[(unsigned)c] = 1; c = gch(); continue; } if(c == '\\') { c = usescape(c=gch()); ESCAPE = TRUE; } if(c=='-' && !ESCAPE && prev!='[' && peek!=']'){ /* range specified */ if (light) { c = gch(); if(c == '\\') c=usescape(c=gch()); remch(c); k = c; ccs=wcsetno(k); if(wcsetno(j)!=ccs) error("\ Character range specified between different codesets."); if((unsigned)j > (unsigned)k) { n = j; j = k; k = n; } if(!handleeuc) if(!(('A'<=j && k<='Z') || ('a'<=j && k<='z') || ('0'<=j && k<='9'))) warning("Non-portable Character Class"); token[i++] = RANGE; token[i++] = j; token[i++] = k; light = FALSE; } else { error("unmatched hyphen"); if(symbol[(unsigned)c])warning("\"%c\" redefined inside brackets",c); else symbol[(unsigned)c] = 1; } ESCAPE = FALSE; } else { j = c; remch(c); token[i++] = c; /* Remember whatever.*/ light = TRUE; ESCAPE = FALSE; } c = gch(); } /* try to pack ccl's */ token[i] = 0; ccp = ccl; while (ccp < ccptr && scomp(token, ccp) != 0) ccp++; if (ccp < ccptr) { /* found in ccl */ yylval.cp = ccp; } else { /* not in ccl, add it */ scopy(token,ccptr); yylval.cp = ccptr; ccptr += slength(token) + 1; if(ccptr >= ccl+CCLSIZE) error("Too many large character classes"); } break; case '\\': c = usescape(c=gch()); default: character: if(iter){ /* second part of an iteration */ iter = FALSE; if('0' <= c && c <= '9') goto ieval; } remch(c); if(alpha(peek)){ i = 0; yylval.cp = (CHR *)token; token[i++] = c; while(alpha(peek)) { remch(token[i++] = gch()); if(i >= TOKENSIZE) { warning("string too long"); i = TOKENSIZE - 1; break; } } if(peek == '?' || peek == '*' || peek == '+') munput('c',&token[--i]); token[i] = 0; if(i == 1){ yylval.i = (unsigned)(token[0]); x = CHAR; } else x = STR; } else { yylval.i = (unsigned)c; x = CHAR; } } scon = FALSE; peekon = 0; if((x == SCON) || (x == XSCON)) scon = TRUE; sectbegin = FALSE; return(freturn(x)); /* NOTREACHED */ } } /* section three */ lgate(); ptail(); # ifdef DEBUG if(debug) fprintf(fout,"\n/*this comes from section three - debug */\n"); # endif if(getl(buf) && !eof) { if (sargv[optind] == NULL) fprintf(fout, "\n# line %d\n", yyline-1); else fprintf(fout, "\n# line %d \"%s\"\n", yyline-1, sargv[optind]); fprintf(fout,"%ls\n",buf); while(getl(buf) && !eof) fprintf(fout,"%ls\n",buf); } return(freturn(0)); } /* end of yylex */ # ifdef DEBUG freturn(i) int i; { if(yydebug) { printf("now return "); if((unsigned)i < NCH) allprint(i); else printf("%d",i); printf(" yylval = "); switch(i){ case STR: case CCL: case NCCL: strpt(yylval.cp); break; case CHAR: allprint(yylval.i); break; default: printf("%d",yylval.i); break; } putchar('\n'); } return(i); } # endif