private void populateNodes() {
		if (andList != null && andList.size() > 0 && orList != null && orList.size() > 0) {
			return;
		}
		
		if (currentNode != null && currentNode.children != null && currentNode.children.length == 3) {
			SimpleNode left = (SimpleNode) currentNode.children[0];
			SimpleNode right = (SimpleNode) currentNode.children[2];
			SimpleNode op = (SimpleNode) currentNode.children[1];
			
//			TreeOperand l = new TreeOperand(left);
//			TreeOperand r = new TreeOperand(right);
//			expression = new BasicExpression(l, r, op.id);
		}
	}