Mercurial > cpython-lru_cache-weakref
annotate Parser/firstsets.c @ 25838:8540887bcec6 2.2
Backport of 2.183:
Fix memory leak in add_subclass() found by NealN with valgrind.
| author | Guido van Rossum <guido@python.org> |
|---|---|
| date | Fri, 18 Oct 2002 13:42:21 +0000 |
| parents | 5780724470ee |
| children | e9a7a2784e17 |
| rev | line source |
|---|---|
| 145 | 1 |
| 6 | 2 /* Computation of FIRST stets */ |
| 3 | |
| 86 | 4 #include "pgenheaders.h" |
| 6 | 5 #include "grammar.h" |
| 6 #include "token.h" | |
| 7 | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
8 extern int Py_DebugFlag; |
| 6 | 9 |
| 86 | 10 /* Forward */ |
|
13447
a89f7f268de4
Nuke all remaining occurrences of Py_PROTO and Py_FPROTO.
Tim Peters <tim.peters@gmail.com>
parents:
13256
diff
changeset
|
11 static void calcfirstset(grammar *, dfa *); |
| 86 | 12 |
| 13 void | |
| 13659 | 14 addfirstsets(grammar *g) |
| 86 | 15 { |
| 16 int i; | |
| 17 dfa *d; | |
|
19867
5780724470ee
Silence parser generator output.
Guido van Rossum <guido@python.org>
parents:
14375
diff
changeset
|
18 |
|
5780724470ee
Silence parser generator output.
Guido van Rossum <guido@python.org>
parents:
14375
diff
changeset
|
19 if (Py_DebugFlag) |
|
5780724470ee
Silence parser generator output.
Guido van Rossum <guido@python.org>
parents:
14375
diff
changeset
|
20 printf("Adding FIRST sets ...\n"); |
| 86 | 21 for (i = 0; i < g->g_ndfas; i++) { |
| 22 d = &g->g_dfa[i]; | |
| 23 if (d->d_first == NULL) | |
| 24 calcfirstset(g, d); | |
| 25 } | |
| 26 } | |
| 27 | |
| 6 | 28 static void |
| 13659 | 29 calcfirstset(grammar *g, dfa *d) |
| 6 | 30 { |
| 31 int i, j; | |
| 32 state *s; | |
| 33 arc *a; | |
| 34 int nsyms; | |
| 35 int *sym; | |
| 36 int nbits; | |
| 37 static bitset dummy; | |
| 38 bitset result; | |
| 39 int type; | |
| 40 dfa *d1; | |
| 41 label *l0; | |
| 42 | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
43 if (Py_DebugFlag) |
| 6 | 44 printf("Calculate FIRST set for '%s'\n", d->d_name); |
| 45 | |
| 46 if (dummy == NULL) | |
| 47 dummy = newbitset(1); | |
| 48 if (d->d_first == dummy) { | |
| 49 fprintf(stderr, "Left-recursion for '%s'\n", d->d_name); | |
| 50 return; | |
| 51 } | |
| 52 if (d->d_first != NULL) { | |
| 53 fprintf(stderr, "Re-calculating FIRST set for '%s' ???\n", | |
| 54 d->d_name); | |
| 55 } | |
| 56 d->d_first = dummy; | |
| 57 | |
| 58 l0 = g->g_ll.ll_label; | |
| 59 nbits = g->g_ll.ll_nlabels; | |
| 60 result = newbitset(nbits); | |
| 61 | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
62 sym = PyMem_NEW(int, 1); |
| 6 | 63 if (sym == NULL) |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
64 Py_FatalError("no mem for new sym in calcfirstset"); |
| 6 | 65 nsyms = 1; |
| 66 sym[0] = findlabel(&g->g_ll, d->d_type, (char *)NULL); | |
| 67 | |
| 68 s = &d->d_state[d->d_initial]; | |
| 69 for (i = 0; i < s->s_narcs; i++) { | |
| 70 a = &s->s_arc[i]; | |
| 71 for (j = 0; j < nsyms; j++) { | |
| 72 if (sym[j] == a->a_lbl) | |
| 73 break; | |
| 74 } | |
| 75 if (j >= nsyms) { /* New label */ | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
76 PyMem_RESIZE(sym, int, nsyms + 1); |
| 6 | 77 if (sym == NULL) |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
78 Py_FatalError( |
|
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
79 "no mem to resize sym in calcfirstset"); |
| 6 | 80 sym[nsyms++] = a->a_lbl; |
| 81 type = l0[a->a_lbl].lb_type; | |
| 82 if (ISNONTERMINAL(type)) { | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
83 d1 = PyGrammar_FindDFA(g, type); |
| 6 | 84 if (d1->d_first == dummy) { |
| 85 fprintf(stderr, | |
| 86 "Left-recursion below '%s'\n", | |
| 87 d->d_name); | |
| 88 } | |
| 89 else { | |
| 90 if (d1->d_first == NULL) | |
| 91 calcfirstset(g, d1); | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
92 mergebitset(result, |
|
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
93 d1->d_first, nbits); |
| 6 | 94 } |
| 95 } | |
| 96 else if (ISTERMINAL(type)) { | |
| 97 addbit(result, a->a_lbl); | |
| 98 } | |
| 99 } | |
| 100 } | |
| 101 d->d_first = result; | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
102 if (Py_DebugFlag) { |
| 6 | 103 printf("FIRST set for '%s': {", d->d_name); |
| 104 for (i = 0; i < nbits; i++) { | |
| 105 if (testbit(result, i)) | |
|
5379
1c9a84e0981d
Another directory quickly renamed.
Guido van Rossum <guido@python.org>
parents:
4503
diff
changeset
|
106 printf(" %s", PyGrammar_LabelRepr(&l0[i])); |
| 6 | 107 } |
| 108 printf(" }\n"); | |
| 109 } | |
| 110 } |