| /dports/textproc/py-grako/grako-3.99.9/examples/regex/ |
| H A D | regex.ebnf | 21 ATOM = SUBEXP | LITERAL ;
23 SUBEXP = '(' ~ @:EXPRE ')' ;
|
| H A D | regex_parser.py | 33 def SUBEXP(self, ast): member in RegexSemantics
|
| /dports/www/mediawiki136/mediawiki-1.36.3/vendor/zordius/lightncandy/src/ |
| H A D | Parser.php | 31 const SUBEXP = -2; define in LightnCandy\\Parser
296 return array(static::SUBEXP, $avars, $expression);
315 …return is_array($var) && (count($var) === 3) && ($var[0] === static::SUBEXP) && is_string($var[2]);
|
| /dports/www/mediawiki137/mediawiki-1.37.1/vendor/zordius/lightncandy/src/ |
| H A D | Parser.php | 31 const SUBEXP = -2; define in LightnCandy\\Parser
296 return array(static::SUBEXP, $avars, $expression);
315 …return is_array($var) && (count($var) === 3) && ($var[0] === static::SUBEXP) && is_string($var[2]);
|
| /dports/www/mediawiki135/mediawiki-1.35.5/vendor/zordius/lightncandy/src/ |
| H A D | Parser.php | 31 const SUBEXP = -2; define in LightnCandy\\Parser
296 return array(static::SUBEXP, $avars, $expression);
315 …return is_array($var) && (count($var) === 3) && ($var[0] === static::SUBEXP) && is_string($var[2]);
|
| /dports/devel/judy/judy-1.0.5/src/JudyCommon/ |
| H A D | JudyPrivate.h | 842 #define JU_BITMAPDIGITB(DIGIT,SUBEXP,BITMAP,OFFSET) \ argument
845 (DIGIT) = (SUBEXP) * cJU_BITSPERSUBEXPB; \
850 assert((DIGIT) < ((SUBEXP) + 1) * cJU_BITSPERSUBEXPB); \
854 #define JU_BITMAPDIGITL(DIGIT,SUBEXP,BITMAP,OFFSET) \ argument
857 (DIGIT) = (SUBEXP) * cJU_BITSPERSUBEXPL; \
862 assert((DIGIT) < ((SUBEXP) + 1) * cJU_BITSPERSUBEXPL); \
1402 #define JU_RET_FOUND_LEAF_B1(PJLB,SUBEXP,OFFSET) JU_RET_FOUND argument
1456 #define JU_RET_FOUND_LEAF_B1(PJLB,SUBEXP,OFFSET) \ argument
1457 return((PPvoid_t) (P_JV(JL_JLB_PVALUE(PJLB, SUBEXP)) + (OFFSET)))
|
| /dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/klib/judy/ |
| H A D | JudyPrivate.h | 839 #define JU_BITMAPDIGITB(DIGIT,SUBEXP,BITMAP,OFFSET) \ argument
842 (DIGIT) = (SUBEXP) * cJU_BITSPERSUBEXPB; \
847 assert((DIGIT) < ((SUBEXP) + 1) * cJU_BITSPERSUBEXPB); \
851 #define JU_BITMAPDIGITL(DIGIT,SUBEXP,BITMAP,OFFSET) \ argument
854 (DIGIT) = (SUBEXP) * cJU_BITSPERSUBEXPL; \
859 assert((DIGIT) < ((SUBEXP) + 1) * cJU_BITSPERSUBEXPL); \
1399 #define JU_RET_FOUND_LEAF_B1(PJLB,SUBEXP,OFFSET) JU_RET_FOUND argument
1453 #define JU_RET_FOUND_LEAF_B1(PJLB,SUBEXP,OFFSET) \ argument
1454 return((PPvoid_t) (P_JV(JL_JLB_PVALUE(PJLB, SUBEXP)) + (OFFSET)))
|
| /dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/klib/judy/ |
| H A D | JudyPrivate.h | 839 #define JU_BITMAPDIGITB(DIGIT,SUBEXP,BITMAP,OFFSET) \ argument
842 (DIGIT) = (SUBEXP) * cJU_BITSPERSUBEXPB; \
847 assert((DIGIT) < ((SUBEXP) + 1) * cJU_BITSPERSUBEXPB); \
851 #define JU_BITMAPDIGITL(DIGIT,SUBEXP,BITMAP,OFFSET) \ argument
854 (DIGIT) = (SUBEXP) * cJU_BITSPERSUBEXPL; \
859 assert((DIGIT) < ((SUBEXP) + 1) * cJU_BITSPERSUBEXPL); \
1399 #define JU_RET_FOUND_LEAF_B1(PJLB,SUBEXP,OFFSET) JU_RET_FOUND argument
1453 #define JU_RET_FOUND_LEAF_B1(PJLB,SUBEXP,OFFSET) \ argument
1454 return((PPvoid_t) (P_JV(JL_JLB_PVALUE(PJLB, SUBEXP)) + (OFFSET)))
|
| /dports/editors/texstudio/texstudio-4.1.2/completion/ |
| H A D | complexity.cwl | 337 \SUBEXP
|
| /dports/print/texlive-base/texlive-20150521-source/texk/chktex/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/print/tex-xetex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/print/tex-luatex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/devel/arduino-ctags/ctags-5.8-arduino11/gnu_regex/ |
| H A D | regcomp.c | 1251 else if (node->token.type == SUBEXP in optimize_subexps()
1252 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1276 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1282 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2421 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2529 if (elem->token.type == SUBEXP) in parse_dup_op()
3744 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/devel/kBuild/kBuild-0.1.9998/src/sed/lib/ |
| H A D | regcomp.c | 1232 else if (node->token.type == SUBEXP in optimize_subexps()
1233 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1257 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1263 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2410 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2518 if (elem->token.type == SUBEXP) in parse_dup_op()
3732 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/comms/direwolf/direwolf-1.6/external/regex/ |
| H A D | regcomp.c | 1228 else if (node->token.type == SUBEXP in optimize_subexps()
1229 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1253 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1259 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2404 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2512 if (elem->token.type == SUBEXP) in parse_dup_op()
3729 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/devel/ctags/ctags-5.8/gnu_regex/ |
| H A D | regcomp.c | 1251 else if (node->token.type == SUBEXP in optimize_subexps()
1252 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1276 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1282 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2421 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2529 if (elem->token.type == SUBEXP) in parse_dup_op()
3744 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/devel/geany/geany-1.38/ctags/gnu_regex/ |
| H A D | regcomp.c | 1251 else if (node->token.type == SUBEXP in optimize_subexps()
1252 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1276 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1282 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2421 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2529 if (elem->token.type == SUBEXP) in parse_dup_op()
3744 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/japanese/ctags/ctags-5.8j2/gnu_regex/ |
| H A D | regcomp.c | 1251 else if (node->token.type == SUBEXP in optimize_subexps()
1252 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1276 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1282 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2421 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2529 if (elem->token.type == SUBEXP) in parse_dup_op()
3744 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/print/tex-aleph/texlive-20150521-source/texk/web2c/pdftexdir/regex/ |
| H A D | regcomp.c | 1217 else if (node->token.type == SUBEXP in optimize_subexps()
1218 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1242 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1248 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2393 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2501 if (elem->token.type == SUBEXP) in parse_dup_op()
3723 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/sysutils/sleuthkit/sleuthkit-4.7.0/framework/modules/c_FileTypeSigModule/mingw-libgnurx-2.5.1/ |
| H A D | regcomp.c | 1228 else if (node->token.type == SUBEXP in optimize_subexps()
1229 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1253 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1259 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2404 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2512 if (elem->token.type == SUBEXP) in parse_dup_op()
3726 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|
| /dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/ext/regex/ |
| H A D | regcomp.c | 1224 else if (node->token.type == SUBEXP in optimize_subexps()
1225 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1249 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1255 if (node->right && node->right->token.type == SUBEXP) in lower_subexps()
2400 tree = create_tree (dfa, tree, NULL, SUBEXP); in parse_sub_exp()
2508 if (elem->token.type == SUBEXP) in parse_dup_op()
3722 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()
|