Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 6ec5cf24b7f38ea72bb42d5cd60dca0d3ee332f9 authored by Ned Deily on 20 October 2018, 05:24:09 UTC, committed by Ned Deily on 20 October 2018, 05:24:09 UTC 
3.6.7final
1 parent 92fe93e
Raw File
Tip revision: 6ec5cf24b7f38ea72bb42d5cd60dca0d3ee332f9 authored by Ned Deily on 20 October 2018, 05:24:09 UTC
3.6.7final
Tip revision: 6ec5cf2
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 '>'
back to top