void print_ParseExpNode( ParseExpNode *n ) { if ( !n ) return; switch ( n->connective) { case AD: printf("(+ "); print_ParseExpNode( n->leftson ); print_ParseExpNode( n->rightson ); printf(")"); break; case SU: printf("(- "); print_ParseExpNode( n->leftson ); print_ParseExpNode( n->rightson ); printf(")"); break; case MU: printf("(* "); print_ParseExpNode( n->leftson ); print_ParseExpNode( n->rightson ); printf(")"); break; case DI: printf("(/ "); print_ParseExpNode( n->leftson ); print_ParseExpNode( n->rightson ); printf(")"); break; case MINUS: printf("(- "); print_ParseExpNode( n->leftson ); printf(")"); break; case NUMBER: printf("%s", n->atom->item); break; case FHEAD: printf("("); print_hidden_TokenList(n->atom, " "); printf(")"); break; default: printf("\n\nprint Parseexpnode: wrong specifier %d", n->connective); } }
void print_PlNode( PlNode *plnode, int indent ) { PlNode *i_son; if ( !plnode ) { printf("none\n"); return; } switch (plnode->connective) { case ALL: printf("ALL %s : %s\n", plnode->atom->item, plnode->atom->next->item); print_indent(indent); printf("( "); print_PlNode(plnode->sons,indent+4); print_indent(indent); printf(")\n"); break; case EX: printf("EX %s : %s\n", plnode->atom->item, plnode->atom->next->item); print_indent(indent); printf("( "); print_PlNode(plnode->sons,indent+4); print_indent(indent); printf(")\n"); break; case AND: printf("A( "); print_PlNode(plnode->sons, indent+4); if ( plnode->sons ) { for ( i_son = plnode->sons->next; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("AND "); print_PlNode(i_son,indent+4); } } print_indent(indent); printf(")\n"); break; case OR: printf("O( "); print_PlNode(plnode->sons, indent+4); for ( i_son = plnode->sons->next; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("OR "); print_PlNode(i_son,indent+4); } print_indent(indent); printf(")\n"); break; case WHEN: printf("IF "); print_PlNode(plnode->sons,indent+5); print_indent(indent); printf("THEN "); print_PlNode(plnode->sons->next,indent+5); print_indent(indent); printf("ENDIF\n"); break; case NOT: if (ATOM==plnode->sons->connective) { printf("NOT "); print_PlNode(plnode->sons,indent+4); } else { printf("NOT("); print_PlNode(plnode->sons,indent+4); print_indent(indent+3); printf(")\n"); } break; case ATOM: printf("("); print_hidden_TokenList(plnode->atom, " "); printf(")\n"); break; case TRU: printf("(TRUE)\n"); break; case FAL: printf("(FALSE)\n"); break; case COMP: switch (plnode->comp) { case LE: printf("(< "); break; case LEQ: printf("(<= "); break; case EQ: printf("(= "); break; case GEQ: printf("(>= "); break; case GE: printf("(> "); break; default: printf("\n\nillegal comp in parse tree!\n\n"); exit( 1 ); } print_ParseExpNode( plnode->lh ); print_ParseExpNode( plnode->rh ); printf(")\n"); break; case NEF: switch (plnode->neft) { case ASSIGN: printf("(assign "); break; case SCALE_UP: printf("(scale-up "); break; case SCALE_DOWN: printf("(scale-down "); break; case INCREASE: printf("(increase "); break; case DECREASE: printf("(decrease "); break; } print_ParseExpNode( plnode->lh ); print_ParseExpNode( plnode->rh ); printf(")\n"); break; default: printf("\n***** ERROR ****"); printf("\nprint_plnode: %d > Wrong Node specifier\n", plnode->connective); exit(1); } }
void print_PlNode( PlNode *plnode, int indent ) { PlNode *i_son; if ( !plnode ) { printf("none\n"); return; } switch (plnode->connective) { case ALL: printf("ALL %s : %s\n", plnode->atom->item, plnode->atom->next->item); print_indent(indent); printf("( "); print_PlNode(plnode->sons,indent+4); print_indent(indent); printf(")\n"); break; case EX: printf("EX %s : %s\n", plnode->atom->item, plnode->atom->next->item); print_indent(indent); printf("( "); print_PlNode(plnode->sons,indent+4); print_indent(indent); printf(")\n"); break; case AND: printf("A( "); print_PlNode(plnode->sons, indent+4); if ( plnode->sons ) { for ( i_son = plnode->sons->next; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("AND "); print_PlNode(i_son,indent+4); } } print_indent(indent); printf(")\n"); break; case OR: printf("O( "); print_PlNode(plnode->sons, indent+4); for ( i_son = plnode->sons->next; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("OR "); print_PlNode(i_son,indent+4); } print_indent(indent); printf(")\n"); break; case ONEOF: printf("O( "); print_PlNode(plnode->sons, indent+4); for ( i_son = plnode->sons->next; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("XOR "); print_PlNode(i_son,indent+4); } print_indent(indent); printf(")\n"); break; case MULTI: printf("M( "); print_PlNode(plnode->sons, indent+4); for ( i_son = plnode->sons->next; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("MUL "); print_PlNode(i_son,indent+4); } print_indent(indent); printf(")\n"); break; case WHEN: printf("IF (%lf) ", plnode->eff_p); print_PlNode(plnode->sons,indent+5); print_indent(indent); printf("THEN "); print_PlNode(plnode->sons->next,indent+5); print_indent(indent); printf("ENDIF\n"); break; case NOT: if (ATOM==plnode->sons->connective) { printf("NOT "); print_PlNode(plnode->sons,indent+4); } else { printf("NOT("); print_PlNode(plnode->sons,indent+4); print_indent(indent+3); printf(")\n"); } break; case UNKNOWN: printf("UNKNOWN "); print_PlNode(plnode->sons,indent+4); break; case CPT: printf("CPT ("); print_hidden_TokenList(plnode->atom, " "); printf(") %f", plnode->cpt_p); printf("\nA("); for ( i_son = plnode->sons; i_son!=NULL; i_son = i_son->next ) { print_indent(indent); printf("CPTA "); print_PlNode(i_son,indent+4); } print_indent(indent); printf(")\n"); break; case ATOM: printf("("); print_hidden_TokenList(plnode->atom, " "); printf(")\n"); break; case TRU: printf("(TRUE)\n"); break; case FAL: printf("(FALSE)\n"); break; default: printf("\n***** ERROR ****"); printf("\nprint_plnode: %d > Wrong Node specifier\n", plnode->connective); exit(1); } }