from node import Leaf

def generate_line(root):
    """
    Print an expression tree in a single text line. Where needed, add
    parentheses.

    >>> from node import Node, Leaf
    >>> l0, l1 = Leaf(1), Leaf(2)
    >>> plus = Node('+', l0, l1)
    >>> print generate_line(plus)
    1 + 2

    >>> plus2 = Node('+', l0, l1)
    >>> times = Node('*', plus, plus2)
    >>> print generate_line(times)
    (1 + 2) * (1 + 2)

    >>> l2 = Leaf(3)
    >>> uminus = Node('-', l2)
    >>> times = Node('*', plus, uminus)
    >>> print generate_line(times)
    (1 + 2) * -3

    >>> exp = Leaf('x')
    >>> inf = Leaf('oo')
    >>> minus_inf = Node('-', inf)
    >>> integral = Node('int', exp, minus_inf, inf)
    >>> print generate_line(integral)
    int(x, -oo, oo)
    """

    operators = [
            ('+', '-'),
            ('*', '/', 'mod'),
            ('^', )
            ]
    max_assoc = len(operators)

    def is_operator(node):
        """
        Check if a given node is an operator (otherwise, it's a function).
        """
        label = node.title()
        either = lambda a, b: a or b

        return reduce(either, map(lambda x: label in x, operators))

    def assoc(node):
        """
        Get the associativity of an operator node.
        """
        # Check binary and n-ary operators
        if not isinstance(node, Leaf) and len(node) > 1:
            op = node.title()

            for i, group in enumerate(operators):
                if op in group:
                    return i

        # Unary operator and leaves have highest precedence
        return max_assoc

    def traverse(node):
        """
        The expression tree is traversed using preorder traversal:
        1. Visit the root
        2. Traverse the subtrees in left-to-right order
        """
        if not node:
            return '<empty expression>'

        s = node.title()

        if not node.nodes:
            return s

        arity = len(node)

        if is_operator(node):
            if arity == 1:
                # Unary operator
                s += traverse(node[0])
            else:
                # N-ary operator
                node_assoc = assoc(node)
                e = []

                for child in node:
                    exp = traverse(child)

                    # Check if there is an precedence conflict.
                    # If so, add parentheses
                    if assoc(child) < node_assoc:
                        exp = '(' + exp + ')'

                    e.append(exp)

                s = (' ' + s + ' ').join(e)
        else:
            # Function
            s += '(' + ', '.join(map(traverse, node)) + ')'

        return s

    return traverse(root)