2 * Copyright 2005 Thadeu Lima de Souza Cascardo
6 * Translate a grammar to a DFA table, if it is possible, i.e., it's a
7 * regular grammar and has no non-determinism.
14 void dfa_gen_add (gpointer key, gpointer val, gpointer data)
22 left = (symbol_t*) key;
23 right = (rule_t*) val;
28 dfa_t* dfa_gen (grammar_t* grammar, symbol_t* start, nextcb cb, gpointer data)
33 dfa = dfa_new (cb, data, dfa_state_new (start->value, FALSE));
35 g_hash_table_foreach (grammar->grammar, dfa_gen_add, dfa);