예제 #1
0
void astPrintTree(ASTREE *root, int level)
{
	int i;

	if (root == 0)
	{
		return;
	}
	for (i=0; i<level; ++i)
	{
		printf("  ");
	}
	astPrintSingle(root);
	for (i=0; i<MAX_SONS; ++i)
	{
		astPrintTree(root->son[i], level+1);
	}

}
예제 #2
0
void astPrintTree (ast_t* node, int level)
{
	int i = 0;
	int j = 0;

	if (!node) 
        return;

	for (j = 0; j < level; ++j) 
        fprintf(stderr, " ");

	printf("[%d]",level);

	astPrintNode(node);

	for (i = 0; i < MAX_SONS; ++i)
		if(node->son[i]) 
            astPrintTree(node->son[i], level + 1);

}