]> git.proxmox.com Git - mirror_edk2.git/blame - BaseTools/Source/C/VfrCompile/Pccts/dlg/dlg_p.g
projects / mirror_edk2.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
BaseTools: Various typo
[mirror_edk2.git] / BaseTools / Source / C / VfrCompile / Pccts / dlg / dlg_p.g
CommitLineData
30fdf114
LG		 1/* This is the parser for the dlg\r
2 * This is a part of the Purdue Compiler Construction Tool Set\r
3 *\r
4 * SOFTWARE RIGHTS\r
5 *\r
6 * We reserve no LEGAL rights to the Purdue Compiler Construction Tool\r
7 * Set (PCCTS) -- PCCTS is in the public domain. An individual or\r
8 * company may do whatever they wish with source code distributed with\r
9 * PCCTS or the code generated by PCCTS, including the incorporation of\r
10 * PCCTS, or its output, into commerical software.\r
11 *\r
12 * We encourage users to develop software with PCCTS. However, we do ask\r
13 * that credit is given to us for developing PCCTS. By "credit",\r
14 * we mean that if you incorporate our source code into one of your\r
15 * programs (commercial product, research project, or otherwise) that you\r
16 * acknowledge this fact somewhere in the documentation, research report,\r
17 * etc... If you like PCCTS and have developed a nice tool with the\r
18 * output, please mention that you developed it using PCCTS. In\r
19 * addition, we ask that this header remain intact in our source code.\r
20 * As long as these guidelines are kept, we expect to continue enhancing\r
21 * this system and expect to make other tools available as they are\r
22 * completed.\r
23 *\r
24 * DLG 1.33\r
25 * Will Cohen\r
26 * With mods by Terence Parr; AHPCRC, University of Minnesota\r
27 * 1989-1995\r
28 */\r
29\r
30#header <<\r
31#include <ctype.h>\r
32#include "dlg.h"\r
33>>\r
34\r
35<<\r
36\r
37/* MR20 G. Hobbelt \r
38 Fix for Borland C++ 4.x & 5.x compiling with ALL warnings enabled\r
39*/\r
40\r
41#ifdef __TURBOC__\r
42#pragma warn -aus /* unused assignment of 'xxx' */\r
43#endif\r
44\r
4e97974c 45#pragma clang diagnostic ignored "-Wparentheses-equality"\r
46\r
47int action_no = 0; /* keep track of actions outputted */\r
30fdf114
LG		 48int nfa_allocated = 0; /* keeps track of number of nfa nodes */\r
49nfa_node **nfa_array = NULL;/* root of binary tree that stores nfa array */\r
50nfa_node nfa_model_node; /* model to initialize new nodes */\r
51set used_chars; /* used to label trans. arcs */\r
52set used_classes; /* classes or chars used to label trans. arcs */\r
53set normal_chars; /* mask to get rid elements that aren't used\r
54 in set */\r
55int flag_paren = FALSE;\r
56int flag_brace = FALSE;\r
57int mode_counter = 0; /* keep track of number of %%names */\r
58\r
59>>\r
60\r
61#lexaction <<\r
62int func_action; /* should actions be turned into functions?*/\r
63int lex_mode_counter = 0; /* keeps track of the number of %%names */\r
64/* MR1 */\r
65/* MR1 11-Apr-97 Provide mechanism for inserting code into DLG class */\r
66/* MR1 via <<%%lexmember...>> */\r
67/* MR1 */\r
68int lexMember = 0; /* <<%%lexmemeber ...>> MR1 */\r
69int lexAction = 0; /* <<%%lexaction ...>> MR1 */\r
70int parserClass = 0; /* <<%%parserclass ...>> MR1 */\r
71int lexPrefix = 0; /* <<%%lexprefix ...>> MR1 */\r
72char theClassName[100]; /* MR11 */\r
73char *pClassName=theClassName; /* MR11 */\r
74int firstLexMember=1; /* MR1 */\r
75\r
76#ifdef __USE_PROTOS\r
77void xxputc(int c) { /* MR1 */\r
78#else\r
79void xxputc(c) /* MR1 */\r
80 int c; /* MR1 */\r
81{ /* MR1 */\r
82#endif\r
83 if (parserClass) { /* MR1 */\r
84 *pClassName++=c; /* MR1 */\r
85 *pClassName=0; /* MR1 */\r
86 } else if (lexMember || lexPrefix) { /* MR1 */\r
87 if (class_stream != NULL) fputc(c,class_stream); /* MR1 */\r
88 } else { /* MR1 */\r
89 fputc(c,OUT); /* MR1 */\r
90 }; /* MR1 */\r
91} /* MR1 */\r
92\r
93#ifdef __USE_PROTOS\r
94void xxprintf(char *format,char *string) { /* MR1 */\r
95#else\r
96void xxprintf(format,string) /* MR1 */\r
97 char *format; /* MR1 */\r
98 char *string; /* MR1 */\r
99{ /* MR1 */\r
100#endif\r
101 if (lexMember || lexPrefix || parserClass) { /* MR1 */\r
102 if (class_stream != NULL) /* MR1 */\r
103 fprintf(class_stream,format,string); /* MR1 */\r
104 } else { /* MR1 */\r
105 fprintf(OUT,format,string); /* MR1 */\r
106 }; /* MR1 */\r
107} /* MR1 */\r
108>>\r
109\r
110#token "[\r\t\ ]+" << zzskip(); >> /* Ignore white */\r
111#token "\n" << zzline++; zzskip(); DAWDLE; >> /* Track Line # */\r
112#token L_EOF "\@"\r
113#token PER_PER "\%\%"\r
114#token NAME_PER_PER "\%\%[a-zA-Z_][a-zA-Z0-9_]*"\r
115 << p_mode_def(&zzlextext[2],lex_mode_counter++); >>\r
116\r
117#token LEXMEMBER "\<\<\%\%lexmember" /* MR1 */\r
118 <<lexMember=1; /* MR1 */\r
119 if (firstLexMember != 0) { /* MR1 */\r
120 firstLexMember=0; /* MR1 */\r
121 p_class_def1(); /* MR1 */\r
122 }; /* MR1 */\r
123 zzmode(ACT); /* MR1 */\r
124 >> /* MR1 */\r
125#token LEXACTION "\<\<\%\%lexaction" /* MR1 */\r
126 <<lexAction=1;zzmode(ACT);>> /* MR1 */\r
127#token PARSERCLASS "\<\<\%\%parserclass" /* MR1 */\r
128 <<parserClass=1; /* MR1 */\r
129 zzmode(ACT); /* MR1 */\r
130 >> /* MR1 */\r
131#token LEXPREFIX "\<\<\%\%lexprefix" /* MR1 */\r
132 <<lexPrefix=1;zzmode(ACT);>> /* MR1 */\r
133\r
134#token ACTION "\<\<"\r
135 << if (func_action)\r
136 fprintf(OUT,"\n%s %sact%d()\n{ ",\r
137 gen_cpp?"ANTLRTokenType":"static void",\r
138 gen_cpp?ClassName("::"):"", ++action_no);\r
139 zzmode(ACT); zzskip();\r
140 >>\r
141#token GREAT_GREAT "\>\>"\r
142#token L_BRACE "\{"\r
143#token R_BRACE "\}"\r
144#token L_PAR "\("\r
145#token R_PAR "\)"\r
146#token L_BRACK "\["\r
147#token R_BRACK "\]"\r
148#token ZERO_MORE "\*"\r
149#token ONE_MORE "\+"\r
150#token OR "\|"\r
151#token RANGE "\-"\r
152#token NOT "\~"\r
153#token OCTAL_VALUE "\\0[0-7]*" \r
154 << {int t; sscanf(&zzlextext[1],"%o",&t); zzlextext[0] = t;}>>\r
155#token HEX_VALUE "\\0[Xx][0-9a-fA-F]+"\r
156 << {int t; sscanf(&zzlextext[3],"%x",&t); zzlextext[0] = t;}>>\r
157#token DEC_VALUE "\\[1-9][0-9]*"\r
158 << {int t; sscanf(&zzlextext[1],"%d",&t); zzlextext[0] = t;}>>\r
159#token TAB "\\t" << zzlextext[0] = '\t';>>\r
160#token NL "\\n" << zzlextext[0] = '\n';>>\r
161#token CR "\\r" << zzlextext[0] = '\r';>>\r
162#token BS "\\b" << zzlextext[0] = '\b';>>\r
163\r
164/* MR1 */\r
165/* MR1 10-Apr-97 MR1 Allow #token regular expressions to cross lines */\r
166/* MR1 */\r
167#token CONTINUATION "\\ \n" << zzline++; zzskip();>> /* MR1 */\r
168\r
169/* NOTE: this takes ANYTHING after the \ */\r
170#token LIT "\\~[tnrb]" << zzlextext[0] = zzlextext[1];>>\r
171\r
172/* NOTE: this takes ANYTHING that doesn't match the other tokens */\r
173#token REGCHAR "~[\\]"\r
174\r
175\r
176grammar : << p_head(); p_class_hdr(); func_action = FALSE;>>\r
177 ( {LEXACTION | LEXMEMBER | LEXPREFIX | PARSERCLASS } ACTION)* /* MR1 */\r
178 <<if ( gen_cpp ) p_includes();>>\r
179 start_states\r
180 << func_action = FALSE; p_tables(); p_tail(); >>\r
181 (ACTION)* "@"\r
182 << if (firstLexMember != 0) p_class_def1(); >> /* MR1 */\r
183 ;\r
184\r
185start_states : ( PER_PER do_conversion\r
186 | NAME_PER_PER do_conversion (NAME_PER_PER do_conversion)*)\r
187 PER_PER\r
188 ;\r
189\r
190do_conversion : <<new_automaton_mode(); func_action = TRUE;>>\r
191 rule_list\r
192 <<\r
193 dfa_class_nop[mode_counter] =\r
194 relabel($1.l,comp_level);\r
195 if (comp_level)\r
196 p_shift_table(mode_counter);\r
197 dfa_basep[mode_counter] = dfa_allocated+1;\r
198 make_dfa_model_node(dfa_class_nop[mode_counter]);\r
199 nfa_to_dfa($1.l);\r
200 ++mode_counter;\r
201 func_action = FALSE;\r
202#ifdef HASH_STAT\r
203 fprint_hash_stats(stderr);\r
204#endif\r
205 >>\r
206 ;\r
207\r
208rule_list : rule <<$$.l=$1.l; $$.r=$1.r;>>\r
209 (rule\r
210 <<{nfa_node *t1;\r
211 t1 = new_nfa_node();\r
212 (t1)->trans[0]=$$.l;\r
213 (t1)->trans[1]=$1.l;\r
214 /* all accept nodes "dead ends" */\r
215 $$.l=t1; $$.r=NULL;\r
216 }\r
217 >>\r
218 )*\r
219 | /* empty */\r
220 <<$$.l = new_nfa_node(); $$.r = NULL;\r
221 warning("no regular expressions", zzline);\r
222 >>\r
223 ;\r
224\r
225rule : reg_expr ACTION\r
226/* MR23 */ << if ($1.r != NULL) {\r
227 $$.l=$1.l; $$.r=$1.r; ($1.r)->accept=action_no;\r
228 }\r
229 >>\r
230 | ACTION\r
231 <<$$.l = NULL; $$.r = NULL;\r
232 error("no expression for action ", zzline);\r
233 >>\r
234 ;\r
235\r
236reg_expr : and_expr <<$$.l=$1.l; $$.r=$1.r;>>\r
237 (OR and_expr\r
238 <<{nfa_node *t1, *t2;\r
239 t1 = new_nfa_node(); t2 = new_nfa_node();\r
240 (t1)->trans[0]=$$.l;\r
241 (t1)->trans[1]=$2.l;\r
242/* MR23 */ if ($$.r != NULL) ($$.r)->trans[1]=t2;\r
243 if ($2.r) {\r
244 ($2.r)->trans[1]=t2; /* MR20 */\r
245 }\r
246 $$.l=t1; $$.r=t2;\r
247 }\r
248 >>\r
249 )*\r
250 ;\r
251\r
252and_expr : repeat_expr\r
253 <<\r
254 $$.l=$1.l; $$.r=$1.r;\r
255 >>\r
256 (repeat_expr \r
257/* MR23 */ << if ($$.r != NULL) {\r
258 ($$.r)->trans[1]=$1.l;\r
259 $$.r=$1.r;\r
260 }\r
261 >>\r
262 )*\r
263 ;\r
264\r
265repeat_expr : expr <<$$.l=$1.l; $$.r=$1.r;>>\r
266 { ZERO_MORE\r
267 <<{ nfa_node *t1,*t2;\r
268/* MR23 */ if ($$.r != NULL) ($$.r)->trans[0] = $$.l;\r
269 t1 = new_nfa_node(); t2 = new_nfa_node();\r
270 t1->trans[0]=$$.l;\r
271 t1->trans[1]=t2;\r
272/* MR23 */ if ($$.r != NULL) ($$.r)->trans[1]=t2;\r
273 $$.l=t1;$$.r=t2;\r
274 }\r
275 >>\r
276 | ONE_MORE\r
277/* MR23 */ <<if ($$.r != NULL) ($$.r)->trans[0] = $$.l;>>\r
278 }\r
279 | ZERO_MORE\r
280 << error("no expression for *", zzline);>>\r
281 | ONE_MORE\r
282 << error("no expression for +", zzline);>>\r
283 ;\r
284\r
285expr : << $$.l = new_nfa_node();\r
286 $$.r = new_nfa_node();\r
287 >>\r
288 L_BRACK atom_list R_BRACK\r
289 <<\r
290/* MR23 */ if ($$.l != NULL) {\r
291 ($$.l)->trans[0] = $$.r;\r
292 ($$.l)->label = set_dup($2.label);\r
293 set_orin(&used_chars,($$.l)->label);\r
294 }\r
295 >>\r
296 | NOT L_BRACK atom_list R_BRACK\r
297 <<\r
298/* MR23 */ if ($$.l != NULL) {\r
299 ($$.l)->trans[0] = $$.r;\r
300 ($$.l)->label = set_dif(normal_chars,$3.label);\r
301 set_orin(&used_chars,($$.l)->label);\r
302 }\r
303 >>\r
304 | L_PAR reg_expr R_PAR\r
305 <<\r
306/* MR23 */ if ($$.l != NULL) { \r
307 ($$.l)->trans[0] = $2.l;\r
308 if ($2.r) {\r
309 ($2.r)->trans[1] = $$.r; /* MR20 */\r
310 }\r
311 }\r
312 >>\r
313 | L_BRACE reg_expr R_BRACE\r
314 <<\r
315/* MR23 */ if ($$.l != NULL) {\r
316 ($$.l)->trans[0] = $2.l;\r
317 ($$.l)->trans[1] = $$.r;\r
318 if ($2.r) {\r
319 ($2.r)->trans[1] = $$.r; /* MR20 */\r
320 }\r
321 }\r
322 >>\r
323 | atom\r
324 <<\r
325/* MR23 */ if ($$.l != NULL) {\r
326 ($$.l)->trans[0] = $$.r;\r
327 ($$.l)->label = set_dup($1.label);\r
328 set_orin(&used_chars,($$.l)->label);\r
329 }\r
330 >>\r
331 ;\r
332\r
333atom_list : << set_free($$.label); >>\r
334 (near_atom <<set_orin(&($$.label),$1.label);>>)*\r
335 ;\r
336\r
337near_atom : << register int i;\r
338 register int i_prime;\r
339 >>\r
340 anychar\r
341 <<$$.letter=$1.letter; $$.label=set_of($1.letter);\r
342 i_prime = $1.letter + MIN_CHAR;\r
343 if (case_insensitive && islower(i_prime))\r
344 set_orel(toupper(i_prime)-MIN_CHAR,\r
345 &($$.label));\r
346 if (case_insensitive && isupper(i_prime))\r
347 set_orel(tolower(i_prime)-MIN_CHAR,\r
348 &($$.label));\r
349 >>\r
350 { RANGE anychar\r
351 << if (case_insensitive){\r
352 i_prime = $$.letter+MIN_CHAR;\r
353 $$.letter = (islower(i_prime) ?\r
354 toupper(i_prime) : i_prime)-MIN_CHAR;\r
355 i_prime = $2.letter+MIN_CHAR;\r
356 $2.letter = (islower(i_prime) ?\r
357 toupper(i_prime) : i_prime)-MIN_CHAR;\r
358 }\r
359 /* check to see if range okay */\r
360 {\r
361 int debugLetter1 = $$.letter;\r
362 int debugLetter2 = $2.letter;\r
363 }\r
364 if ($$.letter > $2.letter \r
365 && $2.letter != 0xff){ /* MR16 */\r
366 error("invalid range ", zzline);\r
367 }\r
368 for (i=$$.letter; i<= (int)$2.letter; ++i){\r
369 set_orel(i,&($$.label));\r
370 i_prime = i+MIN_CHAR;\r
371 if (case_insensitive && islower(i_prime))\r
372 set_orel(toupper(i_prime)-MIN_CHAR,\r
373 &($$.label));\r
374 if (case_insensitive && isupper(i_prime))\r
375 set_orel(tolower(i_prime)-MIN_CHAR,\r
376 &($$.label));\r
377 }\r
378 >>\r
379 }\r
380 ;\r
381\r
382atom : << register int i_prime;>>\r
383 anychar\r
384 <<$$.label = set_of($1.letter);\r
385 i_prime = $1.letter + MIN_CHAR;\r
386 if (case_insensitive && islower(i_prime))\r
387 set_orel(toupper(i_prime)-MIN_CHAR,\r
388 &($$.label));\r
389 if (case_insensitive && isupper(i_prime))\r
390 set_orel(tolower(i_prime)-MIN_CHAR,\r
391 &($$.label));\r
392 >>\r
393 ;\r
394\r
395anychar : REGCHAR <<$$.letter = $1.letter - MIN_CHAR;>>\r
396 | OCTAL_VALUE <<$$.letter = $1.letter - MIN_CHAR;>>\r
397 | HEX_VALUE <<$$.letter = $1.letter - MIN_CHAR;>>\r
398 | DEC_VALUE <<$$.letter = $1.letter - MIN_CHAR;>>\r
399 | TAB <<$$.letter = $1.letter - MIN_CHAR;>>\r
400 | NL <<$$.letter = $1.letter - MIN_CHAR;>>\r
401 | CR <<$$.letter = $1.letter - MIN_CHAR;>>\r
402 | BS <<$$.letter = $1.letter - MIN_CHAR;>>\r
403 | LIT <<$$.letter = $1.letter - MIN_CHAR;>>\r
404 /* NOTE: LEX_EOF is ALWAYS shifted to 0 = MIN_CHAR - MIN_CHAR*/\r
405 | L_EOF <<$$.letter = 0;>>\r
406 ;\r
407\r
408<</* empty action */>>\r
409\r
410#lexclass ACT\r
411#token "@" << error("unterminated action", zzline); zzmode(START); >>\r
412#token ACTION "\>\>"\r
413 << if (func_action) fprintf(OUT,"}\n\n");\r
414 zzmode(START);\r
415/* MR1 */\r
416/* MR1 11-Apr-97 Provide mechanism for inserting code into DLG class */\r
417/* MR1 via <<%%lexmember ...>> */\r
418/* MR1 This is a consequence of not saving actions */\r
419/* MR1 */\r
420/* MR1 */ parserClass=0; \r
421/* MR1 */ lexPrefix=0;\r
422/* MR1 */ lexAction=0;\r
423/* MR1 */ lexMember=0;\r
424 >>\r
425#token "\>" << xxputc(zzlextext[0]); zzskip(); >> /* MR1 */\r
426#token "\\\>" << xxputc('>'); zzskip(); >> /* MR1 */\r
427#token "\\" << xxputc('\\'); zzskip(); >> /* MR1 */\r
428#token "\n" << xxputc(zzlextext[0]); ++zzline; zzskip(); >> /* MR1 */\r
429#token "/\*" << zzmode(ACTION_COMMENTS); /* MR1 */\r
430 xxprintf("%s", &(zzlextext[0])); zzskip(); /* MR1 */\r
431 >> /* MR1 */\r
432#token "//" << zzmode(ACTION_CPP_COMMENTS); /* MR1 */\r
433 xxprintf("%s", &(zzlextext[0])); zzskip(); /* MR1 */\r
434 >> /* MR1 */\r
435#token "~[]" << xxputc(zzlextext[0]); zzskip(); >> /* MR1 */\r
436 /* MR1 */\r
437#lexclass ACTION_COMMENTS /* MR1 */\r
438#token "\*/" << zzmode(ACT); /* MR1 */\r
439 xxprintf("%s", &(zzlextext[0])); zzskip(); /* MR1 */\r
440 >> /* MR1 */\r
441#token "[\n\r]" << zzline++; xxputc(zzlextext[0]); zzskip();>> /* MR1 */\r
442#token "~[]" << xxputc(zzlextext[0]); zzskip();>> /* MR1 */\r
443 /* MR1 */\r
444#lexclass ACTION_CPP_COMMENTS /* MR1 */\r
445#token "[\n\r]" << zzmode(ACT); zzline++; /* MR1 */\r
446 xxprintf("%s", &(zzlextext[0])); zzskip(); /* MR1 */\r
447 >> /* MR1 */\r
448#token "~[]" << xxputc(zzlextext[0]); zzskip();>> /* MR1 */\r
449\r
450<<\r
451/* adds a new nfa to the binary tree and returns a pointer to it */\r
452nfa_node *\r
453#ifdef __USE_PROTOS\r
454new_nfa_node(void)\r
455#else\r
456new_nfa_node()\r
457#endif\r
458{\r
459 register nfa_node *t;\r
460 static int nfa_size=0; /* elements nfa_array[] can hold */\r
461\r
462 ++nfa_allocated;\r
463 if (nfa_size<=nfa_allocated){\r
464 /* need to redo array */\r
465 if (!nfa_array){\r
fb0b35e0 466 /* need some to do initial allocation */\r
30fdf114
LG		 467 nfa_size=nfa_allocated+NFA_MIN;\r
468 nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)*\r
469 nfa_size);\r
470 }else{\r
471 /* need more space */\r
472 nfa_size=2*(nfa_allocated+1);\r
473 nfa_array=(nfa_node **) realloc(nfa_array,\r
474 sizeof(nfa_node*)*nfa_size);\r
475 }\r
476 }\r
477 /* fill out entry in array */\r
478 t = (nfa_node*) malloc(sizeof(nfa_node));\r
479 nfa_array[nfa_allocated] = t;\r
480 *t = nfa_model_node;\r
481 t->node_no = nfa_allocated;\r
482 return t;\r
483}\r
484\r
485\r
486/* initialize the model node used to fill in newly made nfa_nodes */\r
487void\r
488#ifdef __USE_PROTOS\r
489make_nfa_model_node(void)\r
490#else\r
491make_nfa_model_node()\r
492#endif\r
493{\r
494 nfa_model_node.node_no = -1; /* impossible value for real nfa node */\r
495 nfa_model_node.nfa_set = 0;\r
496 nfa_model_node.accept = 0; /* error state default*/\r
497 nfa_model_node.trans[0] = NULL;\r
498 nfa_model_node.trans[1] = NULL;\r
499 nfa_model_node.label = empty;\r
500}\r
501>>\r
502\r
503<<\r
504#if defined(DEBUG) || defined(_DEBUG)\r
505\r
506/* print out the pointer value and the node_number */\r
507void\r
508#ifdef __USE_PROTOS\r
509fprint_dfa_pair(FILE *f, nfa_node *p)\r
510#else\r
511fprint_dfa_pair(f, p)\r
512FILE *f;\r
513nfa_node *p;\r
514#endif\r
515{\r
516 if (p){\r
517 fprintf(f, "%x (%d)", p, p->node_no);\r
518 }else{\r
519 fprintf(f, "(nil)");\r
520 }\r
521}\r
522\r
523/* print out interest information on a set */\r
524void\r
525#ifdef __USE_PROTOS\r
526fprint_set(FILE *f, set s)\r
527#else\r
528fprint_set(f,s)\r
529FILE *f;\r
530set s;\r
531#endif\r
532{\r
533 unsigned int *x;\r
534\r
535 fprintf(f, "n = %d,", s.n);\r
536 if (s.setword){\r
537 fprintf(f, "setword = %x, ", s.setword);\r
538 /* print out all the elements in the set */\r
539 x = set_pdq(s);\r
540 while (*x!=nil){\r
541 fprintf(f, "%d ", *x);\r
542 ++x;\r
543 }\r
544 }else{\r
545 fprintf(f, "setword = (nil)");\r
546 }\r
547}\r
548\r
549/* code to be able to dump out the nfas\r
550 return 0 if okay dump\r
551 return 1 if screwed up\r
552 */\r
553int\r
554#ifdef __USE_PROTOS\r
555dump_nfas(int first_node, int last_node)\r
556#else\r
557dump_nfas(first_node, last_node)\r
558int first_node;\r
559int last_node;\r
560#endif\r
561{\r
562 register int i;\r
563 nfa_node *t;\r
564\r
565 for (i=first_node; i<=last_node; ++i){\r
566 t = NFA(i);\r
567 if (!t) break;\r
568 fprintf(stderr, "nfa_node %d {\n", t->node_no);\r
569 fprintf(stderr, "\n\tnfa_set = %d\n", t->nfa_set);\r
570 fprintf(stderr, "\taccept\t=\t%d\n", t->accept);\r
571 fprintf(stderr, "\ttrans\t=\t(");\r
572 fprint_dfa_pair(stderr, t->trans[0]);\r
573 fprintf(stderr, ",");\r
574 fprint_dfa_pair(stderr, t->trans[1]);\r
575 fprintf(stderr, ")\n");\r
576 fprintf(stderr, "\tlabel\t=\t{ ");\r
577 fprint_set(stderr, t->label);\r
578 fprintf(stderr, "\t}\n");\r
579 fprintf(stderr, "}\n\n");\r
580 }\r
581 return 0;\r
582}\r
583#endif\r
584>>\r
585\r
586<<\r
587/* DLG-specific syntax error message generator\r
588 * (define USER_ZZSYN when compiling so don't get 2 definitions)\r
589 */\r
590void\r
591#ifdef __USE_PROTOS\r
592zzsyn(char *text, int tok, char *egroup, SetWordType *eset, int etok, int k, char *bad_text)\r
593#else\r
594zzsyn(text, tok, egroup, eset, etok, k, bad_text)\r
595char *text, *egroup, *bad_text;\r
596int tok;\r
597int etok;\r
598int k;\r
599SetWordType *eset;\r
600#endif\r
601{\r
602 fprintf(stderr, ErrHdr, file_str[0]!=NULL?file_str[0]:"stdin", zzline);\r
603 fprintf(stderr, " syntax error at \"%s\"", (tok==zzEOF_TOKEN)?"EOF":text);\r
604 if ( !etok && !eset ) {fprintf(stderr, "\n"); return;}\r
605 if ( k==1 ) fprintf(stderr, " missing");\r
606 else\r
607 {\r
608 fprintf(stderr, "; \"%s\" not", bad_text);\r
609 if ( zzset_deg(eset)>1 ) fprintf(stderr, " in");\r
610 }\r
611 if ( zzset_deg(eset)>0 ) zzedecode(eset);\r
612 else fprintf(stderr, " %s", zztokens[etok]);\r
613 if ( strlen(egroup) > (size_t)0 ) fprintf(stderr, " in %s", egroup);\r
614 fprintf(stderr, "\n");\r
615}\r
616>>\r
EFI Development Kit II mirror for PVE