1991-02-19 12:39:46 +00:00
|
|
|
/***********************************************************
|
1995-01-04 19:08:09 +00:00
|
|
|
Copyright 1991-1995 by Stichting Mathematisch Centrum, Amsterdam,
|
|
|
|
The Netherlands.
|
1991-02-19 12:39:46 +00:00
|
|
|
|
|
|
|
All Rights Reserved
|
|
|
|
|
1996-10-25 14:44:06 +00:00
|
|
|
Permission to use, copy, modify, and distribute this software and its
|
|
|
|
documentation for any purpose and without fee is hereby granted,
|
1991-02-19 12:39:46 +00:00
|
|
|
provided that the above copyright notice appear in all copies and that
|
1996-10-25 14:44:06 +00:00
|
|
|
both that copyright notice and this permission notice appear in
|
1991-02-19 12:39:46 +00:00
|
|
|
supporting documentation, and that the names of Stichting Mathematisch
|
1996-10-25 14:44:06 +00:00
|
|
|
Centrum or CWI or Corporation for National Research Initiatives or
|
|
|
|
CNRI not be used in advertising or publicity pertaining to
|
|
|
|
distribution of the software without specific, written prior
|
|
|
|
permission.
|
|
|
|
|
|
|
|
While CWI is the initial source for this software, a modified version
|
|
|
|
is made available by the Corporation for National Research Initiatives
|
|
|
|
(CNRI) at the Internet address ftp://ftp.python.org.
|
|
|
|
|
|
|
|
STICHTING MATHEMATISCH CENTRUM AND CNRI DISCLAIM ALL WARRANTIES WITH
|
|
|
|
REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF
|
|
|
|
MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH
|
|
|
|
CENTRUM OR CNRI BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
|
|
|
|
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
|
|
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
|
|
|
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
|
|
PERFORMANCE OF THIS SOFTWARE.
|
1991-02-19 12:39:46 +00:00
|
|
|
|
|
|
|
******************************************************************/
|
|
|
|
|
1990-10-14 12:07:46 +00:00
|
|
|
/* Print a bunch of C initializers that represent a grammar */
|
|
|
|
|
1990-12-20 15:06:42 +00:00
|
|
|
#include "pgenheaders.h"
|
1990-10-14 12:07:46 +00:00
|
|
|
#include "grammar.h"
|
|
|
|
|
1990-12-20 15:06:42 +00:00
|
|
|
/* Forward */
|
|
|
|
static void printarcs PROTO((int, dfa *, FILE *));
|
|
|
|
static void printstates PROTO((grammar *, FILE *));
|
|
|
|
static void printdfas PROTO((grammar *, FILE *));
|
|
|
|
static void printlabels PROTO((grammar *, FILE *));
|
|
|
|
|
|
|
|
void
|
|
|
|
printgrammar(g, fp)
|
|
|
|
grammar *g;
|
|
|
|
FILE *fp;
|
|
|
|
{
|
|
|
|
fprintf(fp, "#include \"pgenheaders.h\"\n");
|
|
|
|
fprintf(fp, "#include \"grammar.h\"\n");
|
|
|
|
printdfas(g, fp);
|
|
|
|
printlabels(g, fp);
|
|
|
|
fprintf(fp, "grammar gram = {\n");
|
|
|
|
fprintf(fp, "\t%d,\n", g->g_ndfas);
|
|
|
|
fprintf(fp, "\tdfas,\n");
|
|
|
|
fprintf(fp, "\t{%d, labels},\n", g->g_ll.ll_nlabels);
|
|
|
|
fprintf(fp, "\t%d\n", g->g_start);
|
|
|
|
fprintf(fp, "};\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
printnonterminals(g, fp)
|
|
|
|
grammar *g;
|
|
|
|
FILE *fp;
|
|
|
|
{
|
|
|
|
dfa *d;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
d = g->g_dfa;
|
|
|
|
for (i = g->g_ndfas; --i >= 0; d++)
|
|
|
|
fprintf(fp, "#define %s %d\n", d->d_name, d->d_type);
|
|
|
|
}
|
|
|
|
|
1990-10-14 12:07:46 +00:00
|
|
|
static void
|
|
|
|
printarcs(i, d, fp)
|
|
|
|
int i;
|
|
|
|
dfa *d;
|
|
|
|
FILE *fp;
|
|
|
|
{
|
|
|
|
arc *a;
|
|
|
|
state *s;
|
|
|
|
int j, k;
|
|
|
|
|
|
|
|
s = d->d_state;
|
|
|
|
for (j = 0; j < d->d_nstates; j++, s++) {
|
|
|
|
fprintf(fp, "static arc arcs_%d_%d[%d] = {\n",
|
|
|
|
i, j, s->s_narcs);
|
|
|
|
a = s->s_arc;
|
|
|
|
for (k = 0; k < s->s_narcs; k++, a++)
|
|
|
|
fprintf(fp, "\t{%d, %d},\n", a->a_lbl, a->a_arrow);
|
|
|
|
fprintf(fp, "};\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
printstates(g, fp)
|
|
|
|
grammar *g;
|
|
|
|
FILE *fp;
|
|
|
|
{
|
|
|
|
state *s;
|
|
|
|
dfa *d;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
d = g->g_dfa;
|
|
|
|
for (i = 0; i < g->g_ndfas; i++, d++) {
|
|
|
|
printarcs(i, d, fp);
|
|
|
|
fprintf(fp, "static state states_%d[%d] = {\n",
|
|
|
|
i, d->d_nstates);
|
|
|
|
s = d->d_state;
|
|
|
|
for (j = 0; j < d->d_nstates; j++, s++)
|
|
|
|
fprintf(fp, "\t{%d, arcs_%d_%d},\n",
|
|
|
|
s->s_narcs, i, j);
|
|
|
|
fprintf(fp, "};\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
printdfas(g, fp)
|
|
|
|
grammar *g;
|
|
|
|
FILE *fp;
|
|
|
|
{
|
|
|
|
dfa *d;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
printstates(g, fp);
|
|
|
|
fprintf(fp, "static dfa dfas[%d] = {\n", g->g_ndfas);
|
|
|
|
d = g->g_dfa;
|
|
|
|
for (i = 0; i < g->g_ndfas; i++, d++) {
|
|
|
|
fprintf(fp, "\t{%d, \"%s\", %d, %d, states_%d,\n",
|
|
|
|
d->d_type, d->d_name, d->d_initial, d->d_nstates, i);
|
|
|
|
fprintf(fp, "\t \"");
|
|
|
|
for (j = 0; j < NBYTES(g->g_ll.ll_nlabels); j++)
|
|
|
|
fprintf(fp, "\\%03o", d->d_first[j] & 0xff);
|
|
|
|
fprintf(fp, "\"},\n");
|
|
|
|
}
|
|
|
|
fprintf(fp, "};\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
printlabels(g, fp)
|
|
|
|
grammar *g;
|
|
|
|
FILE *fp;
|
|
|
|
{
|
|
|
|
label *l;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
fprintf(fp, "static label labels[%d] = {\n", g->g_ll.ll_nlabels);
|
|
|
|
l = g->g_ll.ll_label;
|
|
|
|
for (i = g->g_ll.ll_nlabels; --i >= 0; l++) {
|
|
|
|
if (l->lb_str == NULL)
|
|
|
|
fprintf(fp, "\t{%d, 0},\n", l->lb_type);
|
|
|
|
else
|
|
|
|
fprintf(fp, "\t{%d, \"%s\"},\n",
|
|
|
|
l->lb_type, l->lb_str);
|
|
|
|
}
|
|
|
|
fprintf(fp, "};\n");
|
|
|
|
}
|