void WordTag::insert_connectors(Exp* exp, int& dfs_position,
bool& leading_right, bool& leading_left,
std::vector<int>& eps_right,
std::vector<int>& eps_left,
char* var, bool root, int parrent_cost) {
int cost = parrent_cost + exp->cost;
if (exp->type == CONNECTOR_type) {
dfs_position++;
const char* name = exp->u.string;
Connector* connector = (Connector*)xalloc(sizeof(Connector));
init_connector(connector);
connector->label = NORMAL_LABEL;
connector->priority = THIN_priority;
connector->multi = exp->multi;
connector->string = name;
set_connector_length_limit(connector);
switch(exp->dir) {
case '+':
_position.push_back(_right_connectors.size());
_dir.push_back('+');
_right_connectors.push_back(PositionConnector(connector, '+', _word, dfs_position, exp->cost, cost,
leading_right, false,
eps_right, eps_left));
leading_right = false;
break;
case '-':
_position.push_back(_left_connectors.size());
_dir.push_back('-');
_left_connectors.push_back(PositionConnector(connector, '-', _word, dfs_position, exp->cost, cost,
false, leading_left,
eps_right, eps_left));
leading_left = false;
break;
default:
throw std::string("Unknown connector direction: ") + exp->dir;
}
} else if (exp->type == AND_type) {
if (exp->u.l == NULL) {
/* zeroary and */
} else
if (exp->u.l != NULL && exp->u.l->next == NULL) {
/* unary and - skip */
insert_connectors(exp->u.l->e, dfs_position, leading_right, leading_left, eps_right, eps_left, var, root, cost);
} else {
int i;
E_list* l;
char new_var[MAX_VARIABLE_NAME];
char* last_new_var = new_var;
char* last_var = var;
while(*last_new_var = *last_var) {
last_new_var++;
last_var++;
}
for (i = 0, l = exp->u.l; l != NULL; l = l->next, i++) {
char* s = last_new_var;
*s++ = 'c';
fast_sprintf(s, i);
insert_connectors(l->e, dfs_position, leading_right, leading_left, eps_right, eps_left, new_var, false, cost);
if (leading_right && var != NULL) {
eps_right.push_back(_variables->epsilon(new_var, '+'));
}
if (leading_left && var != NULL) {
eps_left.push_back(_variables->epsilon(new_var, '-'));
}
}
}
} else if (exp->type == OR_type) {
if (exp->u.l != NULL && exp->u.l->next == NULL) {
/* unary or - skip */
insert_connectors(exp->u.l->e, dfs_position, leading_right, leading_left, eps_right, eps_left, var, root, cost);
} else {
int i;
E_list* l;
bool ll_true = false;
bool lr_true = false;
char new_var[MAX_VARIABLE_NAME];
char* last_new_var = new_var;
char* last_var = var;
while(*last_new_var = *last_var) {
last_new_var++;
last_var++;
}
for (i = 0, l = exp->u.l; l != NULL; l = l->next, i++) {
bool lr = leading_right, ll = leading_left;
std::vector<int> er = eps_right, el = eps_left;
char* s = last_new_var;
*s++ = 'd';
fast_sprintf(s, i);
insert_connectors(l->e, dfs_position, lr, ll, er, el, new_var, false, cost);
if (lr)
lr_true = true;
if (ll)
ll_true = true;
}
leading_right = lr_true;
leading_left = ll_true;
}
}
}
void WordTag::insert_connectors(Exp* exp, int& dfs_position,
bool& leading_right, bool& leading_left,
std::vector<int>& eps_right,
std::vector<int>& eps_left,
char* var, bool root, double parent_cost,
Exp* parent_exp, const X_node *word_xnode)
{
double cost = parent_cost + exp->cost;
#ifdef DEBUG
if (0 && verbosity_level(+D_IC)) { // Extreme debug
printf("Expression type %d for Word%d, var %s:\n", exp->type, _word, var);
printf("parent_exp: "); print_expression(parent_exp);
printf("exp: "); print_expression(exp);
}
#endif
if (exp->type == CONNECTOR_type) {
dfs_position++;
Connector connector;
connector.multi = exp->multi;
connector.desc = exp->u.condesc;
set_connector_length_limit(&connector, _opts);
switch (exp->dir) {
case '+':
_position.push_back(_right_connectors.size());
_dir.push_back('+');
_right_connectors.push_back(
PositionConnector(parent_exp, &connector, '+', _word, dfs_position,
exp->cost, cost, leading_right, false,
eps_right, eps_left, word_xnode));
leading_right = false;
break;
case '-':
_position.push_back(_left_connectors.size());
_dir.push_back('-');
_left_connectors.push_back(
PositionConnector(parent_exp, &connector, '-', _word, dfs_position,
exp->cost, cost, false, leading_left,
eps_right, eps_left, word_xnode));
leading_left = false;
break;
default:
throw std::string("Unknown connector direction: ") + exp->dir;
}
} else if (exp->type == AND_type) {
if (exp->u.l == NULL) {
/* zeroary and */
} else
if (exp->u.l != NULL && exp->u.l->next == NULL) {
/* unary and - skip */
insert_connectors(exp->u.l->e, dfs_position, leading_right,
leading_left, eps_right, eps_left, var, root, cost, parent_exp, word_xnode);
} else {
int i;
E_list* l;
char new_var[MAX_VARIABLE_NAME];
char* last_new_var = new_var;
char* last_var = var;
while ((*last_new_var = *last_var)) {
last_new_var++;
last_var++;
}
for (i = 0, l = exp->u.l; l != NULL; l = l->next, i++) {
char* s = last_new_var;
*s++ = 'c';
fast_sprintf(s, i);
insert_connectors(l->e, dfs_position, leading_right, leading_left,
eps_right, eps_left, new_var, false, cost, parent_exp, word_xnode);
#ifdef POWER_PRUNE_CONNECTORS
if (leading_right) {
eps_right.push_back(_variables->epsilon(new_var, '+'));
}
if (leading_left) {
eps_left.push_back(_variables->epsilon(new_var, '-'));
}
#endif
}
}
} else if (exp->type == OR_type) {
if (exp->u.l != NULL && exp->u.l->next == NULL) {
/* unary or - skip */
insert_connectors(exp->u.l->e, dfs_position, leading_right, leading_left,
eps_right, eps_left, var, root, cost, exp->u.l->e, word_xnode);
} else {
int i;
E_list* l;
bool ll_true = false;
bool lr_true = false;
char new_var[MAX_VARIABLE_NAME];
char* last_new_var = new_var;
char* last_var = var;
while ((*last_new_var = *last_var)) {
last_new_var++;
last_var++;
}
#ifdef DEBUG
if (0 && verbosity_level(+D_IC)) { // Extreme debug
printf("Word%d, var %s OR_type:\n", _word, var);
printf("exp mem: "); prt_exp_mem(exp, 0);
}
#endif
for (i = 0, l = exp->u.l; l != NULL; l = l->next, i++) {
bool lr = leading_right, ll = leading_left;
std::vector<int> er = eps_right, el = eps_left;
char* s = last_new_var;
*s++ = 'd';
fast_sprintf(s, i);
lgdebug(+D_IC, "Word%d: var: %s; exp%d=%p; X_node: %s\n",
_word, var, i, l, word_xnode ? word_xnode->word->subword : "NULL X_node");
assert(word_xnode != NULL, "NULL X_node for var %s", new_var);
if (root && parent_exp == NULL && l->e != word_xnode->exp) {
E_list *we = NULL;
if (word_xnode->exp->type == OR_type) {
for (we = word_xnode->exp->u.l; we != NULL; we = we-> next) {
if (l->e == we->e)
break;
}
}
if (we == NULL && word_xnode->next != NULL) {
lgdebug(+D_IC, "Next word_xnode for word %d is needed\n", _word);
word_xnode = word_xnode->next;
}
}
insert_connectors(l->e, dfs_position, lr, ll, er, el, new_var, false, cost, l->e, word_xnode);
if (lr)
lr_true = true;
if (ll)
ll_true = true;
}
leading_right = lr_true;
leading_left = ll_true;
}
}
}