__all__ = ['Automaton']

from parser import parser
from itertools import ifilter, chain
from stack import stack
#from lr import kernel
from tokenizer import token_line_col

INITIAL_TOKEN = ('#', '#', 0)


class Automaton(parser):
    """A GLR parser."""

    def __init__(self, start_sym, grammar, scanner):
        """Construct a GLR automaton given an LR grammar and a start symbol.
        The scanner that creates the automaton input is also provided for
        convenience of use."""
        parser.__init__(self, start_sym, grammar, scanner.tokens.keys())
        self.scanner = scanner
        self.debug = False

    def validate_ast(self, ast):
        """Overload this method in subclasses to discriminate semantically
        invalid ASTs on the fly.
        Return None for an invalid AST, or whatever you want to end up in the
        resulting AST.
        """
        return ast

    def error_detected(self, text, cur_tok, last_states):
        """Overload this method in subclasses to implement error recovery
        or notification.
        """
        line, column = token_line_col(text, cur_tok)
        print "Error detected at line %i, column %i:" % (line, column)
        lines = text.splitlines()
        #print "text"
        #print '\n'.join("%5i: %s" % x for x in enumerate(lines))
        #print "line", line
        if lines:
            if len(lines) > (line - 1):
                print lines[line - 1]
                print '%s^' % (''.join(c == '\t' and '\t' or ' '
                                       for c in lines[line -1][:column - 1]))
            else:
                print "at end of text"
        #for st in last_states:
        #    print self.itemsetstr(kernel(self.LR0[st.data]))
        #    print "Expected", ', '.join(kw
        #                                for kw in self.kw_set
        #                                if len(self.ACTION[st.data][kw]) > 0)
        A = self.ACTION
        toks = set(kw for st in last_states for kw in self.kw_set
                       if len(A[st.data][kw]) > 0
                          and kw not in self.R and kw != '$')
        print "Got", cur_tok
        if not toks:
            print "Expected end of text"
        else:
            print "Expected token%s" % (len(toks) > 1 and 's' or ''),
            print ', '.join(toks)
        if self.debug:
            rules = set(kw for st in last_states for kw in self.kw_set
                            if len(A[st.data][kw]) > 0 and kw in self.R)
            print "Expected rules", ', '.join(rules)
        return False

    def __recognize(self, text, token_stream):
        """Runs the automaton over an input stream of tokens. For use with the
        output of a Scanner instance. The last token MUST be
        ('$', '$', length_of_text)."""
        S = stack(self)
        #toki = iter(token_stream)
        S.shift(None, None, 0)
        S.count_active = 1
        prev_tok = INITIAL_TOKEN
        for cur_tok in token_stream:
            if len(S.active) == 0:
                if not self.error_detected(text, prev_tok,
                                           S.previously_active):
                    break
                else:
                    continue
            prev_tok = cur_tok
            #print "pre reduce", S.active
            # Reduce phase
            for i, node in S.enumerate_active():  # S.active may grow
                state = node.data
                for r, rule in ifilter(lambda x: x[0] == 'R',
                                       self.ACTION[state][cur_tok[0]]):
                    #print "R", i, len(S.active), node
                    S.reduce(node, rule)
                i += 1
            # Check if there are accepting states, and return their outputs
            if cur_tok[0] == '$':
                acc = S.accepts()
                if acc:
                    return acc
                else:
                    self.error_detected(text, cur_tok, S.active)
            #print "pre shift", S.active
            # Shift phase
            S.count_active = len(S.active)
            for node in (S.active[i] for i in xrange(len(S.active))):
                state = node.data
                for r, state in ifilter(lambda x: x[0] == 'S',
                                       self.ACTION[state][cur_tok[0]]):
                    S.shift(node, (cur_tok,), state)
            #print "pre merge", S.active
            # Merge states
            S.merge()
            # A little bit of feedback
            if self.debug:
                print "On token", cur_tok
                S.dump()
        return None

    def __call__(self, text):
        """Parse this text and return a list of valid ASTs, if any. On error,
        returns None."""
        return self.__recognize(text, chain(self.scanner(text),
                                            [('$', '$', len(text))]))
