Lines Matching defs:tree
1087 /* Inserts a catenation node to the root of the tree given in `node'.
1118 /* Inserts a catenation node to the root of the tree given in `node'.
1186 /* Adds tags to appropriate locations in the parse tree in `tree', so that
1189 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree,
1194 tre_ast_node_t *node = tree; /* Tree node we are currently looking at. */
1647 assert(tree->num_tags == num_tags);
2135 /* Walk through the tree recursively. */
2228 the nodes of the AST `tree'. */
2230 tre_compute_nfl(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree)
2234 STACK_PUSHR(stack, voidptr, tree);
2605 /* Converts the syntax tree to a TNFA. All the transitions in the TNFA are
2680 tre_ast_node_t *tree, *tmp_ast_l, *tmp_ast_r;
2718 tree = parse_ctx.n;
2721 tre_ast_print(tree);
2742 errcode = tre_add_tags(NULL, stack, tree, tnfa);
2767 errcode = tre_add_tags(mem, stack, tree, tnfa);
2774 errcode = tre_expand_ast(mem, stack, tree, &parse_ctx.position,
2783 tmp_ast_l = tree;
2788 tree = tre_ast_new_catenation(mem, tmp_ast_l, tmp_ast_r);
2789 if (tree == NULL)
2792 errcode = tre_compute_nfl(mem, stack, tree);
2806 tre_ast_to_tnfa(tree, NULL, counts, NULL);
2821 errcode = tre_ast_to_tnfa(tree, transitions, counts, offs);
2827 p = tree->firstpos;
2841 for (p = tree->firstpos; p->position >= 0; p++)
2863 tnfa->final = transitions + offs[tree->lastpos[0].position];