| 1 |
DELIMITERS = "<$.>" ; |
| 2 |
|
| 3 |
TEMPLATE DefinedAnywhere = 1 (Q) ; |
| 4 |
|
| 5 |
TEMPLATE V-Prep = 1 (V) LINK 1* (PREP) ; |
| 6 |
|
| 7 |
ADD (@postGood) (*) IF (T:V-Prep LINK 1 (N)) ; |
| 8 |
ADD (@postBad) (*) IF (T:V-Prep LINK 1 (Q)) ; |
| 9 |
ADD (@preGood) (*) IF (-2 (SUBJ) LINK T:V-Prep) ; |
| 10 |
ADD (@preBad) (*) IF (-2 (Q) LINK T:V-Prep) ; |
| 11 |
ADD (@bothGoodGood) (*) IF (-3 (SUBJ) LINK T:V-Prep LINK 1 (N)) ; |
| 12 |
ADD (@bothGoodBad) (*) IF (-3 (SUBJ) LINK T:V-Prep LINK 1 (Q)) ; |
| 13 |
ADD (@bothBadGood) (*) IF (-4 (Q) LINK T:V-Prep LINK 1 (N)) ; |
| 14 |
ADD (@bothBadBad) (*) IF (-4 (Q) LINK T:V-Prep LINK 1 (Q)) ; |
| 15 |
|
| 16 |
LIST CC = CC ; |
| 17 |
TEMPLATE NccN = [(N), CC, (N)] ; |
| 18 |
|
| 19 |
ADD (@beforeNccN) (*) IF (T:NccN) ; |
| 20 |
ADD (@startNccN) (*) IF (0 T:NccN) ; |
| 21 |
ADD (@afterNccN) (*) IF (-1 T:NccN) ; |
| 22 |
|
| 23 |
TEMPLATE A-link-B = T:V-Prep LINK T:NccN ; |
| 24 |
|
| 25 |
ADD (@linkedGood) (*) IF (0 (SUBJ) LINK T:A-link-B LINK 1 (<<<)) ; |
| 26 |
ADD (@linkedBad) (*) IF (0 (SUBJ) LINK T:A-link-B LINK 1 (>>>)) ; |
| 27 |
|
| 28 |
TEMPLATE ArtN = 1* (ART) LINK 1* (N) ; |
| 29 |
|
| 30 |
ADD (@artnGood1) (PREP) IF (-1 T:ArtN) ; |
| 31 |
ADD (@artnGood2) (V) IF (1 T:ArtN) ; |
| 32 |
ADD (@artnBad1) (PREP) IF (-2 T:ArtN) ; |
| 33 |
ADD (@artnBad2) (PREP) IF (1 T:ArtN) ; |
| 34 |
ADD (@artnBad3) (PREP) IF (2 T:ArtN) ; |
| 35 |
ADD (@artnNegateGood) (PREP) IF (NEGATE T:ArtN) ; |
| 36 |
ADD (@artnNegateGoodOffset) (PREP) IF (NEGATE 1 T:ArtN) ; |
| 37 |
ADD (@artnNegateBad) (PREP) IF (NEGATE -1 T:ArtN) ; |
| 38 |
|
| 39 |
ADD (@branch-nonC) (PREP) IF (-1*f (DET <W>30>)) ; |
| 40 |
ADD (@branch-C) (PREP) IF (1*f (CC <W>30>)) ; |
| 41 |
|
| 42 |
## --- Following is an internal compiler stress test. |
| 43 |
|
| 44 |
LIST x = x; |
| 45 |
LIST y = y; |
| 46 |
LIST z = z; |
| 47 |
LIST m = m; |
| 48 |
LIST n = n; |
| 49 |
LIST k = k; |
| 50 |
LIST v = v; |
| 51 |
LIST f = f; |
| 52 |
|
| 53 |
TEMPLATE axtmpl = ([x, y, z]) OR ([m, n, k]) ; |
| 54 |
TEMPLATE bxtmpl = [x, y, z] LINK 1 z ; |
| 55 |
|
| 56 |
# Predefined templates for use in multiple rules. |
| 57 |
TEMPLATE alts = |
| 58 |
(1*C x LINK 1 y LINK 2 z) |
| 59 |
OR (-2*C x LINK 1 y LINK 2 z) |
| 60 |
OR (1 m LINK 1 k) |
| 61 |
# Alternatives within alternatives...this can get very complex. |
| 62 |
OR ((2** x BARRIER v) OR (-2** x LINK 1 f)) |
| 63 |
OR (T:alts) |
| 64 |
# Templates are resolved later, so we can refer to currently unknown ones. |
| 65 |
OR (T:another) |
| 66 |
; |
| 67 |
TEMPLATE another = |
| 68 |
(1*C x LINK 1 y LINK 2 z) |
| 69 |
OR (-2*C x LINK 1 y LINK 2 z) |
| 70 |
# Templates can use previously defined templates; complexity level going bonanzas. |
| 71 |
OR (T:alts) |
| 72 |
; |
| 73 |
|
| 74 |
SECTION |
| 75 |
|
| 76 |
# Use a template with T:name; rules can use multiple templates if so desired. |
| 77 |
SELECT x IF (T:alts) (0 n) ; |
| 78 |
SELECT n IF (T:alts LINK 0 n) ; |
| 79 |
|
| 80 |
# Inline usage to provide alternatives for a single rule. |
| 81 |
# Extra () is needed to distinguish set OR from context OR. |
| 82 |
SELECT x IF ((1 x LINK 1 y) OR (-2 x LINK 1 y)) ; |
| 83 |
|
| 84 |
# Inline can also use defined templates. |
| 85 |
SELECT x IF ((1 x LINK 1 y) OR (T:another)) ; |