{
int i;
dfa *d;
-
- printf("Adding FIRST sets ...\n");
+
+ if (Py_DebugFlag)
+ printf("Adding FIRST sets ...\n");
for (i = 0; i < g->g_ndfas; i++) {
d = &g->g_dfa[i];
if (d->d_first == NULL)
{
nfagrammar *gr;
int i;
-
- printf("Compiling (meta-) parse tree into NFA grammar\n");
+
+ if (Py_DebugFlag)
+ printf("Compiling (meta-) parse tree into NFA grammar\n");
gr = newnfagrammar();
REQ(n, MSTART);
i = n->n_nchildren - 1; /* Last child is ENDMARKER */
if (Py_DebugFlag) {
printf("Dump of NFA for '%s' ...\n", nf->nf_name);
dumpnfa(&gr->gr_ll, nf);
+ printf("Making DFA for '%s' ...\n", nf->nf_name);
}
- printf("Making DFA for '%s' ...\n", nf->nf_name);
d = adddfa(g, nf->nf_type, nf->nf_name);
makedfa(gr, gr->gr_nfa[i], d);
}
perror(graminit_c);
Py_Exit(1);
}
- printf("Writing %s ...\n", graminit_c);
+ if (Py_DebugFlag)
+ printf("Writing %s ...\n", graminit_c);
printgrammar(g, fp);
fclose(fp);
fp = fopen(graminit_h, "w");
perror(graminit_h);
Py_Exit(1);
}
- printf("Writing %s ...\n", graminit_h);
+ if (Py_DebugFlag)
+ printf("Writing %s ...\n", graminit_h);
printnonterminals(g, fp);
fclose(fp);
Py_Exit(0);