diff options
author | Karl Williamson <public@khwilliamson.com> | 2011-02-09 16:47:32 -0700 |
---|---|---|
committer | Karl Williamson <public@khwilliamson.com> | 2011-02-14 08:41:38 -0700 |
commit | 781aab5ce76879fa60024011ffb8e9327d6d0a96 (patch) | |
tree | 08dad705940cbfd84f046f266b189f6f3f1d5263 /regcomp.sym | |
parent | 7986cb47a0ada00e4b954311a259258633e181f8 (diff) | |
download | perl-781aab5ce76879fa60024011ffb8e9327d6d0a96.tar.gz |
regcomp.sym: Add nodes for backref of EXACTFA
These are not used yet.
Diffstat (limited to 'regcomp.sym')
-rw-r--r-- | regcomp.sym | 4 |
1 files changed, 3 insertions, 1 deletions
diff --git a/regcomp.sym b/regcomp.sym index 001acf6a27..7e49222156 100644 --- a/regcomp.sym +++ b/regcomp.sym @@ -132,16 +132,18 @@ CLOSE CLOSE, num 1 ; Analogous to OPEN. REF REF, num 1 V ; Match some already matched string REFF REF, num 1 V ; Match already matched string, folded using native charset semantics for non-utf8 REFFL REF, num 1 V ; Match already matched string, folded in loc. -# REFFU and NREFFU could have been implemented using the FLAGS field of the +# N?REFF[AU] could have been implemented using the FLAGS field of the # regnode, but by having a separate node type, we can use the existing switch # statement to avoid some tests REFFU REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8 +REFFA REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII #*Named references. Code in regcomp.c assumes that these all are after the numbered references NREF REF, no-sv 1 V ; Match some already matched string NREFF REF, no-sv 1 V ; Match already matched string, folded using native charset semantics for non-utf8 NREFFL REF, no-sv 1 V ; Match already matched string, folded in loc. NREFFU REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8 +NREFFA REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII IFMATCH BRANCHJ, off 1 . 2 ; Succeeds if the following matches. UNLESSM BRANCHJ, off 1 . 2 ; Fails if the following matches. |