5 enum { PARSER_SHIFT, PARSER_REDUCE, PARSER_ACCEPT };
29 transition_t* transition_shift_new (gint state)
31 transition_t* transition;
32 transition = g_malloc (sizeof (transition_t));
33 transition->action = PARSER_SHIFT;
34 transition->state = state;
35 transition->left = NULL;
36 transition->right = NULL;
40 transition_t* transition_reduce_new (symbol_t* left, rule_t* right)
42 transition_t* transition;
43 transition = g_malloc (sizeof (transition_t));
44 transition->action = PARSER_REDUCE;
45 transition->state = 0;
46 transition->left = left;
47 transition->right = right;
51 transition_t* transition_accept_new ()
53 transition_t* transition;
54 transition = g_malloc (sizeof (transition_t));
55 transition->action = PARSER_ACCEPT;
56 transition->state = 0;
57 transition->left = NULL;
58 transition->right = NULL;
62 void transition_delete (transition_t* transition)
64 if (transition->left != NULL)
65 g_free (transition->left);
66 if (transition->right != NULL)
67 rule_delete (transition->right);
71 void lr1_push (lr1_t* parser, gint st, gpointer attrib)
74 state = g_malloc (sizeof (state_t));
76 state->attrib = attrib;
77 parser->stack = g_list_prepend (parser->stack, state);
80 static gboolean lr1_pop (lr1_t* parser, gpointer* attrib)
85 if ((l = g_list_first (parser->stack)) == NULL)
87 parser->stack = g_list_remove_link (l, l);
88 state = (state_t*) l->data;
90 *attrib = state->attrib;
97 lr1_t* lr1_new (nextcb cb, gpointer data)
102 parser = g_malloc (sizeof (lr1_t));
106 parser->stack = NULL;
107 parser->table = g_hash_table_new_full (g_direct_hash, g_direct_equal,
108 NULL, g_hash_table_destroy);
114 void lr1_delete (lr1_t* parser)
119 for (l = g_list_first (parser->stack); l != NULL; l = g_list_next (l))
124 g_list_free (parser->stack);
126 g_hash_table_destroy (parser->table);
132 gboolean lr1_add (lr1_t* parser, gint state, symbol_t* symbol,
133 transition_t* transition)
138 if (!g_hash_table_lookup_extended (parser->table, GINT_TO_POINTER(state),
139 NULL, (gpointer*) &table))
141 table = g_hash_table_new_full (symbol_hash, symbol_equal,
142 g_free, transition_delete);
143 g_hash_table_insert (parser->table, GINT_TO_POINTER(state), table);
146 if (g_hash_table_lookup_extended (table, symbol, NULL, NULL))
151 g_hash_table_insert (table, symbol, transition);
156 gboolean lr1_lookup (lr1_t* parser, gint state, symbol_t* symbol,
157 transition_t** transition)
163 if (!g_hash_table_lookup_extended (parser->table, GINT_TO_POINTER(state),
164 NULL, (gpointer*) &table))
169 if (!g_hash_table_lookup_extended (table, symbol,
170 NULL, (gpointer*) &trans))
182 static gpointer leaf_new (gpointer data)
184 return g_node_new (data);
187 static gpointer tree_new (rule_t* rule)
189 return g_node_new (rule);
192 static gpointer tree_add (gpointer tree, gpointer data)
194 return g_node_prepend (tree, data);
197 gpointer lr1_build (lr1_t* parser)
202 transition_t* transition;
206 symbol = g_malloc (sizeof (symbol_t));
208 symbol->value = parser->cb (parser->data, &attrib);
209 symbol->terminal = TRUE;
214 l = g_list_first (parser->stack);
215 state = (state_t*) l->data;
216 if (!lr1_lookup (parser, state->state, symbol, &transition))
219 if (transition->action == PARSER_SHIFT)
222 lr1_push (parser, transition->state, leaf_new (attrib));
223 symbol->value = parser->cb (parser->data, &attrib);
224 symbol->terminal = TRUE;
227 else if (transition->action == PARSER_REDUCE)
235 attrib = tree_new (symbol_copy (transition->left));
237 for (l = grammar_get_rule (transition->right);
242 if (!lr1_pop (parser, &attr))
244 tree_add (attrib, attr);
247 l = g_list_first (parser->stack);
248 state = (state_t*) l->data;
249 lr1_lookup (parser, state->state, transition->left, &trans);
250 lr1_push (parser, trans->state, attrib);
254 else if (transition->action == PARSER_ACCEPT)
256 l = g_list_first (parser->stack);
257 state = (state_t*) l->data;
258 return state->attrib;