def __init__(self, debug_parser=PARSER_DEFAULT_DEBUG):

super(Python26Parser, self).__init__(debug_parser)

self.customized = {}

def p_try_except26(self, args):

"""

# In contrast to Python 2.7, Python 2.6 has a lot of

# POP_TOP's which come right after various jumps.

# The COME_FROM instructions our scanner adds, here it is to assist

# distinguishing the extraneous POP_TOPs from those that start

# after one of these jumps

def p_jumps26(self, args):

"""

def p_stmt26(self, args):

"""

def p_comp26(self, args):

'''

def p_ret26(self, args):

'''

def p_except26(self, args):

"""

def p_misc26(self, args):

"""

def customize_grammar_rules(self, tokens, customize):

self.remove_rules("""

""")

super(Python26Parser, self).customize_grammar_rules(tokens, customize)

if self.version >= 2.6:

self.check_reduce['and'] = 'AST'

self.check_reduce['assert_expr_and'] = 'AST'

self.check_reduce['list_for'] = 'AST'

self.check_reduce['try_except'] = 'tokens'

self.check_reduce['tryelsestmt'] = 'AST'

def reduce_is_invalid(self, rule, ast, tokens, first, last):

invalid = super(Python26Parser,

self).reduce_is_invalid(rule, ast,

tokens, first, last)

if invalid or tokens is None:

return invalid

if rule in (

('and', ('expr', 'jmp_false', 'expr', '\\e_come_from_opt')),

('and', ('expr', 'jmp_false', 'expr', 'come_from_opt')),

('assert_expr_and', ('assert_expr', 'jmp_false', 'expr'))

):

# FIXME: workaround profiling bug

if ast[1] is None:

return False

# For now, we won't let the 2nd 'expr' be a "conditional_not"

# However in < 2.6 where we don't have if/else expression it *can*

# be.

if self.version >= 2.6 and ast[2][0] == 'conditional_not':

return True

test_index = last

while tokens[test_index].kind == 'COME_FROM':

test_index += 1

if tokens[test_index].kind.startswith('JUMP_IF'):

return False

# Test that jmp_false jumps to the end of "and"

# or that it jumps to the same place as the end of "and"

jmp_false = ast[1][0]

jmp_target = jmp_false.offset + jmp_false.attr + 3

return not (jmp_target == tokens[test_index].offset or

tokens[last].pattr == jmp_false.pattr)

elif rule == (

'list_for',

('expr', 'for_iter', 'store', 'list_iter',

'JUMP_ABSOLUTE', 'come_froms', 'POP_TOP', 'jb_pop')):

# The JUMP_ABSOLUTE has to be to the last POP_TOP or this is invalid

ja_attr = ast[4].attr

return tokens[last].offset != ja_attr

elif rule[0] == 'try_except':

# We need to distingush try_except from tryelsestmt and we do that

# by checking the jump before the END_FINALLY

# If we have:

# insn

# POP_TOP

# END_FINALLY

# COME_FROM

# then insn has to be either a JUMP_FORWARD or a RETURN_VALUE

# and if it is JUMP_FORWARD, then it has to be a JUMP_FORWARD to right after

# COME_FROM

if last == len(tokens):

last -= 1

if tokens[last] != 'COME_FROM' and tokens[last-1] == 'COME_FROM':

last -= 1

if (tokens[last] == 'COME_FROM'

and tokens[last-1] == 'END_FINALLY'

and tokens[last-2] == 'POP_TOP'):

# A jump of 2 is a jump around POP_TOP, END_FINALLY which

# would indicate try/else rather than try

return (tokens[last-3].kind not in frozenset(('JUMP_FORWARD', 'RETURN_VALUE'))

or (tokens[last-3] == 'JUMP_FORWARD' and tokens[last-3].attr != 2))

elif rule[0] == 'tryelsestmt':

# We need to distingush try_except from tryelsestmt and we do that

# by making sure that the jump before the except handler jumps to

# code somewhere before the end of the construct.

# This AST method is slower, but the token-only based approach

# didn't work as it failed with a "try" embedded inside a "try/else"

# since we can't detect COME_FROM boundaries.

if ast[3] == 'except_handler':

except_handler = ast[3]

if except_handler[0] == 'JUMP_FORWARD':

else_start = int(except_handler[0].pattr)

if last == len(tokens):

last -= 1

if tokens[last] == 'COME_FROM' and isinstance:

last_offset = int(tokens[last].offset.split('_')[0])

return else_start >= last_offset

# The above test apparently isn't good enough, so we have additional

# checks distinguish try_except from tryelsestmt and we do that

# by checking the jump before the END_FINALLY

# If we have:

# insn

# POP_TOP

# END_FINALLY

# COME_FROM

# then insn is neither a JUMP_FORWARD nor RETURN_VALUE,

# or if it is JUMP_FORWARD, then it can't be a JUMP_FORWARD to right after

# COME_FROM

if last == len(tokens):

last -= 1

while tokens[last-1] == 'COME_FROM' and tokens[last-2] == 'COME_FROM':

last -= 1

if tokens[last] == 'COME_FROM' and tokens[last-1] == 'COME_FROM':

last -= 1

if (tokens[last] == 'COME_FROM'

and tokens[last-1] == 'END_FINALLY'

and tokens[last-2] == 'POP_TOP'):

# A jump of 2 is a jump around POP_TOP, END_FINALLY which

# would indicate try/else rather than try

return (tokens[last-3].kind in frozenset(('JUMP_FORWARD', 'RETURN_VALUE'))

and (tokens[last-3] != 'JUMP_FORWARD' or tokens[last-3].attr == 2))