SM0 She11
Path:
/
/
usr
/
lib64
/
python2.7
/
lib2to3
Full Path (server): /usr/lib64/python2.7/lib2to3
Create Fil3
Upl04d Fil3
📄 Grammar.txt
[E]
[D]
[R]
📄 Grammar2.7.5.final.0.pickle
[E]
[D]
[R]
📄 PatternGrammar.txt
[E]
[D]
[R]
📄 PatternGrammar2.7.5.final.0.pickle
[E]
[D]
[R]
📄 __init__.py
[E]
[D]
[R]
📄 __init__.pyc
[E]
[D]
[R]
📄 __init__.pyo
[E]
[D]
[R]
📄 __main__.py
[E]
[D]
[R]
📄 __main__.pyc
[E]
[D]
[R]
📄 __main__.pyo
[E]
[D]
[R]
📄 btm_matcher.py
[E]
[D]
[R]
📄 btm_matcher.pyc
[E]
[D]
[R]
📄 btm_matcher.pyo
[E]
[D]
[R]
📄 btm_utils.py
[E]
[D]
[R]
📄 btm_utils.pyc
[E]
[D]
[R]
📄 btm_utils.pyo
[E]
[D]
[R]
📄 fixer_base.py
[E]
[D]
[R]
📄 fixer_base.pyc
[E]
[D]
[R]
📄 fixer_base.pyo
[E]
[D]
[R]
📄 fixer_util.py
[E]
[D]
[R]
📄 fixer_util.pyc
[E]
[D]
[R]
📄 fixer_util.pyo
[E]
[D]
[R]
📁 fixes
Open
[D]
[R]
📄 main.py
[E]
[D]
[R]
📄 main.pyc
[E]
[D]
[R]
📄 main.pyo
[E]
[D]
[R]
📄 patcomp.py
[E]
[D]
[R]
📄 patcomp.pyc
[E]
[D]
[R]
📄 patcomp.pyo
[E]
[D]
[R]
📁 pgen2
Open
[D]
[R]
📄 pygram.py
[E]
[D]
[R]
📄 pygram.pyc
[E]
[D]
[R]
📄 pygram.pyo
[E]
[D]
[R]
📄 pytree.py
[E]
[D]
[R]
📄 pytree.pyc
[E]
[D]
[R]
📄 pytree.pyo
[E]
[D]
[R]
📄 refactor.py
[E]
[D]
[R]
📄 refactor.pyc
[E]
[D]
[R]
📄 refactor.pyo
[E]
[D]
[R]
Editing: PatternGrammar.txt
# 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 '>'
Save