+++ /dev/null
-# Copyright 2006 Google, Inc. All Rights Reserved.\r
-# Licensed to PSF under a Contributor Agreement.\r
-\r
-# A grammar to describe tree matching patterns.\r
-# Not shown here:\r
-# - 'TOKEN' stands for any token (leaf node)\r
-# - 'any' stands for any node (leaf or interior)\r
-# With 'any' we can still specify the sub-structure.\r
-\r
-# The start symbol is 'Matcher'.\r
-\r
-Matcher: Alternatives ENDMARKER\r
-\r
-Alternatives: Alternative ('|' Alternative)*\r
-\r
-Alternative: (Unit | NegatedUnit)+\r
-\r
-Unit: [NAME '='] ( STRING [Repeater]\r
- | NAME [Details] [Repeater]\r
- | '(' Alternatives ')' [Repeater]\r
- | '[' Alternatives ']'\r
- )\r
-\r
-NegatedUnit: 'not' (STRING | NAME [Details] | '(' Alternatives ')')\r
-\r
-Repeater: '*' | '+' | '{' NUMBER [',' NUMBER] '}'\r
-\r
-Details: '<' Alternatives '>'\r