//MENORMAYOR
	Node* bMENORMAYORNode(Node* n1, Node* n2){
		Node* n = new MenorMayorNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//DMENORIGUAL
	Node* bDMENORIGUALNode(Node* n1, Node* n2){
		Node* n = new DMenorIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//DASTIGUAL
	Node* bDASTIGUALNode(Node* n1, Node* n2){
		Node* n = new DAstIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//PIPEIGUAL
	Node* bPIPEIGUALNode(Node* n1, Node* n2){
		Node* n = new PipeIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//CIRCIGUAL
	Node* bCIRCIGUALNode(Node* n1, Node* n2){
		Node* n = new CircIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//MEIGUAL
	Node* bMENIGNode(Node* n1, Node* n2){
		Node* n = new MenIgNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//AMPIGUAL
	Node* bAMPIGUALNode(Node* n1, Node* n2){
		Node* n = new AmpIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//MENOSIGUAL
	Node* bMENOSIGUALNode(Node* n1, Node* n2){
		Node* n = new MenosIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
//DDIAIGUAL
	Node* bDDIAIGUALNode(Node* n1, Node* n2){
		Node* n = new DDiaIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #10
0
//MENOS
	Node* bMENOSNode(Node* n1, Node* n2){
		Node* n = new MenosNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #11
0
//MAS
	Node* bMASNode(Node* n1, Node* n2){
		Node* n = new MasNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #12
0
//ASTERISCO
	Node* bPORNode(Node* n1, Node* n2){
		Node* n = new PorNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #13
0
//DASTERISCO
	Node* bDASTERISTICOSNode(Node* n1, Node* n2){
		Node* n = new DAsteriscosNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #14
0
//DIAG
	Node* bDIVNode(Node* n1, Node* n2){
		Node* n = new DivNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #15
0
//WHILE
	Node* bWHILENode(Node* n1, Node* n2){
		Node* n = new WhileNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #16
0
//PORIGUAL
	Node* bPORIGUALNode(Node* n1, Node* n2){
		Node* n = new PorIgualNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #17
0
//AND 
	Node* bANDNode(Node* n1, Node* n2){
		Node* n = new AndNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}
Example #18
0
//MAIGUAL
	Node* bMAYIGNode(Node* n1, Node* n2){
		Node* n = new MayIgNode;
		n->setFChild(n1);
		n->setSChild(n2);
		return n;
	}