Commit | Line | Data |
---|---|---|
03363afd YO |
1 | # regcomp.sym |
2 | # | |
85900e28 | 3 | # File has two sections, divided by a line of dashes '-'. |
03363afd | 4 | # |
65aa4ca7 FC |
5 | # Lines beginning with # are ignored, except for those that start with #* |
6 | # which are included in pod/perldebguts.pod. # within a line may be part | |
7 | # of a description. | |
03363afd | 8 | # |
486ec47a | 9 | # First section is for regops, second section is for regmatch-states |
03363afd | 10 | # |
3dab1dad YO |
11 | # Note that the order in this file is important. |
12 | # | |
85900e28 | 13 | # Format for first section: |
e21ef692 KW |
14 | # NAME \s+ TYPE, arg-description [struct regnode suffix] [flags] [longjump] ; DESCRIPTION |
15 | # arg-description is currently unused | |
16 | # suffix is appended to 'struct_regnode_' giving which one to use. If empty, | |
17 | # it means plain 'struct regnode'. If the regnode is a string one, this | |
18 | # should instead refer to the base regnode, without the char[1] element | |
19 | # of the structure | |
46167d76 | 20 | # flag <S> means is REGNODE_SIMPLE; flag <V> means is REGNODE_VARIES; <.> is |
e21ef692 KW |
21 | # a placeholder |
22 | # longjump is 1 if the (first) argument holds the next offset (instead of the | |
23 | # usual 'next_offset' field | |
3dab1dad | 24 | # |
c476f425 | 25 | # run perl regen.pl after editing this file |
3dab1dad | 26 | |
e21ef692 KW |
27 | # +- suffix of which struct regnode to use e.g., |
28 | # | +- flags (S or V) struct regnode_1 | |
29 | # un- | | +- longjmp (0, blank, or 1) blank means 0 | |
30 | # Name Type used | | | ; comment | |
31 | # -------------------------------------------------------------------------- | |
32 | # IFMATCH BRANCHJ, off 1 . 1 ; Succeeds if the following matches. | |
33 | # UNLESSM BRANCHJ, off 1 . 1 ; Fails if the following matches. | |
34 | # SUSPEND BRANCHJ, off 1 V 1 ; "Independent" sub-RE. | |
35 | # IFTHEN BRANCHJ, off 1 V 1 ; Switch, should be preceded by switcher. | |
36 | # GROUPP GROUPP, num 1 ; Whether the group matched. | |
96bc7be8 KW |
37 | # |
38 | # If we were to start running out of regnodes, many of the ones that are | |
39 | # complements could be combined with their non-complement mates. For example, | |
40 | # POSIXU could have the flags field have the bottom bit mean do we complement | |
41 | # or not, and the type be shifted left 1 bit. Then all that would be needed to | |
42 | # extract which to do is a mask for the complement bit, and a right shift for | |
43 | # the other, an inconsequential increase in instructions. It might actually be | |
44 | # clearer and slightly faster given the case statement and assignment are | |
45 | # removed. Note that not everything could be collapsed: NPOSIXA, for example, | |
46 | # would require special handling for performance. | |
03363afd YO |
47 | |
48 | ||
381b57db | 49 | #* Exit points |
1de06328 | 50 | |
f8abb37e NC |
51 | END END, no ; End of program. |
52 | SUCCEED END, no ; Return from a subroutine, basically. | |
d09b2d29 | 53 | |
d3d47aac | 54 | #* Line Start Anchors: |
1645b83c | 55 | #Note flags field for SBOL indicates if it is a /^/ or a /\A/ |
d3d47aac YO |
56 | SBOL BOL, no ; Match "" at beginning of line: /^/, /\A/ |
57 | MBOL BOL, no ; Same, assuming multiline: /^/m | |
58 | ||
59 | #* Line End Anchors: | |
60 | SEOL EOL, no ; Match "" at end of line: /$/ | |
61 | MEOL EOL, no ; Same, assuming multiline: /$/m | |
62 | EOS EOL, no ; Match "" at end of string: /\z/ | |
63 | ||
64 | #* Match Start Anchors: | |
65 | GPOS GPOS, no ; Matches where last m//g left off. | |
66 | ||
67 | #* Word Boundary Opcodes: | |
693fefec KW |
68 | # The regops that have varieties that vary depending on the character set regex |
69 | # modifiers have to ordered thusly: /d, /l, /u, /a, /aa. This is because code | |
70 | # in regcomp.c uses the enum value of the modifier as an offset from the /d | |
71 | # version. The complements must come after the non-complements. | |
3018b823 | 72 | # BOUND, POSIX and their complements are affected, as well as EXACTF. |
0991ffc9 | 73 | BOUND BOUND, no ; Like BOUNDA for non-utf8, otherwise like BOUNDU |
c440a570 | 74 | BOUNDL BOUND, no ; Like BOUND/BOUNDU, but \w and \W are defined by current locale |
912b808c | 75 | BOUNDU BOUND, no ; Match "" at any boundary of a given type using /u rules. |
c440a570 | 76 | BOUNDA BOUND, no ; Match "" at any boundary between \w\W or \W\w, where \w is [_a-zA-Z0-9] |
693fefec | 77 | # All NBOUND nodes are required by code in regexec.c to be greater than all BOUND ones |
0991ffc9 | 78 | NBOUND NBOUND, no ; Like NBOUNDA for non-utf8, otherwise like BOUNDU |
c440a570 | 79 | NBOUNDL NBOUND, no ; Like NBOUND/NBOUNDU, but \w and \W are defined by current locale |
912b808c | 80 | NBOUNDU NBOUND, no ; Match "" at any non-boundary of a given type using using /u rules. |
c440a570 | 81 | NBOUNDA NBOUND, no ; Match "" betweeen any \w\w or \W\W, where \w is [_a-zA-Z0-9] |
d09b2d29 | 82 | |
381b57db | 83 | #* [Special] alternatives: |
f9ef50a7 NC |
84 | REG_ANY REG_ANY, no 0 S ; Match any one character (except newline). |
85 | SANY REG_ANY, no 0 S ; Match any one character. | |
46fc0c43 KW |
86 | ANYOF ANYOF, sv charclass S ; Match character in (or not in) this class, single char match only |
87 | ANYOFD ANYOF, sv charclass S ; Like ANYOF, but /d is in effect | |
88 | ANYOFL ANYOF, sv charclass S ; Like ANYOF, but /l is in effect | |
89 | ANYOFPOSIXL ANYOF, sv charclass_posixl S ; Like ANYOFL, but matches [[:posix:]] classes | |
f6eaa562 KW |
90 | |
91 | # Must be sequential | |
543b9dd5 KW |
92 | ANYOFH ANYOFH, sv 1 S ; Like ANYOF, but only has "High" matches, none in the bitmap; the flags field contains the lowest matchable UTF-8 start byte |
93 | ANYOFHb ANYOFH, sv 1 S ; Like ANYOFH, but all matches share the same UTF-8 start byte, given in the flags field | |
94 | ANYOFHr ANYOFH, sv 1 S ; Like ANYOFH, but the flags field contains packed bounds for all matchable UTF-8 start bytes. | |
689eab88 | 95 | ANYOFHs ANYOFH, sv:str 1 S ; Like ANYOFHb, but has a string field that gives the leading matchable UTF-8 bytes; flags field is len |
2d5613be KW |
96 | ANYOFR ANYOFR, packed 1 S ; Matches any character in the range given by its packed args: upper 12 bits is the max delta from the base lower 20; the flags field contains the lowest matchable UTF-8 start byte |
97 | ANYOFRb ANYOFR, packed 1 S ; Like ANYOFR, but all matches share the same UTF-8 start byte, given in the flags field | |
8fcaedaa KW |
98 | # There is no ANYOFRr because khw doesn't think there are likely to be |
99 | # real-world cases where such a large range is used. | |
100 | # | |
101 | # And khw doesn't believe an ANYOFRs (which would behave like ANYOFHs) is | |
102 | # actually worth it. On two-byte UTF-8, the first byte alone is all we need, | |
103 | # and ANYOFR already does that. And we don't consider non-Unicode code points | |
104 | # or EBCDIC for performance decisions. If we had it, we would be comparing the | |
105 | # strings, and if they are equal convert to UV and then test to see if it is in | |
106 | # the range. The fast DFA we now use to do the conversion is slower than | |
107 | # comparing the strings, but not by much, and negligible in 2 or 3 byte | |
108 | # operations. (We don't have to compare the final byte as it has to be | |
109 | # different or else this wouldn't be a range.) So we might as well displense | |
110 | # with the comparisons that ANYOFRs would do, and go directly to do the | |
111 | # conversion . | |
4c8c99df KW |
112 | |
113 | ANYOFHbbm ANYOFHbbm none bbm S ; Like ANYOFHb, but only for 2-byte UTF-8 characters; uses a bitmap to match the continuation byte | |
114 | ||
ebee057d KW |
115 | ANYOFM ANYOFM, byte 1 S ; Like ANYOF, but matches an invariant byte as determined by the mask and arg |
116 | NANYOFM ANYOFM, byte 1 S ; complement of ANYOFM | |
693fefec | 117 | |
d3d47aac | 118 | #* POSIX Character Classes: |
3018b823 KW |
119 | # Order of the below is important. See ordering comment above. |
120 | POSIXD POSIXD, none 0 S ; Some [[:class:]] under /d; the FLAGS field gives which one | |
121 | POSIXL POSIXD, none 0 S ; Some [[:class:]] under /l; the FLAGS field gives which one | |
122 | POSIXU POSIXD, none 0 S ; Some [[:class:]] under /u; the FLAGS field gives which one | |
3615ea58 | 123 | POSIXA POSIXD, none 0 S ; Some [[:class:]] under /a; the FLAGS field gives which one |
3018b823 KW |
124 | NPOSIXD NPOSIXD, none 0 S ; complement of POSIXD, [[:^class:]] |
125 | NPOSIXL NPOSIXD, none 0 S ; complement of POSIXL, [[:^class:]] | |
126 | NPOSIXU NPOSIXD, none 0 S ; complement of POSIXU, [[:^class:]] | |
9e84774b | 127 | NPOSIXA NPOSIXD, none 0 S ; complement of POSIXA, [[:^class:]] |
3018b823 | 128 | # End of order is important |
693fefec | 129 | |
2448cf39 | 130 | CLUMP CLUMP, no 0 V ; Match any extended grapheme cluster sequence |
d09b2d29 | 131 | |
381b57db | 132 | #* Alternation |
1de06328 | 133 | |
65aa4ca7 FC |
134 | #* BRANCH The set of branches constituting a single choice are |
135 | #* hooked together with their "next" pointers, since | |
136 | #* precedence prevents anything being concatenated to | |
137 | #* any individual branch. The "next" pointer of the last | |
138 | #* BRANCH in a choice points to the thing following the | |
139 | #* whole choice. This is also where the final "next" | |
140 | #* pointer of each individual branch points; each branch | |
141 | #* starts with the operand node of a BRANCH node. | |
142 | #* | |
acababb4 | 143 | BRANCH BRANCH, node 1 V ; Match this alternative, or the next... |
d09b2d29 | 144 | |
65aa4ca7 FC |
145 | #*Literals |
146 | # NOTE: the relative ordering of these types is important do not change it | |
938090ac KW |
147 | # By convention, folding nodes begin with EXACTF; A digit 8 is in the name if |
148 | # and only if it it requires a UTF-8 target string in order to successfully | |
149 | # match. | |
1de06328 | 150 | |
3ace85ea | 151 | EXACT EXACT, str ; Match this string (flags field is the length). |
ae06e581 KW |
152 | |
153 | #* In a long string node, the U32 argument is the length, and is | |
154 | #* immediately followed by the string. | |
155 | LEXACT EXACT, len:str 1; Match this long string (preceded by length; flags unused). | |
58ea1df2 KW |
156 | EXACTL EXACT, str ; Like EXACT, but /l is in effect (used so locale-related warnings can be checked for) |
157 | EXACTF EXACT, str ; Like EXACT, but match using /id rules; (string not UTF-8, ASCII folded; non-ASCII not) | |
158 | EXACTFL EXACT, str ; Like EXACT, but match using /il rules; (string not likely to be folded) | |
159 | EXACTFU EXACT, str ; Like EXACT, but match using /iu rules; (string folded) | |
160 | ||
161 | # The reason MICRO and SHARP S aren't folded in non-UTF8 patterns is because | |
162 | # they would fold to something that requires UTF-8. SHARP S would normally | |
163 | # fold to 'ss', but because of /aa, it instead folds to a pair of LATIN SMALL | |
164 | # LETTER LONG S characters (U+017F) | |
5f162c35 | 165 | EXACTFAA EXACT, str ; Like EXACT, but match using /iaa rules; (string folded except MICRO in non-UTF8 patterns; doesn't contain SHARP S unless UTF-8; folded length <= unfolded) |
f97d9711 KW |
166 | # must immediately follow EXACTFAA |
167 | EXACTFAA_NO_TRIE EXACT, str ; Like EXACTFAA, (string not UTF-8, folded except: MICRO, SHARP S; folded length <= unfolded, not currently trie-able) | |
2f306ab9 KW |
168 | |
169 | # End of important relative ordering. | |
170 | ||
5f162c35 | 171 | EXACTFUP EXACT, str ; Like EXACT, but match using /iu rules; (string not UTF-8, folded except MICRO: hence Problematic) |
aa419ff3 KW |
172 | # In order for a non-UTF-8 EXACTFAA to think the pattern is pre-folded when |
173 | # matching a UTF-8 target string, there would have to be something like an | |
174 | # EXACTFAA_MICRO which would not be considered pre-folded for UTF-8 targets, | |
175 | # since the fold of the MICRO SIGN would not be done, and would be | |
176 | # representable in the UTF-8 target string. | |
177 | ||
58ea1df2 | 178 | EXACTFLU8 EXACT, str ; Like EXACTFU, but use /il, UTF-8, (string is folded, and everything in it is above 255 |
3f2416ae KW |
179 | EXACT_REQ8 EXACT, str ; Like EXACT, but only UTF-8 encoded targets can match |
180 | LEXACT_REQ8 EXACT, len:str 1 ; Like LEXACT, but only UTF-8 encoded targets can match | |
181 | EXACTFU_REQ8 EXACT, str ; Like EXACTFU, but only UTF-8 encoded targets can match | |
efec1f81 | 182 | # One could add EXACTFAA8 and something that has the same effect for /l, |
a9f8c7ac | 183 | # but these would be extremely uncommon |
f6b4b99d | 184 | |
58ea1df2 | 185 | EXACTFU_S_EDGE EXACT, str ; /di rules, but nothing in it precludes /ui, except begins and/or ends with [Ss]; (string not UTF-8; compile-time only) |
8a100c91 | 186 | |
7af55186 KW |
187 | #*New charclass like patterns |
188 | LNBREAK LNBREAK, none ; generic newline pattern | |
189 | ||
190 | #*Trie Related | |
191 | ||
192 | #* Behave the same as A|LIST|OF|WORDS would. The '..C' variants | |
193 | #* have inline charclass data (ascii only), the 'C' store it in the | |
194 | #* structure. | |
195 | # NOTE: the relative order of the TRIE-like regops is significant | |
196 | ||
197 | TRIE TRIE, trie 1 ; Match many EXACT(F[ALU]?)? at once. flags==type | |
198 | TRIEC TRIE,trie charclass ; Same as TRIE, but with embedded charclass data | |
199 | ||
200 | # For start classes, contains an added fail table. | |
201 | AHOCORASICK TRIE, trie 1 ; Aho Corasick stclass. flags==type | |
202 | AHOCORASICKC TRIE,trie charclass ; Same as AHOCORASICK, but with embedded charclass data | |
203 | ||
381b57db | 204 | #*Do nothing types |
1de06328 | 205 | |
f8abb37e | 206 | NOTHING NOTHING, no ; Match empty string. |
65aa4ca7 | 207 | #*A variant of above which delimits a group, thus stops optimizations |
f8abb37e | 208 | TAIL NOTHING, no ; Match empty string. Can jump here from outside. |
d09b2d29 | 209 | |
381b57db | 210 | #*Loops |
1de06328 | 211 | |
65aa4ca7 | 212 | #* STAR,PLUS '?', and complex '*' and '+', are implemented as |
62e6ef33 | 213 | #* circular BRANCH structures. Simple cases |
65aa4ca7 FC |
214 | #* (one character per match) are implemented with STAR |
215 | #* and PLUS for speed and to minimize recursive plunges. | |
216 | #* | |
ac577429 KW |
217 | STAR STAR, node 0 V ; Match this (simple) thing 0 or more times: /A{0,}B/ where A is width 1 char |
218 | PLUS PLUS, node 0 V ; Match this (simple) thing 1 or more times: /A{1,}B/ where A is width 1 char | |
d09b2d29 | 219 | |
17e3e02a YO |
220 | CURLY CURLY, sv 3 V ; Match this (simple) thing {n,m} times: /A{m,n}B/ where A is width 1 char |
221 | CURLYN CURLY, no 3 V ; Capture next-after-this simple thing: /(A){m,n}B/ where A is width 1 char | |
222 | CURLYM CURLY, no 3 V ; Capture this medium-complex thing {n,m} times: /(A){m,n}B/ where A is fixed-length | |
223 | CURLYX CURLY, sv 3 V ; Match/Capture this complex thing {n,m} times. | |
d09b2d29 | 224 | |
65aa4ca7 | 225 | #*This terminator creates a loop structure for CURLYX |
f9ef50a7 | 226 | WHILEM WHILEM, no 0 V ; Do curly processing and see if rest matches. |
d09b2d29 | 227 | |
381b57db | 228 | #*Buffer related |
1de06328 | 229 | |
65aa4ca7 | 230 | #*OPEN,CLOSE,GROUPP ...are numbered at compile time. |
f8abb37e | 231 | OPEN OPEN, num 1 ; Mark this point in input as start of #n. |
48e88d42 | 232 | CLOSE CLOSE, num 1 ; Close corresponding OPEN of #n. |
07093db4 KW |
233 | SROPEN SROPEN, none ; Same as OPEN, but for script run |
234 | SRCLOSE SRCLOSE, none ; Close preceding SROPEN | |
d09b2d29 | 235 | |
d78630f1 YO |
236 | REF REF, num 2 V ; Match some already matched string |
237 | REFF REF, num 2 V ; Match already matched string, using /di rules. | |
238 | REFFL REF, num 2 V ; Match already matched string, using /li rules. | |
781aab5c | 239 | # N?REFF[AU] could have been implemented using the FLAGS field of the |
01f98ec2 KW |
240 | # regnode, but by having a separate node type, we can use the existing switch |
241 | # statement to avoid some tests | |
d78630f1 YO |
242 | REFFU REF, num 2 V ; Match already matched string, usng /ui. |
243 | REFFA REF, num 2 V ; Match already matched string, using /aai rules. | |
d09b2d29 | 244 | |
65aa4ca7 FC |
245 | #*Named references. Code in regcomp.c assumes that these all are after |
246 | #*the numbered references | |
d78630f1 YO |
247 | REFN REF, no-sv 2 V ; Match some already matched string |
248 | REFFN REF, no-sv 2 V ; Match already matched string, using /di rules. | |
249 | REFFLN REF, no-sv 2 V ; Match already matched string, using /li rules. | |
250 | REFFUN REF, num 2 V ; Match already matched string, using /ui rules. | |
251 | REFFAN REF, num 2 V ; Match already matched string, using /aai rules. | |
1de06328 | 252 | |
d3d47aac YO |
253 | #*Support for long RE |
254 | LONGJMP LONGJMP, off 1 . 1 ; Jump far away. | |
17e3e02a | 255 | BRANCHJ BRANCHJ, off 2 V 1 ; BRANCH with long offset. |
d3d47aac YO |
256 | |
257 | #*Special Case Regops | |
2abbd513 KW |
258 | IFMATCH BRANCHJ, off 1 . 1 ; Succeeds if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current |
259 | UNLESSM BRANCHJ, off 1 . 1 ; Fails if the following matches; non-zero flags "f", next_off "o" means lookbehind assertion starting "f..(f-o)" characters before current | |
f9ef50a7 | 260 | SUSPEND BRANCHJ, off 1 V 1 ; "Independent" sub-RE. |
65aa4ca7 | 261 | IFTHEN BRANCHJ, off 1 V 1 ; Switch, should be preceded by switcher. |
f8abb37e | 262 | GROUPP GROUPP, num 1 ; Whether the group matched. |
d09b2d29 | 263 | |
381b57db | 264 | #*The heavy worker |
1de06328 | 265 | |
17e3e02a | 266 | EVAL EVAL, evl/flags 2 ; Execute some Perl code. |
d09b2d29 | 267 | |
381b57db | 268 | #*Modifiers |
1de06328 | 269 | |
f8abb37e NC |
270 | MINMOD MINMOD, no ; Next operator is not greedy. |
271 | LOGICAL LOGICAL, no ; Next opcode should set the flag only. | |
d09b2d29 | 272 | |
65aa4ca7 | 273 | #*This is not used yet |
f9ef50a7 | 274 | RENUM BRANCHJ, off 1 . 1 ; Group with independently numbered parens. |
d09b2d29 | 275 | |
381b57db | 276 | #*Regex Subroutines |
17e3e02a | 277 | GOSUB GOSUB, num/ofs 2 ; recurse to paren arg1 at (signed) ofs arg2 |
03363afd | 278 | |
381b57db | 279 | #*Special conditionals |
016b7209 | 280 | GROUPPN GROUPPN, no-sv 1 ; Whether the group matched. |
85900e28 YO |
281 | INSUBP INSUBP, num 1 ; Whether we are in a specific recurse. |
282 | DEFINEP DEFINEP, none 1 ; Never execute directly. | |
0a4db386 | 283 | |
486ec47a | 284 | #*Backtracking Verbs |
f8abb37e | 285 | ENDLIKE ENDLIKE, none ; Used only for the type field of verbs |
fee50582 | 286 | OPFAIL ENDLIKE, no-sv 1 ; Same as (?!), but with verb arg |
17e3e02a | 287 | ACCEPT ENDLIKE, no-sv/num 2 ; Accepts the current matched string, with verbar |
5d458dd8 YO |
288 | |
289 | #*Verbs With Arguments | |
f8abb37e | 290 | VERB VERB, no-sv 1 ; Used only for the type field of verbs |
85900e28 | 291 | PRUNE VERB, no-sv 1 ; Pattern fails at this startpoint if no-backtracking through this |
f8abb37e NC |
292 | MARKPOINT VERB, no-sv 1 ; Push the current location for rollback by cut. |
293 | SKIP VERB, no-sv 1 ; On failure skip forward (to the mark) before retrying | |
294 | COMMIT VERB, no-sv 1 ; Pattern fails outright if backtracking through this | |
295 | CUTGROUP VERB, no-sv 1 ; On failure go to the next alternation in the group | |
e2e6a0f1 | 296 | |
ee9b8eae | 297 | #*Control what to keep in $&. |
f8abb37e | 298 | KEEPS KEEPS, no ; $& begins here. |
ee9b8eae | 299 | |
271c3af7 YO |
300 | #*Validate that lookbehind IFMATCH and UNLESSM end at the right place |
301 | LOOKBEHIND_END END, no ; Return from lookbehind (IFMATCH/UNLESSM) and validate position | |
302 | ||
7af55186 KW |
303 | # NEW STUFF SOMEWHERE ABOVE THIS LINE. Stuff that regexec.c: find_byclass() |
304 | # and regrepeat() use should go way above, near LNBREAK to allow a more compact | |
305 | # jump table to be generated for their switch() statements | |
1de06328 | 306 | |
03363afd YO |
307 | ################################################################################ |
308 | ||
7f69552c | 309 | #*SPECIAL REGOPS |
1de06328 | 310 | |
65aa4ca7 FC |
311 | #* This is not really a node, but an optimized away piece of a "long" |
312 | #* node. To simplify debugging output, we mark it as if it were a node | |
f8abb37e | 313 | OPTIMIZED NOTHING, off ; Placeholder for dump. |
1de06328 | 314 | |
65aa4ca7 FC |
315 | #* Special opcode with the property that no opcode in a compiled program |
316 | #* will ever be of this type. Thus it can be used as a flag value that | |
317 | #* no other opcode has been seen. END is used similarly, in that an END | |
318 | #* node cant be optimized. So END implies "unoptimizable" and PSEUDO | |
319 | #* mean "not seen anything to optimize yet". | |
f8abb37e | 320 | PSEUDO PSEUDO, off ; Pseudo opcode for internal use. |
1de06328 | 321 | |
86451f01 KW |
322 | REGEX_SET REGEX_SET, depth p S ; Regex set, temporary node used in pre-optimization compilation |
323 | ||
03363afd YO |
324 | ------------------------------------------------------------------------------- |
325 | # Format for second section: | |
65aa4ca7 | 326 | # REGOP \t typelist [ \t typelist] |
03363afd YO |
327 | # typelist= namelist |
328 | # = namelist:FAIL | |
329 | # = name:count | |
330 | ||
331 | # Anything below is a state | |
332 | # | |
333 | # | |
f8abb37e | 334 | TRIE next:FAIL |
4ee16520 | 335 | EVAL B,postponed_AB:FAIL |
f8abb37e NC |
336 | CURLYX end:FAIL |
337 | WHILEM A_pre,A_min,A_max,B_min,B_max:FAIL | |
338 | BRANCH next:FAIL | |
339 | CURLYM A,B:FAIL | |
340 | IFMATCH A:FAIL | |
21cbe009 | 341 | CURLY B_min,B_max:FAIL |
f8abb37e NC |
342 | COMMIT next:FAIL |
343 | MARKPOINT next:FAIL | |
344 | SKIP next:FAIL | |
345 | CUTGROUP next:FAIL | |
346 | KEEPS next:FAIL | |
59db1942 | 347 | REF next:FAIL |