mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 19:43:32 +00:00
9b29358511
Status lines for Emacs and Vim have been added to Python sources so they'll be easier to edit using Python's preferred coding style. Some DNS helper functions have been broken up into multiple files. It's nice to have one function per file whenever possible, since that way we don't need -ffunction-sections. Another reason it's good to have small source files, is because the build will be enforcing resource limits on compilation and testing soon.
119 lines
3.7 KiB
C
119 lines
3.7 KiB
C
/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:4;tab-width:8;coding:utf-8 -*-│
|
|
│vi: set net ft=c ts=4 sts=4 sw=4 fenc=utf-8 :vi│
|
|
╞══════════════════════════════════════════════════════════════════════════════╡
|
|
│ Python 3 │
|
|
│ https://docs.python.org/3/license.html │
|
|
╚─────────────────────────────────────────────────────────────────────────────*/
|
|
#include "third_party/python/Include/bitset.h"
|
|
#include "third_party/python/Include/grammar.h"
|
|
#include "third_party/python/Include/objimpl.h"
|
|
#include "third_party/python/Include/pgenheaders.h"
|
|
#include "third_party/python/Include/token.h"
|
|
/* clang-format off */
|
|
|
|
extern int Py_DebugFlag;
|
|
|
|
/* Forward */
|
|
static void calcfirstset(grammar *, dfa *);
|
|
|
|
void
|
|
addfirstsets(grammar *g)
|
|
{
|
|
int i;
|
|
dfa *d;
|
|
|
|
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)
|
|
calcfirstset(g, d);
|
|
}
|
|
}
|
|
|
|
static void
|
|
calcfirstset(grammar *g, dfa *d)
|
|
{
|
|
int i, j;
|
|
state *s;
|
|
arc *a;
|
|
int nsyms;
|
|
int *sym;
|
|
int nbits;
|
|
static bitset dummy;
|
|
bitset result;
|
|
int type;
|
|
dfa *d1;
|
|
label *l0;
|
|
|
|
if (Py_DebugFlag)
|
|
printf("Calculate FIRST set for '%s'\n", d->d_name);
|
|
|
|
if (dummy == NULL)
|
|
dummy = newbitset(1);
|
|
if (d->d_first == dummy) {
|
|
fprintf(stderr, "Left-recursion for '%s'\n", d->d_name);
|
|
return;
|
|
}
|
|
if (d->d_first != NULL) {
|
|
fprintf(stderr, "Re-calculating FIRST set for '%s' ???\n",
|
|
d->d_name);
|
|
}
|
|
d->d_first = dummy;
|
|
|
|
l0 = g->g_ll.ll_label;
|
|
nbits = g->g_ll.ll_nlabels;
|
|
result = newbitset(nbits);
|
|
|
|
sym = (int *)PyObject_MALLOC(sizeof(int));
|
|
if (sym == NULL)
|
|
Py_FatalError("no mem for new sym in calcfirstset");
|
|
nsyms = 1;
|
|
sym[0] = findlabel(&g->g_ll, d->d_type, (char *)NULL);
|
|
|
|
s = &d->d_state[d->d_initial];
|
|
for (i = 0; i < s->s_narcs; i++) {
|
|
a = &s->s_arc[i];
|
|
for (j = 0; j < nsyms; j++) {
|
|
if (sym[j] == a->a_lbl)
|
|
break;
|
|
}
|
|
if (j >= nsyms) { /* New label */
|
|
sym = (int *)PyObject_REALLOC(sym,
|
|
sizeof(int) * (nsyms + 1));
|
|
if (sym == NULL)
|
|
Py_FatalError(
|
|
"no mem to resize sym in calcfirstset");
|
|
sym[nsyms++] = a->a_lbl;
|
|
type = l0[a->a_lbl].lb_type;
|
|
if (ISNONTERMINAL(type)) {
|
|
d1 = PyGrammar_FindDFA(g, type);
|
|
if (d1->d_first == dummy) {
|
|
fprintf(stderr,
|
|
"Left-recursion below '%s'\n",
|
|
d->d_name);
|
|
}
|
|
else {
|
|
if (d1->d_first == NULL)
|
|
calcfirstset(g, d1);
|
|
mergebitset(result,
|
|
d1->d_first, nbits);
|
|
}
|
|
}
|
|
else if (ISTERMINAL(type)) {
|
|
addbit(result, a->a_lbl);
|
|
}
|
|
}
|
|
}
|
|
d->d_first = result;
|
|
if (Py_DebugFlag) {
|
|
printf("FIRST set for '%s': {", d->d_name);
|
|
for (i = 0; i < nbits; i++) {
|
|
if (testbit(result, i))
|
|
printf(" %s", PyGrammar_LabelRepr(&l0[i]));
|
|
}
|
|
printf(" }\n");
|
|
}
|
|
|
|
PyObject_FREE(sym);
|
|
}
|