---

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 '>'

---

docroot: /home/induvedam/public_html

---

curdir: /opt/alt/python35/lib64/python3.5/lib2to3

	.		4096
	..		8192
X	Grammar.txt		7211
X	Grammar3.5.9.final.0.pickle		31723
X	PatternGrammar.txt		793
X	PatternGrammar3.5.9.final.0.pickle		2093
X	__init__.py		7
X	__main__.py		67
	__pycache__		4096
X	btm_matcher.py		6833
X	btm_utils.py		9966
X	fixer_base.py		6690
X	fixer_util.py		15237
	fixes		4096
X	main.py		11669
X	patcomp.py		7070
	pgen2		179
X	pygram.py		1114
X	pytree.py		28052
X	refactor.py		28034