PATH:
usr
/
lib64
/
python2.7
/
lib2to3
# Copyright 2006 Google, Inc. All Rights Reserved. # Licensed to PSF under a Contributor Agreement. # A grammar to describe tree matching patterns. # Not shown here: # - 'TOKEN' stands for any token (leaf node) # - 'any' stands for any node (leaf or interior) # With 'any' we can still specify the sub-structure. # The start symbol is 'Matcher'. Matcher: Alternatives ENDMARKER Alternatives: Alternative ('|' Alternative)* Alternative: (Unit | NegatedUnit)+ Unit: [NAME '='] ( STRING [Repeater] | NAME [Details] [Repeater] | '(' Alternatives ')' [Repeater] | '[' Alternatives ']' ) NegatedUnit: 'not' (STRING | NAME [Details] | '(' Alternatives ')') Repeater: '*' | '+' | '{' NUMBER [',' NUMBER] '}' Details: '<' Alternatives '>'
[-] fixer_base.pyc
[edit]
[-] pytree.pyc
[edit]
[-] fixer_util.pyc
[edit]
[-] btm_utils.pyo
[edit]
[-] main.pyo
[edit]
[-] pytree.pyo
[edit]
[-] __init__.pyo
[edit]
[-] pygram.pyc
[edit]
[-] fixer_util.py
[edit]
[-] fixer_util.pyo
[edit]
[+]
..
[-] refactor.pyc
[edit]
[-] btm_utils.py
[edit]
[-] fixer_base.pyo
[edit]
[-] btm_utils.pyc
[edit]
[-] refactor.pyo
[edit]
[-] btm_matcher.py
[edit]
[-] __init__.pyc
[edit]
[-] main.pyc
[edit]
[-] __main__.py
[edit]
[-] fixer_base.py
[edit]
[-] __main__.pyc
[edit]
[-] pygram.pyo
[edit]
[-] pytree.py
[edit]
[-] Grammar.txt
[edit]
[-] PatternGrammar.txt
[edit]
[-] pygram.py
[edit]
[-] main.py
[edit]
[-] btm_matcher.pyc
[edit]
[-] refactor.py
[edit]
[-] patcomp.pyo
[edit]
[-] patcomp.pyc
[edit]
[-] Grammar2.7.5.final.0.pickle
[edit]
[-] __main__.pyo
[edit]
[-] __init__.py
[edit]
[+]
pgen2
[-] PatternGrammar2.7.5.final.0.pickle
[edit]
[-] btm_matcher.pyo
[edit]
[+]
fixes
[-] patcomp.py
[edit]