Lines Matching refs:tree
37 /* Inserts a catenation node to the root of the tree given in `node'.
69 /* Inserts a catenation node to the root of the tree given in `node'.
141 /* Adds tags to appropriate locations in the parse tree in `tree', so that
144 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree,
149 tre_ast_node_t *node = tree; /* Tree node we are currently looking at. */
632 assert(tree->num_tags == num_tags);
1217 /* Walk through the tree recursively. */
1317 the nodes of the AST `tree'. */
1319 tre_compute_nfl(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree)
1323 STACK_PUSHR(stack, voidptr, tree);
1783 /* Converts the syntax tree to a TNFA. All the transitions in the TNFA are
1858 tre_ast_node_t *tree, *tmp_ast_l, *tmp_ast_r;
1898 tree = parse_ctx.result;
1906 tre_ast_print(tree);
1928 errcode = tre_add_tags(NULL, stack, tree, tnfa);
1932 tre_ast_print(tree);
1956 errcode = tre_add_tags(mem, stack, tree, tnfa);
1972 errcode = tre_expand_ast(mem, stack, tree, &parse_ctx.position,
1981 tmp_ast_l = tree;
1986 tree = tre_ast_new_catenation(mem, tmp_ast_l, tmp_ast_r);
1987 if (tree == NULL)
1991 tre_ast_print(tree);
1995 errcode = tre_compute_nfl(mem, stack, tree);
2009 tre_ast_to_tnfa(tree, NULL, counts, NULL);
2025 errcode = tre_ast_to_tnfa(tree, transitions, counts, offs);
2040 for (p = tree->firstpos; p->position >= 0; p++)
2076 p = tree->firstpos;
2118 for (p = tree->firstpos; p->position >= 0; p++)
2149 tnfa->final = transitions + offs[tree->lastpos[0].position];