static fsg_model_t *
jsgf_build_fsg_internal(jsgf_t * grammar, jsgf_rule_t * rule,
logmath_t * lmath, float32 lw, int do_closure)
{
fsg_model_t *fsg;
glist_t nulls;
gnode_t *gn;
int rule_entry, rule_exit;
/* Clear previous links */
for (gn = grammar->links; gn; gn = gnode_next(gn)) {
ckd_free(gnode_ptr(gn));
}
glist_free(grammar->links);
grammar->links = NULL;
grammar->nstate = 0;
/* Create the top-level entry state, and expand the
top-level rule. */
rule_entry = grammar->nstate++;
rule_exit = expand_rule(grammar, rule, rule_entry, NO_NODE);
/* If no exit-state was created, create one. */
if (rule_exit == NO_NODE) {
rule_exit = grammar->nstate++;
jsgf_add_link(grammar, NULL, rule_entry, rule_exit);
}
fsg = fsg_model_init(rule->name, lmath, lw, grammar->nstate);
fsg->start_state = rule_entry;
fsg->final_state = rule_exit;
grammar->links = glist_reverse(grammar->links);
for (gn = grammar->links; gn; gn = gnode_next(gn)) {
jsgf_link_t *link = gnode_ptr(gn);
if (link->atom) {
if (jsgf_atom_is_rule(link->atom)) {
fsg_model_null_trans_add(fsg, link->from, link->to,
logmath_log(lmath,
link->atom->weight));
}
else {
int wid = fsg_model_word_add(fsg, link->atom->name);
fsg_model_trans_add(fsg, link->from, link->to,
logmath_log(lmath, link->atom->weight),
wid);
}
}
else {
fsg_model_null_trans_add(fsg, link->from, link->to, 0);
}
}
if (do_closure) {
nulls = fsg_model_null_trans_closure(fsg, NULL);
glist_free(nulls);
}
return fsg;
}
static fsg_model_t *
jsgf_build_fsg_internal(jsgf_t *grammar, jsgf_rule_t *rule,
logmath_t *lmath, float32 lw, int do_closure)
{
fsg_model_t *fsg;
glist_t nulls;
gnode_t *gn;
/* Clear previous links */
for (gn = grammar->links; gn; gn = gnode_next(gn)) {
ckd_free(gnode_ptr(gn));
}
glist_free(grammar->links);
grammar->links = NULL;
rule->entry = rule->exit = 0;
grammar->nstate = 0;
expand_rule(grammar, rule);
fsg = fsg_model_init(rule->name, lmath, lw, grammar->nstate);
fsg->start_state = rule->entry;
fsg->final_state = rule->exit;
grammar->links = glist_reverse(grammar->links);
for (gn = grammar->links; gn; gn = gnode_next(gn)) {
jsgf_link_t *link = gnode_ptr(gn);
if (link->atom) {
if (jsgf_atom_is_rule(link->atom)) {
fsg_model_null_trans_add(fsg, link->from, link->to,
logmath_log(lmath, link->atom->weight));
}
else {
int wid = fsg_model_word_add(fsg, link->atom->name);
fsg_model_trans_add(fsg, link->from, link->to,
logmath_log(lmath, link->atom->weight), wid);
}
}
else {
fsg_model_null_trans_add(fsg, link->from, link->to, 0);
}
}
if (do_closure) {
nulls = fsg_model_null_trans_closure(fsg, NULL);
glist_free(nulls);
}
return fsg;
}
static int
expand_rhs(jsgf_t *grammar, jsgf_rule_t *rule, jsgf_rhs_t *rhs)
{
gnode_t *gn;
int lastnode;
/* Last node expanded in this sequence. */
lastnode = rule->entry;
/* Iterate over atoms in rhs and generate links/nodes */
for (gn = rhs->atoms; gn; gn = gnode_next(gn)) {
jsgf_atom_t *atom = gnode_ptr(gn);
if (jsgf_atom_is_rule(atom)) {
jsgf_rule_t *subrule;
char *fullname;
gnode_t *subnode;
void *val;
/* Special case for <NULL> and <VOID> pseudo-rules */
if (0 == strcmp(atom->name, "<NULL>")) {
/* Emit a NULL transition */
jsgf_add_link(grammar, atom,
lastnode, grammar->nstate);
lastnode = grammar->nstate;
++grammar->nstate;
continue;
}
else if (0 == strcmp(atom->name, "<VOID>")) {
/* Make this entire RHS unspeakable */
return -1;
}
fullname = jsgf_fullname_from_rule(rule, atom->name);
if (hash_table_lookup(grammar->rules, fullname, &val) == -1) {
E_ERROR("Undefined rule in RHS: %s\n", fullname);
ckd_free(fullname);
return -1;
}
ckd_free(fullname);
subrule = val;
/* Look for this in the stack of expanded rules */
for (subnode = grammar->rulestack; subnode; subnode = gnode_next(subnode))
if (gnode_ptr(subnode) == (void *)subrule)
break;
if (subnode != NULL) {
/* Allow right-recursion only. */
if (gnode_next(gn) != NULL) {
E_ERROR("Only right-recursion is permitted (in %s.%s)\n",
grammar->name, rule->name);
return -1;
}
/* Add a link back to the beginning of this rule instance */
E_INFO("Right recursion %s %d => %d\n", atom->name, lastnode, subrule->entry);
jsgf_add_link(grammar, atom, lastnode, subrule->entry);
}
else {
/* Expand the subrule */
if (expand_rule(grammar, subrule) == -1)
return -1;
/* Add a link into the subrule. */
jsgf_add_link(grammar, atom,
lastnode, subrule->entry);
lastnode = subrule->exit;
}
}
else {
/* Add a link for this token and create a new exit node. */
jsgf_add_link(grammar, atom,
lastnode, grammar->nstate);
lastnode = grammar->nstate;
++grammar->nstate;
}
}
return lastnode;
}
/**
*
* Expand a right-hand-side of a rule (i.e. a single alternate).
*
* @returns the FSG state at the end of this rule, NO_NODE if there's an
* error, and RECURSIVE_NODE if the right-hand-side ended in right-recursion (i.e.
* a link to an earlier FSG state).
*/
static int
expand_rhs(jsgf_t * grammar, jsgf_rule_t * rule, jsgf_rhs_t * rhs,
int rule_entry, int rule_exit)
{
gnode_t *gn;
int lastnode;
/* Last node expanded in this sequence. */
lastnode = rule_entry;
/* Iterate over atoms in rhs and generate links/nodes */
for (gn = rhs->atoms; gn; gn = gnode_next(gn)) {
jsgf_atom_t *atom = gnode_ptr(gn);
if (jsgf_atom_is_rule(atom)) {
jsgf_rule_t *subrule;
char *fullname;
gnode_t *subnode;
jsgf_rule_stack_t *rule_stack_entry = NULL;
/* Special case for <NULL> and <VOID> pseudo-rules
If this is the only atom in the rhs, and it's the
first rhs in the rule, then emit a null transition,
creating an exit state if needed. */
if (0 == strcmp(atom->name, "<NULL>")) {
if (gn == rhs->atoms && gnode_next(gn) == NULL) {
if (rule_exit == NO_NODE) {
jsgf_add_link(grammar, atom,
lastnode, grammar->nstate);
rule_exit = lastnode = grammar->nstate;
++grammar->nstate;
}
else {
jsgf_add_link(grammar, atom, lastnode, rule_exit);
}
}
continue;
}
else if (0 == strcmp(atom->name, "<VOID>")) {
/* Make this entire RHS unspeakable */
return NO_NODE;
}
fullname = jsgf_fullname_from_rule(rule, atom->name);
if (hash_table_lookup
(grammar->rules, fullname, (void **) &subrule) == -1) {
E_ERROR("Undefined rule in RHS: %s\n", fullname);
ckd_free(fullname);
return NO_NODE;
}
ckd_free(fullname);
/* Look for this subrule in the stack of expanded rules */
for (subnode = grammar->rulestack; subnode;
subnode = gnode_next(subnode)) {
rule_stack_entry =
(jsgf_rule_stack_t *) gnode_ptr(subnode);
if (rule_stack_entry->rule == subrule)
break;
}
if (subnode != NULL) {
/* Allow right-recursion only. */
if (gnode_next(gn) != NULL) {
E_ERROR
("Only right-recursion is permitted (in %s.%s)\n",
grammar->name, rule->name);
return NO_NODE;
}
/* Add a link back to the beginning of this rule instance */
E_INFO("Right recursion %s %d => %d\n", atom->name,
lastnode, rule_stack_entry->entry);
jsgf_add_link(grammar, atom, lastnode,
rule_stack_entry->entry);
/* Let our caller know that this rhs didn't reach an
end state. */
lastnode = RECURSIVE_NODE;
}
else {
/* If this is the last atom in this rhs, link its
expansion to the parent rule's exit state.
Otherwise, create a new exit state for it. */
int subruleexit = NO_NODE;
if (gnode_next(gn) == NULL && rule_exit >= 0)
subruleexit = rule_exit;
/* Expand the subrule */
lastnode =
expand_rule(grammar, subrule, lastnode, subruleexit);
if (lastnode == NO_NODE)
return NO_NODE;
}
}
else {
/* An exit-state is created if this isn't the last atom
in the rhs, or if the containing rule doesn't have an
exit state yet.
Otherwise, the rhs's exit state becomes the containing
rule's exit state. */
int exitstate;
if (gnode_next(gn) == NULL && rule_exit >= 0) {
exitstate = rule_exit;
}
else {
exitstate = grammar->nstate;
++grammar->nstate;
}
/* Add a link for this token */
jsgf_add_link(grammar, atom, lastnode, exitstate);
lastnode = exitstate;
}
}
return lastnode;
}