opt
/
alt
/
python310
/
lib64
/
python3.10
/
lib2to3
/
Go to Home Directory
+
Upload
Create File
root@0UT1S:~$
Execute
By Order of Mr.0UT1S
[DIR] ..
N/A
[DIR] __pycache__
N/A
[DIR] fixes
N/A
[DIR] pgen2
N/A
Grammar.txt
8.49 KB
Rename
Delete
Grammar3.10.16.final.0.pickle
14.95 KB
Rename
Delete
PatternGrammar.txt
793 bytes
Rename
Delete
PatternGrammar3.10.16.final.0.pickle
1.20 KB
Rename
Delete
__init__.py
163 bytes
Rename
Delete
__main__.py
67 bytes
Rename
Delete
btm_matcher.py
6.47 KB
Rename
Delete
btm_utils.py
9.73 KB
Rename
Delete
fixer_base.py
6.53 KB
Rename
Delete
fixer_util.py
14.85 KB
Rename
Delete
main.py
11.58 KB
Rename
Delete
patcomp.py
6.89 KB
Rename
Delete
pygram.py
1.27 KB
Rename
Delete
pytree.py
27.32 KB
Rename
Delete
refactor.py
26.86 KB
Rename
Delete
# 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