path: root/BJC-Utils2/src/main/java/bjc/utils/parserutils/AST.java

package bjc.utils.parserutils;

import java.util.function.BinaryOperator;
import java.util.function.Consumer;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.function.UnaryOperator;

import bjc.utils.funcdata.bst.ITreePart.TreeLinearizationMethod;

/**
 * A simple binary tree meant for use as an AST
 * 
 * @author ben
 *
 * @param <T>
 *            The type of token in this AST
 */
public class AST<T> {
	private T		token;

	private AST<T>	left;
	private AST<T>	right;

	/**
	 * Create a new leaf AST node
	 * 
	 * @param tokn
	 *            The token in this node
	 */
	public AST(T tokn) {
		token = tokn;

		left = null;
		right = null;
	}

	/**
	 * Create a new AST node with the specified data and children
	 * 
	 * @param tokn
	 *            The token in this node
	 * @param lft
	 *            The left child of this AST
	 * @param rght
	 *            The right child of this AST
	 */
	public AST(T tokn, AST<T> lft, AST<T> rght) {
		token = tokn;

		left = lft;
		right = rght;
	}

	/**
	 * Traverse an AST
	 * 
	 * @param linearizationMethod
	 *            The way to traverse the tree
	 * @param action
	 *            The function to call on each traversed element
	 */
	public void traverse(TreeLinearizationMethod linearizationMethod,
			Consumer<T> action) {
		if (left != null && right != null) {
			switch (linearizationMethod) {
				case INORDER:
					left.traverse(linearizationMethod, action);
					action.accept(token);
					right.traverse(linearizationMethod, action);
					break;
				case POSTORDER:
					left.traverse(linearizationMethod, action);
					right.traverse(linearizationMethod, action);
					action.accept(token);
					break;
				case PREORDER:
					action.accept(token);
					left.traverse(linearizationMethod, action);
					right.traverse(linearizationMethod, action);
					break;
				default:
					throw new IllegalArgumentException(
							"Got a invalid tree linearizer "
									+ linearizationMethod + ". WAT");
			}
		} else {
			action.accept(token);
		}
	}

	/**
	 * Collapse this tree into a single node
	 * 
	 * @param <E>
	 *            The final value of the collapsed tree
	 * @param <T2>
	 * 
	 * @param tokenTransformer
	 *            The function to transform nodes into data
	 * @param nodeTransformer
	 *            A map of functions for operator collapsing
	 * @param resultTransformer
	 *            The function for transforming the result
	 * @return The collapsed value of the tree
	 */
	public <E, T2> E collapse(Function<T, T2> tokenTransformer,
			Function<T, BinaryOperator<T2>> nodeTransformer,
			Function<T2, E> resultTransformer) {
		return resultTransformer.apply(
				internalCollapse(tokenTransformer, nodeTransformer));
	}

	/*
	 * Internal recursive collapser
	 */
	protected <T2> T2 internalCollapse(Function<T, T2> tokenTransformer,
			Function<T, BinaryOperator<T2>> nodeTransformer) {
		if (left == null && right == null) {
			return tokenTransformer.apply(token);
		} else {
			T2 leftCollapsed;

			if (left == null) {
				leftCollapsed = null;
			} else {
				leftCollapsed = left.internalCollapse(tokenTransformer,
						nodeTransformer);
			}

			T2 rightCollapsed;
			if (right == null) {
				rightCollapsed = null;
			} else {
				rightCollapsed = right.internalCollapse(tokenTransformer,
						nodeTransformer);
			}

			return nodeTransformer.apply(token).apply(leftCollapsed,
					rightCollapsed);
		}
	}

	@Override
	public String toString() {
		StringBuilder builder = new StringBuilder();

		internalToString(builder, -1);

		return builder.toString();
	}

	/**
	 * Internal version of toString for proper rendering
	 * 
	 * @param builder
	 *            The string rendering being built
	 * @param indentLevel
	 *            The current level to indent the tree
	 */
	protected void internalToString(StringBuilder builder,
			int indentLevel) {
		indentNLevels(builder, indentLevel);

		if (left == null && right == null) {
			builder.append("Node: ");
			builder.append(token.toString());
			builder.append("\n");
		} else {
			builder.append("Node: ");
			builder.append(token.toString());
			builder.append("\n");

			if (left != null) {
				left.internalToString(builder, indentLevel + 2);
			} else {
				indentNLevels(builder, indentLevel + 2);
				builder.append("No left node\n");
			}
			if (right != null) {
				right.internalToString(builder, indentLevel + 2);
			} else {
				indentNLevels(builder, indentLevel + 2);
				builder.append("No right node\n");
			}
		}
	}

	/**
	 * Indent a string n levels
	 * 
	 * @param builder
	 *            The string to indent
	 * @param levels
	 *            The number of levels to indent
	 */
	protected static void indentNLevels(StringBuilder builder,
			int levels) {
		for (int i = 0; i <= levels; i++) {
			builder.append("\t");
		}
	}

	/**
	 * Execute a transform on selective nodes of the tree
	 * 
	 * @param transformerPredicate
	 *            The predicate to pick nodes to transform
	 * @param transformer
	 *            The thing to use to transform the nodes
	 */
	public void selectiveTransform(Predicate<T> transformerPredicate,
			UnaryOperator<T> transformer) {
		if (transformerPredicate.test(token)) {
			token = transformer.apply(token);
		}

		if (left != null) {
			left.selectiveTransform(transformerPredicate, transformer);
		}

		if (right != null) {
			right.selectiveTransform(transformerPredicate, transformer);
		}
	}

	/**
	 * Transmute the tokens in an AST into a different sort of token
	 * 
	 * @param <E>
	 *            The type of the transformed tokens
	 * 
	 * @param tokenTransformer
	 *            The transform to run on the tokens
	 * @return The AST with transformed tokens
	 */
	public <E> AST<E> transmuteAST(Function<T, E> tokenTransformer) {
		AST<E> leftBranch = null;
		AST<E> rightBranch = null;

		if (left != null) {
			leftBranch = left.transmuteAST(tokenTransformer);
		}

		if (right != null) {
			rightBranch = right.transmuteAST(tokenTransformer);
		}

		return new AST<>(tokenTransformer.apply(token), leftBranch,
				rightBranch);
	}
}