2 * A n t l r T r a n s l a t i o n H e a d e r
4 * Terence Parr, Will Cohen, and Hank Dietz: 1989-1994
5 * Purdue University Electrical Engineering
6 * With AHPCRC, University of Minnesota
10 #define ANTLR_VERSION 132
27 int action_no = 0; /* keep track of actions outputed */
28 int nfa_allocated = 0; /* keeps track of number of nfa nodes */
29 nfa_node **nfa_array = NULL;/* root of binary tree that stores nfa array */
30 nfa_node nfa_model_node; /* model to initialize new nodes */
31 set used_chars; /* used to label trans. arcs */
32 set used_classes; /* classes or chars used to label trans. arcs */
33 set normal_chars; /* mask to get rid elements that aren't used
35 int flag_paren = FALSE;
36 int flag_brace = FALSE;
37 int mode_counter = 0; /* keep track of number of %%names */
52 p_head(); p_class_hdr(); func_action = FALSE;
57 while ( (LA(1)==ACTION) ) {
58 zzmatch(ACTION); zzCONSUME;
64 if ( gen_cpp ) p_includes();
66 func_action = FALSE; p_tables(); p_tail();
71 while ( (LA(1)==ACTION) ) {
72 zzmatch(ACTION); zzCONSUME;
78 zzmatch(1); zzCONSUME;
83 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
84 zzresynch(setwd1, 0x1);
103 if ( (LA(1)==PER_PER) ) {
104 zzmatch(PER_PER); zzCONSUME;
108 if ( (LA(1)==NAME_PER_PER) ) {
109 zzmatch(NAME_PER_PER); zzCONSUME;
115 while ( (LA(1)==NAME_PER_PER) ) {
116 zzmatch(NAME_PER_PER); zzCONSUME;
124 else {zzFAIL(1,zzerr1,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}
129 zzmatch(PER_PER); zzCONSUME;
134 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
135 zzresynch(setwd1, 0x2);
150 new_automaton_mode(); func_action = TRUE;
153 dfa_class_nop[mode_counter] =
154 relabel(zzaArg(zztasp1,1 ).l,comp_level);
156 p_shift_table(mode_counter);
157 dfa_basep[mode_counter] = dfa_allocated+1;
158 make_dfa_model_node(dfa_class_nop[mode_counter]);
159 nfa_to_dfa(zzaArg(zztasp1,1 ).l);
163 fprint_hash_stats(stderr);
169 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
170 zzresynch(setwd1, 0x4);
185 if ( (setwd1[LA(1)]&0x8) ) {
187 zzaRet.l=zzaArg(zztasp1,1 ).l; zzaRet.r=zzaArg(zztasp1,1 ).r;
192 while ( (setwd1[LA(1)]&0x10) ) {
196 (t1)->trans[0]=zzaRet.l;
197 (t1)->trans[1]=zzaArg(zztasp2,1 ).l;
198 /* all accept nodes "dead ends" */
199 zzaRet.l=t1; zzaRet.r=NULL;
208 if ( (setwd1[LA(1)]&0x20) ) {
209 zzaRet.l = new_nfa_node(); zzaRet.r = NULL;
210 warning("no regular expressions", zzline);
212 else {zzFAIL(1,zzerr2,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}
218 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
219 zzresynch(setwd1, 0x40);
234 if ( (setwd1[LA(1)]&0x80) ) {
237 zzaRet.l=zzaArg(zztasp1,1 ).l; zzaRet.r=zzaArg(zztasp1,1 ).r; (zzaArg(zztasp1,1 ).r)->accept=action_no;
242 if ( (LA(1)==ACTION) ) {
244 zzaRet.l = NULL; zzaRet.r = NULL;
245 error("no expression for action ", zzline);
249 else {zzFAIL(1,zzerr3,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}
255 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
256 zzresynch(setwd2, 0x1);
272 zzaRet.l=zzaArg(zztasp1,1 ).l; zzaRet.r=zzaArg(zztasp1,1 ).r;
277 while ( (LA(1)==OR) ) {
278 zzmatch(OR); zzCONSUME;
281 t1 = new_nfa_node(); t2 = new_nfa_node();
282 (t1)->trans[0]=zzaRet.l;
283 (t1)->trans[1]=zzaArg(zztasp2,2 ).l;
284 (zzaRet.r)->trans[1]=t2;
285 (zzaArg(zztasp2,2 ).r)->trans[1]=t2;
286 zzaRet.l=t1; zzaRet.r=t2;
297 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
298 zzresynch(setwd2, 0x2);
314 zzaRet.l=zzaArg(zztasp1,1 ).l; zzaRet.r=zzaArg(zztasp1,1 ).r;
319 while ( (setwd2[LA(1)]&0x4) ) {
321 (zzaRet.r)->trans[1]=zzaArg(zztasp2,1 ).l; zzaRet.r=zzaArg(zztasp2,1 ).r;
331 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
332 zzresynch(setwd2, 0x8);
347 if ( (setwd2[LA(1)]&0x10) ) {
349 zzaRet.l=zzaArg(zztasp1,1 ).l; zzaRet.r=zzaArg(zztasp1,1 ).r;
354 if ( (LA(1)==ZERO_MORE) ) {
357 (zzaRet.r)->trans[0] = zzaRet.l;
358 t1 = new_nfa_node(); t2 = new_nfa_node();
359 t1->trans[0]=zzaRet.l;
361 (zzaRet.r)->trans[1]=t2;
362 zzaRet.l=t1;zzaRet.r=t2;
368 if ( (LA(1)==ONE_MORE) ) {
370 (zzaRet.r)->trans[0] = zzaRet.l;
380 if ( (LA(1)==ZERO_MORE) ) {
382 error("no expression for *", zzline);
387 if ( (LA(1)==ONE_MORE) ) {
389 error("no expression for +", zzline);
393 else {zzFAIL(1,zzerr4,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}
400 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
401 zzresynch(setwd2, 0x20);
416 zzaRet.l = new_nfa_node(); zzaRet.r = new_nfa_node();
417 if ( (LA(1)==L_BRACK) ) {
418 zzmatch(L_BRACK); zzCONSUME;
422 (zzaRet.l)->trans[0] = zzaRet.r;
423 (zzaRet.l)->label = set_dup(zzaArg(zztasp1,2 ).label);
424 set_orin(&used_chars,(zzaRet.l)->label);
429 if ( (LA(1)==NOT) ) {
430 zzmatch(NOT); zzCONSUME;
431 zzmatch(L_BRACK); zzCONSUME;
435 (zzaRet.l)->trans[0] = zzaRet.r;
436 (zzaRet.l)->label = set_dif(normal_chars,zzaArg(zztasp1,3 ).label);
437 set_orin(&used_chars,(zzaRet.l)->label);
442 if ( (LA(1)==L_PAR) ) {
443 zzmatch(L_PAR); zzCONSUME;
447 (zzaRet.l)->trans[0] = zzaArg(zztasp1,2 ).l;
448 (zzaArg(zztasp1,2 ).r)->trans[1] = zzaRet.r;
453 if ( (LA(1)==L_BRACE) ) {
454 zzmatch(L_BRACE); zzCONSUME;
458 (zzaRet.l)->trans[0] = zzaArg(zztasp1,2 ).l;
459 (zzaRet.l)->trans[1] = zzaRet.r;
460 (zzaArg(zztasp1,2 ).r)->trans[1] = zzaRet.r;
465 if ( (setwd2[LA(1)]&0x40) ) {
468 (zzaRet.l)->trans[0] = zzaRet.r;
469 (zzaRet.l)->label = set_dup(zzaArg(zztasp1,1 ).label);
470 set_orin(&used_chars,(zzaRet.l)->label);
472 else {zzFAIL(1,zzerr5,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}
481 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
482 zzresynch(setwd2, 0x80);
497 set_free(zzaRet.label);
502 while ( (setwd3[LA(1)]&0x1) ) {
504 set_orin(&(zzaRet.label),zzaArg(zztasp2,1 ).label);
514 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
515 zzresynch(setwd3, 0x2);
531 register int i_prime;
533 zzaRet.letter=zzaArg(zztasp1,1 ).letter; zzaRet.label=set_of(zzaArg(zztasp1,1 ).letter);
534 i_prime = zzaArg(zztasp1,1 ).letter + MIN_CHAR;
535 if (case_insensitive && islower(i_prime))
536 set_orel(toupper(i_prime)-MIN_CHAR,
538 if (case_insensitive && isupper(i_prime))
539 set_orel(tolower(i_prime)-MIN_CHAR,
545 if ( (LA(1)==RANGE) ) {
546 zzmatch(RANGE); zzCONSUME;
548 if (case_insensitive){
549 i_prime = zzaRet.letter+MIN_CHAR;
550 zzaRet.letter = (islower(i_prime) ?
551 toupper(i_prime) : i_prime)-MIN_CHAR;
552 i_prime = zzaArg(zztasp2,2 ).letter+MIN_CHAR;
553 zzaArg(zztasp2,2 ).letter = (islower(i_prime) ?
554 toupper(i_prime) : i_prime)-MIN_CHAR;
556 /* check to see if range okay */
557 if (zzaRet.letter > zzaArg(zztasp2,2 ).letter){
558 error("invalid range ", zzline);
560 for (i=zzaRet.letter; i<= (int)zzaArg(zztasp2,2 ).letter; ++i){
561 set_orel(i,&(zzaRet.label));
562 i_prime = i+MIN_CHAR;
563 if (case_insensitive && islower(i_prime))
564 set_orel(toupper(i_prime)-MIN_CHAR,
566 if (case_insensitive && isupper(i_prime))
567 set_orel(tolower(i_prime)-MIN_CHAR,
578 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
579 zzresynch(setwd3, 0x4);
594 register int i_prime;
596 zzaRet.label = set_of(zzaArg(zztasp1,1 ).letter);
597 i_prime = zzaArg(zztasp1,1 ).letter + MIN_CHAR;
598 if (case_insensitive && islower(i_prime))
599 set_orel(toupper(i_prime)-MIN_CHAR,
601 if (case_insensitive && isupper(i_prime))
602 set_orel(tolower(i_prime)-MIN_CHAR,
608 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
609 zzresynch(setwd3, 0x8);
624 if ( (LA(1)==REGCHAR) ) {
626 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
631 if ( (LA(1)==OCTAL_VALUE) ) {
632 zzmatch(OCTAL_VALUE);
633 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
638 if ( (LA(1)==HEX_VALUE) ) {
640 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
645 if ( (LA(1)==DEC_VALUE) ) {
647 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
652 if ( (LA(1)==TAB) ) {
654 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
661 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
668 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
675 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
680 if ( (LA(1)==LIT) ) {
682 zzaRet.letter = zzaArg(zztasp1,1 ).letter - MIN_CHAR;
687 if ( (LA(1)==L_EOF) ) {
693 else {zzFAIL(1,zzerr6,&zzMissSet,&zzMissText,&zzBadTok,&zzBadText,&zzErrk); goto fail;}
708 zzsyn(zzMissText, zzBadTok, (ANTLRChar *)"", zzMissSet, zzMissTok, zzErrk, zzBadText);
709 zzresynch(setwd3, 0x10);
713 /* adds a new nfa to the binary tree and returns a pointer to it */
714 nfa_node *new_nfa_node()
716 register nfa_node *t;
717 static int nfa_size=0; /* elements nfa_array[] can hold */
720 if (nfa_size<=nfa_allocated){
721 /* need to redo array */
723 /* need some to do inital allocation */
724 nfa_size=nfa_allocated+NFA_MIN;
725 nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)*
728 /* need more space */
729 nfa_size=2*(nfa_allocated+1);
730 nfa_array=(nfa_node **) realloc(nfa_array,
731 sizeof(nfa_node*)*nfa_size);
734 /* fill out entry in array */
735 t = (nfa_node*) malloc(sizeof(nfa_node));
736 nfa_array[nfa_allocated] = t;
738 t->node_no = nfa_allocated;
743 /* initialize the model node used to fill in newly made nfa_nodes */
745 make_nfa_model_node()
747 nfa_model_node.node_no = -1; /* impossible value for real nfa node */
748 nfa_model_node.nfa_set = 0;
749 nfa_model_node.accept = 0; /* error state default*/
750 nfa_model_node.trans[0] = NULL;
751 nfa_model_node.trans[1] = NULL;
752 nfa_model_node.label = empty;
757 /* print out the pointer value and the node_number */
758 fprint_dfa_pair(f, p)
763 fprintf(f, "%x (%d)", p, p->node_no);
769 /* print out interest information on a set */
776 fprintf(f, "n = %d,", s.n);
778 fprintf(f, "setword = %x, ", s.setword);
779 /* print out all the elements in the set */
782 fprintf(f, "%d ", *x);
786 fprintf(f, "setword = (nil)");
790 /* code to be able to dump out the nfas
791 return 0 if okay dump
792 return 1 if screwed up
794 int dump_nfas(first_node, last_node)
801 for (i=first_node; i<=last_node; ++i){
804 fprintf(stderr, "nfa_node %d {\n", t->node_no);
805 fprintf(stderr, "\n\tnfa_set = %d\n", t->nfa_set);
806 fprintf(stderr, "\taccept\t=\t%d\n", t->accept);
807 fprintf(stderr, "\ttrans\t=\t(");
808 fprint_dfa_pair(stderr, t->trans[0]);
809 fprintf(stderr, ",");
810 fprint_dfa_pair(stderr, t->trans[1]);
811 fprintf(stderr, ")\n");
812 fprintf(stderr, "\tlabel\t=\t{ ");
813 fprint_set(stderr, t->label);
814 fprintf(stderr, "\t}\n");
815 fprintf(stderr, "}\n\n");
821 /* DLG-specific syntax error message generator
822 * (define USER_ZZSYN when compiling so don't get 2 definitions)
826 zzsyn(char *text, int tok, char *egroup, SetWordType *eset, int etok, int k, char *bad_text)
828 zzsyn(text, tok, egroup, eset, etok, k, bad_text)
829 char *text, *egroup, *bad_text;
836 fprintf(stderr, ErrHdr, file_str[0]!=NULL?file_str[0]:"stdin", zzline);
837 fprintf(stderr, " syntax error at \"%s\"", (tok==zzEOF_TOKEN)?"EOF":text);
838 if ( !etok && !eset ) {fprintf(stderr, "\n"); return;}
839 if ( k==1 ) fprintf(stderr, " missing");
842 fprintf(stderr, "; \"%s\" not", bad_text);
843 if ( zzset_deg(eset)>1 ) fprintf(stderr, " in");
845 if ( zzset_deg(eset)>0 ) zzedecode(eset);
846 else fprintf(stderr, " %s", zztokens[etok]);
847 if ( strlen(egroup) > (size_t)0 ) fprintf(stderr, " in %s", egroup);
848 fprintf(stderr, "\n");