h_predict for k>1, more debugging
This commit is contained in:
parent
748845ca0c
commit
428636f3d0
3 changed files with 58 additions and 43 deletions
|
|
@ -81,28 +81,6 @@ void h_llktable_free(HLLkTable *table)
|
||||||
h_free(table);
|
h_free(table);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Compute the predict_k set of production "A -> rhs".
|
|
||||||
* Always returns a newly-allocated HCFStringMap.
|
|
||||||
*/
|
|
||||||
HCFStringMap *h_predict(size_t k, HCFGrammar *g,
|
|
||||||
const HCFChoice *A, const HCFSequence *rhs)
|
|
||||||
{
|
|
||||||
assert(k==1); // XXX
|
|
||||||
HCFStringMap *ret = h_stringmap_new(g->arena);
|
|
||||||
|
|
||||||
// predict(A -> rhs) = first(rhs) u follow(A) if "" can be derived from rhs
|
|
||||||
// predict(A -> rhs) = first(rhs) otherwise
|
|
||||||
|
|
||||||
h_stringmap_update(ret, h_first_seq(k, g, rhs->items));
|
|
||||||
if(h_derives_epsilon_seq(g, rhs->items))
|
|
||||||
h_stringmap_update(ret, h_follow(k, g, A));
|
|
||||||
|
|
||||||
// make sure there are only strings of length _exactly_ k
|
|
||||||
ret->epsilon_branch = NULL;
|
|
||||||
|
|
||||||
return ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
void *const CONFLICT = (void *)(uintptr_t)(-1);
|
void *const CONFLICT = (void *)(uintptr_t)(-1);
|
||||||
|
|
||||||
// helper for stringmap_merge
|
// helper for stringmap_merge
|
||||||
|
|
@ -113,7 +91,7 @@ static void *combine_entries(HHashSet *workset, void *dst, const void *src)
|
||||||
|
|
||||||
if(dst == CONFLICT) { // previous conflict
|
if(dst == CONFLICT) { // previous conflict
|
||||||
h_hashset_put(workset, src);
|
h_hashset_put(workset, src);
|
||||||
} else if(dst == src) { // new conflict
|
} else if(dst != src) { // new conflict
|
||||||
h_hashset_put(workset, dst);
|
h_hashset_put(workset, dst);
|
||||||
h_hashset_put(workset, src);
|
h_hashset_put(workset, src);
|
||||||
dst = CONFLICT;
|
dst = CONFLICT;
|
||||||
|
|
@ -178,6 +156,8 @@ static int fill_table_row(size_t kmax, HCFGrammar *g, HCFStringMap *row,
|
||||||
// run until workset exhausted or kmax hit
|
// run until workset exhausted or kmax hit
|
||||||
size_t k;
|
size_t k;
|
||||||
for(k=1; k<=kmax; k++) {
|
for(k=1; k<=kmax; k++) {
|
||||||
|
printf("k=%lu\n", k); // XXX debug
|
||||||
|
|
||||||
// allocate a fresh workset for the next round
|
// allocate a fresh workset for the next round
|
||||||
HHashSet *nextset = h_hashset_new(g->arena, h_eq_ptr, h_hash_ptr);
|
HHashSet *nextset = h_hashset_new(g->arena, h_eq_ptr, h_hash_ptr);
|
||||||
|
|
||||||
|
|
@ -196,26 +176,22 @@ static int fill_table_row(size_t kmax, HCFGrammar *g, HCFStringMap *row,
|
||||||
HCFStringMap *pred = h_predict(k, g, A, rhs);
|
HCFStringMap *pred = h_predict(k, g, A, rhs);
|
||||||
h_stringmap_replace(pred, NULL, rhs);
|
h_stringmap_replace(pred, NULL, rhs);
|
||||||
|
|
||||||
|
// XXX debug
|
||||||
|
printf("predict(");
|
||||||
|
h_pprint_sequence(stdout, g, rhs);
|
||||||
|
printf(") = ");
|
||||||
|
h_pprint_stringset(stdout, pred, 0);
|
||||||
|
|
||||||
// merge predict set into the row
|
// merge predict set into the row
|
||||||
// accumulates conflicts in new workset
|
// accumulates conflicts in new workset
|
||||||
stringmap_merge(nextset, row, pred);
|
stringmap_merge(nextset, row, pred);
|
||||||
|
|
||||||
// XXX debug
|
|
||||||
if(A == g->start) {
|
|
||||||
printf("predict(");
|
|
||||||
h_pprint_sequence(stdout, g, rhs);
|
|
||||||
printf(") = ");
|
|
||||||
h_pprint_stringset(stdout, g, pred, 0);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
// XXX debug
|
// XXX debug
|
||||||
if(A == g->start) {
|
printf("row(");
|
||||||
printf("row(");
|
h_pprint_symbol(stdout, g, A);
|
||||||
h_pprint_symbol(stdout, g, A);
|
printf(") = ");
|
||||||
printf(") = ");
|
h_pprint_stringset(stdout, row, 0);
|
||||||
h_pprint_stringset(stdout, g, row, 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
// switch to the updated workset
|
// switch to the updated workset
|
||||||
h_hashtable_free(workset);
|
h_hashtable_free(workset);
|
||||||
|
|
@ -486,11 +462,11 @@ int test_llk(void)
|
||||||
printf("derive epsilon: ");
|
printf("derive epsilon: ");
|
||||||
h_pprint_symbolset(stdout, g, g->geneps, 0);
|
h_pprint_symbolset(stdout, g, g->geneps, 0);
|
||||||
printf("first(A) = ");
|
printf("first(A) = ");
|
||||||
h_pprint_stringset(stdout, g, h_first(3, g, g->start), 0);
|
h_pprint_stringset(stdout, h_first(3, g, g->start), 0);
|
||||||
//printf("follow(C) = ");
|
//printf("follow(C) = ");
|
||||||
//h_pprint_stringset(stdout, g, h_follow(3, g, h_desugar(&system_allocator, c)), 0);
|
//h_pprint_stringset(stdout, h_follow(3, g, h_desugar(&system_allocator, c)), 0);
|
||||||
|
|
||||||
if(h_compile(p, PB_LLk, NULL)) {
|
if(h_compile(p, PB_LLk, (void *)2)) {
|
||||||
fprintf(stderr, "does not compile\n");
|
fprintf(stderr, "does not compile\n");
|
||||||
return 2;
|
return 2;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -437,7 +437,23 @@ static bool any_string_shorter(size_t k, const HCFStringMap *m)
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
const HCFStringMap *h_follow(size_t k, HCFGrammar *g, const HCFChoice *x);
|
// helper for h_predict
|
||||||
|
static void remove_all_shorter(size_t k, HCFStringMap *m)
|
||||||
|
{
|
||||||
|
if(k==0) return;
|
||||||
|
m->epsilon_branch = NULL;
|
||||||
|
if(k==1) return;
|
||||||
|
|
||||||
|
// iterate over m->char_branches
|
||||||
|
const HHashTable *ht = m->char_branches;
|
||||||
|
for(size_t i=0; i < ht->capacity; i++) {
|
||||||
|
for(HHashTableEntry *hte = &ht->contents[i]; hte; hte = hte->next) {
|
||||||
|
if(hte->key == NULL)
|
||||||
|
continue;
|
||||||
|
remove_all_shorter(k-1, hte->value); // recursion into subtree
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// h_follow adapted to the signature of StringSetFun
|
// h_follow adapted to the signature of StringSetFun
|
||||||
static inline const HCFStringMap *h_follow_(size_t k, HCFGrammar *g, HCFChoice **s)
|
static inline const HCFStringMap *h_follow_(size_t k, HCFGrammar *g, HCFChoice **s)
|
||||||
|
|
@ -507,6 +523,23 @@ const HCFStringMap *h_follow(size_t k, HCFGrammar *g, const HCFChoice *x)
|
||||||
return ret;
|
return ret;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
HCFStringMap *h_predict(size_t k, HCFGrammar *g,
|
||||||
|
const HCFChoice *A, const HCFSequence *rhs)
|
||||||
|
{
|
||||||
|
HCFStringMap *ret = h_stringmap_new(g->arena);
|
||||||
|
|
||||||
|
// predict_k(A -> rhs) =
|
||||||
|
// { ab | a <- first_k(rhs), b <- follow_k(A), |ab|=k }
|
||||||
|
|
||||||
|
const HCFStringMap *first_rhs = h_first_seq(k, g, rhs->items);
|
||||||
|
stringset_extend(g, ret, k, first_rhs, h_follow_, (HCFChoice **)&A);
|
||||||
|
|
||||||
|
// make sure there are only strings of length _exactly_ k
|
||||||
|
remove_all_shorter(k, ret);
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
// add the set { a b | a <- as, b <- f_l(S), l=k-|a| } to ret
|
// add the set { a b | a <- as, b <- f_l(S), l=k-|a| } to ret
|
||||||
static void stringset_extend(HCFGrammar *g, HCFStringMap *ret,
|
static void stringset_extend(HCFGrammar *g, HCFStringMap *ret,
|
||||||
size_t k, const HCFStringMap *as,
|
size_t k, const HCFStringMap *as,
|
||||||
|
|
@ -806,7 +839,7 @@ pprint_stringset_elems(FILE *file, bool first, char *prefix, size_t n,
|
||||||
return first;
|
return first;
|
||||||
}
|
}
|
||||||
|
|
||||||
void h_pprint_stringset(FILE *file, const HCFGrammar *g, const HCFStringMap *set, int indent)
|
void h_pprint_stringset(FILE *file, const HCFStringMap *set, int indent)
|
||||||
{
|
{
|
||||||
int j;
|
int j;
|
||||||
for(j=0; j<indent; j++) fputc(' ', file);
|
for(j=0; j<indent; j++) fputc(' ', file);
|
||||||
|
|
|
||||||
|
|
@ -80,10 +80,16 @@ const HCFStringMap *h_first_seq(size_t k, HCFGrammar *g, HCFChoice **s);
|
||||||
/* Compute follow_k set of symbol x. Memoized. */
|
/* Compute follow_k set of symbol x. Memoized. */
|
||||||
const HCFStringMap *h_follow(size_t k, HCFGrammar *g, const HCFChoice *x);
|
const HCFStringMap *h_follow(size_t k, HCFGrammar *g, const HCFChoice *x);
|
||||||
|
|
||||||
|
/* Compute the predict_k set of production "A -> rhs".
|
||||||
|
* Always returns a newly-allocated HCFStringMap.
|
||||||
|
*/
|
||||||
|
HCFStringMap *h_predict(size_t k, HCFGrammar *g,
|
||||||
|
const HCFChoice *A, const HCFSequence *rhs);
|
||||||
|
|
||||||
|
|
||||||
/* Pretty-printers for grammars and associated data. */
|
/* Pretty-printers for grammars and associated data. */
|
||||||
void h_pprint_grammar(FILE *file, const HCFGrammar *g, int indent);
|
void h_pprint_grammar(FILE *file, const HCFGrammar *g, int indent);
|
||||||
void h_pprint_sequence(FILE *f, const HCFGrammar *g, const HCFSequence *seq);
|
void h_pprint_sequence(FILE *f, const HCFGrammar *g, const HCFSequence *seq);
|
||||||
void h_pprint_symbol(FILE *f, const HCFGrammar *g, const HCFChoice *x);
|
void h_pprint_symbol(FILE *f, const HCFGrammar *g, const HCFChoice *x);
|
||||||
void h_pprint_symbolset(FILE *file, const HCFGrammar *g, const HHashSet *set, int indent);
|
void h_pprint_symbolset(FILE *file, const HCFGrammar *g, const HHashSet *set, int indent);
|
||||||
void h_pprint_stringset(FILE *file, const HCFGrammar *g, const HCFStringMap *set, int indent);
|
void h_pprint_stringset(FILE *file, const HCFStringMap *set, int indent);
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue