Gecko [ nbspublicschool.com ]

Name	Size	Permission
__init__.py	2.83 KB	-rw-r--r--
__init__.pyc	2.76 KB	-rw-r--r--
__init__.pyo	2.76 KB	-rw-r--r--
_ast_gen.py	8.46 KB	-rw-r--r--
_ast_gen.pyc	9.14 KB	-rw-r--r--
_ast_gen.pyo	9.14 KB	-rw-r--r--
_build_tables.py	851 B	-rw-r--r--
_build_tables.pyc	637 B	-rw-r--r--
_build_tables.pyo	637 B	-rw-r--r--
_c_ast.cfg	4.08 KB	-rw-r--r--
ast_transforms.py	3.48 KB	-rw-r--r--
ast_transforms.pyc	2.74 KB	-rw-r--r--
ast_transforms.pyo	2.68 KB	-rw-r--r--
c_ast.py	22.79 KB	-rw-r--r--
c_ast.pyc	38.74 KB	-rw-r--r--
c_ast.pyo	38.74 KB	-rw-r--r--
c_generator.py	13.25 KB	-rw-r--r--
c_generator.pyc	18.44 KB	-rw-r--r--
c_generator.pyo	18.44 KB	-rw-r--r--
c_lexer.py	14.11 KB	-rw-r--r--
c_lexer.pyc	15.01 KB	-rw-r--r--
c_lexer.pyo	15.01 KB	-rw-r--r--
c_parser.py	60.75 KB	-rw-r--r--
c_parser.pyc	62.59 KB	-rw-r--r--
c_parser.pyo	62.43 KB	-rw-r--r--
lextab.py	7.28 KB	-rw-r--r--
lextab.pyc	6.94 KB	-rw-r--r--
lextab.pyo	6.94 KB	-rw-r--r--
plyparser.py	1.56 KB	-rw-r--r--
plyparser.pyc	2.59 KB	-rw-r--r--
plyparser.pyo	2.59 KB	-rw-r--r--
yacctab.py	126.53 KB	-rw-r--r--
yacctab.pyc	99.45 KB	-rw-r--r--
yacctab.pyo	99.45 KB	-rw-r--r--

Code Editor : ast_transforms.pyc

�
g�wUc�����������@���s&���d��d�l��m�Z�d����Z�d����Z�d�S(���i���(���t���c_astc���������C���s����t��|��t�j���s�t���t��|��j�t�j���s1�|��St�j�g��|��j�j���}�d�}�x��|��j�j�D]��}�t��|�t�j	�t�j
�f���r��|�j�j�|���t�|�|�j���|�j�d�}�q\�|�d�k�r��|�j�j�|���q\�|�j
�j�|���q\�W|�|��_�|��S(���s��� The 'case' statements in a 'switch' come out of parsing with one
        child node, so subsequent statements are just tucked to the parent
        Compound. Additionally, consecutive (fall-through) case statements
        come out messy. This is a peculiarity of the C grammar. The following:

switch (myvar) {
                case 10:
                    k = 10;
                    p = k + 1;
                    return 10;
                case 20:
                case 30:
                    return 20;
                default:
                    break;
            }

Creates this tree (pseudo-dump):

Switch
                ID: myvar
                Compound:
                    Case 10:
                        k = 10
                    p = k + 1
                    return 10
                    Case 20:
                        Case 30:
                            return 20
                    Default:
                        break

The goal of this transform it to fix this mess, turning it into the
        following:

Switch
                ID: myvar
                Compound:
                    Case 10:
                        k = 10
                        p = k + 1
                        return 10
                    Case 20:
                    Case 30:
                        return 20
                    Default:
                        break

A fixed AST node is returned. The argument may be modified.
    i����N(���t
���isinstanceR����t���Switcht���AssertionErrort���stmtt���Compoundt���coordt���Nonet���block_itemst���Caset���Defaultt���appendt���_extract_nested_caset���stmts(���t���switch_nodet���new_compoundt	���last_caset���child(����(����s<���/usr/lib/python2.7/site-packages/pycparser/ast_transforms.pyt���fix_switch_cases
���s����3	c���������C���sP���t��|��j�d�t�j�t�j�f���rL�|�j�|��j�j������t�|�d�|���n��d�S(���s���� Recursively extract consecutive Case statements that are made nested
        by the parser and add them to the stmts_list.
    i����i����N(���R���R
���R����R	���R
���R���t���popR���(���t	���case_nodet
���stmts_list(����(����s<���/usr/lib/python2.7/site-packages/pycparser/ast_transforms.pyR���b���s����"N(���t����R����R���R���(����(����(����s<���/usr/lib/python2.7/site-packages/pycparser/ast_transforms.pyt���<module>
���s���	U

${this.title}

Code Editor : ast_transforms.pyc