Home
last modified time | relevance | path

Searched refs:nsubsym (Results 1 – 25 of 38) sorted by relevance

12

/dports/devel/pear-PHP_ParserGenerator/PHP_ParserGenerator-0.1.7/ParserGenerator/
H A DSymbol.php191 public $nsubsym; variable in PHP_ParserGenerator_Symbol
282 if ($a->nsubsym != $b->nsubsym) return 0;
283 for ($i = 0; $i < $a->nsubsym; $i++) {
H A DConfig.php368 for ($k = 0; $k < $xsp->nsubsym; $k++) {
503 for ($j = 1; $j < $sp->nsubsym; $j++) {
H A DParser.php610 $msp->nsubsym = 1;
615 $msp->nsubsym++;
616 … $msp->subsym[$msp->nsubsym - 1] = PHP_ParserGenerator_Symbol::Symbol_new(substr($x, 1));
/dports/devel/pear-PHP_ParserGenerator/PHP_ParserGenerator-0.1.7/
H A DMain.php336 if ($a->nsubsym != $b->nsubsym) return 0;
337 for ($i = 0; $i < $a->nsubsym; $i++) {
603 for ($k = 0; $k < $xsp->nsubsym; $k++) {
714 for ($j = 1; $j < $sp->nsubsym; $j++) {
1187 for ($j = 0; $j < $sp->nsubsym; $j++) {
1248 for ($j = 0; $j < $s2->nsubsym; $j++) {
1445 for($i = 0; $i < $sp->nsubsym; $i++) {
2347 for($k = 1; $k < $sp->nsubsym; $k++) {
3354 for ($j = 1; $j < $sp->nsubsym; $j++) {
3873 $msp->nsubsym = 1;
[all …]
/dports/databases/sqlitestudio/sqlitestudio-3.3.3/SQLiteStudio3/coreSQLiteStudio/parser/
H A Dlemon.c752 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
814 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
944 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
945 for(i=0; i<a->nsubsym; i++){ in same_symbol()
995 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2256 msp->nsubsym = 1; in parseonetoken()
2262 msp->nsubsym++; in parseonetoken()
2559 msp->nsubsym++; in parseonetoken()
2926 for(j=1; j<sp->nsubsym; j++){ in Reprint()
2954 for(j=1; j<sp->nsubsym; j++){ in ConfigPrint()
[all …]
/dports/devel/z88dk/z88dk/src/z80asm/dev/
H A Dlemon.c749 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
811 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
941 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
942 for(i=0; i<a->nsubsym; i++){ in same_symbol()
992 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2253 msp->nsubsym = 1; in parseonetoken()
2259 msp->nsubsym++; in parseonetoken()
2556 msp->nsubsym++; in parseonetoken()
2923 for(j=1; j<sp->nsubsym; j++){ in Reprint()
2951 for(j=1; j<sp->nsubsym; j++){ in ConfigPrint()
[all …]
/dports/emulators/mess/mame-mame0226/3rdparty/bx/tools/lemon/
H A Dlemon.c772 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
834 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
964 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
965 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1015 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2365 msp->nsubsym = 1; in parseonetoken()
2371 msp->nsubsym++; in parseonetoken()
2690 msp->nsubsym++; in parseonetoken()
3057 for(j=1; j<sp->nsubsym; j++){ in Reprint()
3084 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/databases/sqlcipher/sqlcipher-3.4.2/tool/
H A Dlemon.c772 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
834 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
964 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
965 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1015 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2364 msp->nsubsym = 1; in parseonetoken()
2370 msp->nsubsym++; in parseonetoken()
2667 msp->nsubsym++; in parseonetoken()
3034 for(j=1; j<sp->nsubsym; j++){ in Reprint()
3061 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/databases/spatialite/libspatialite-5.0.1/src/gaiageo/lemon/lemon_src/
H A Dlemon.c811 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
873 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1003 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1004 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1054 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2405 msp->nsubsym = 1; in parseonetoken()
2411 msp->nsubsym++; in parseonetoken()
2730 msp->nsubsym++; in parseonetoken()
3074 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3131 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/databases/xapian-core/xapian-core-1.4.18/queryparser/
H A Dlemon.c819 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
881 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1011 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1012 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1062 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2445 msp->nsubsym = 1; in parseonetoken()
2452 msp->nsubsym++; in parseonetoken()
2773 msp->nsubsym++; in parseonetoken()
3118 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3175 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/emulators/mame/mame-mame0226/3rdparty/bx/tools/lemon/
H A Dlemon.c772 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
834 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
964 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
965 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1015 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2365 msp->nsubsym = 1; in parseonetoken()
2371 msp->nsubsym++; in parseonetoken()
2690 msp->nsubsym++; in parseonetoken()
3057 for(j=1; j<sp->nsubsym; j++){ in Reprint()
3084 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/textproc/multimarkdown/MultiMarkdown-6-6.6.0/lemon/
H A Dlemon.c772 for(j=0; j<sp->nsubsym; j++){
834 for(j=0; j<s2->nsubsym; j++){
964 if( a->nsubsym!=b->nsubsym ) return 0;
965 for(i=0; i<a->nsubsym; i++){
1015 for(i=0; i<sp->nsubsym; i++){
2364 msp->nsubsym = 1;
2370 msp->nsubsym++;
2667 msp->nsubsym++;
3034 for(j=1; j<sp->nsubsym; j++){
3061 for(j=1; j<sp->nsubsym; j++){
[all …]
/dports/databases/sqlite3/sqlite-src-3350500/tool/
H A Dlemon.c819 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
881 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1011 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1012 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1062 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2436 msp->nsubsym = 1; in parseonetoken()
2442 msp->nsubsym++; in parseonetoken()
2766 msp->nsubsym++; in parseonetoken()
3239 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3296 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/thirdparty/lemon/
H A Dlemon.c819 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
881 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1011 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1012 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1062 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2436 msp->nsubsym = 1; in parseonetoken()
2442 msp->nsubsym++; in parseonetoken()
2766 msp->nsubsym++; in parseonetoken()
3239 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3296 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/sqlite/src/tool/
H A Dlemon.c818 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
880 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1010 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1011 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1061 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2432 msp->nsubsym = 1; in parseonetoken()
2438 msp->nsubsym++; in parseonetoken()
2760 msp->nsubsym++; in parseonetoken()
3122 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3179 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/net/wireshark-lite/wireshark-3.6.1/tools/lemon/
H A Dlemon.c820 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
882 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1018 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1019 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1069 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2445 msp->nsubsym = 1; in parseonetoken()
2451 msp->nsubsym++; in parseonetoken()
2775 msp->nsubsym++; in parseonetoken()
3248 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3305 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/sqlite/src/tool/
H A Dlemon.c819 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
881 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1011 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1012 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1062 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2436 msp->nsubsym = 1; in parseonetoken()
2442 msp->nsubsym++; in parseonetoken()
2766 msp->nsubsym++; in parseonetoken()
3239 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3296 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/devel/lemon/lemon-3.34/
H A Dlemon.c819 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
881 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1011 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1012 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1062 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2436 msp->nsubsym = 1; in parseonetoken()
2442 msp->nsubsym++; in parseonetoken()
2766 msp->nsubsym++; in parseonetoken()
3239 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3296 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/net/wireshark/wireshark-3.6.1/tools/lemon/
H A Dlemon.c820 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
882 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1018 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1019 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1069 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2445 msp->nsubsym = 1; in parseonetoken()
2451 msp->nsubsym++; in parseonetoken()
2775 msp->nsubsym++; in parseonetoken()
3248 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3305 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/net/tshark-lite/wireshark-3.6.1/tools/lemon/
H A Dlemon.c820 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
882 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1018 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1019 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1069 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2445 msp->nsubsym = 1; in parseonetoken()
2451 msp->nsubsym++; in parseonetoken()
2775 msp->nsubsym++; in parseonetoken()
3248 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3305 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/net/tshark/wireshark-3.6.1/tools/lemon/
H A Dlemon.c820 for(j=0; j<sp->nsubsym; j++){
882 for(j=0; j<s2->nsubsym; j++){
1018 if( a->nsubsym!=b->nsubsym ) return 0;
1019 for(i=0; i<a->nsubsym; i++){
1069 for(i=0; i<sp->nsubsym; i++){
2445 msp->nsubsym = 1;
2451 msp->nsubsym++;
2775 msp->nsubsym++;
3248 for(j=1; j<sp->nsubsym; j++){
3305 for(j=1; j<sp->nsubsym; j++){
[all …]
/dports/graphics/pikchr/pikchr-90b6d5b4a3/
H A Dlemon.c819 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
881 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
1011 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
1012 for(i=0; i<a->nsubsym; i++){ in same_symbol()
1062 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
2436 msp->nsubsym = 1; in parseonetoken()
2442 msp->nsubsym++; in parseonetoken()
2766 msp->nsubsym++; in parseonetoken()
3239 for(j=1; j<sp->nsubsym; j++){ in rule_print()
3296 for(j=1; j<sp->nsubsym; j++){ in RulePrint()
[all …]
/dports/databases/db5/db-5.3.28/lang/sql/sqlite/tool/
H A Dlemon.c667 for(j=0; j<sp->nsubsym; j++){ in FindRulePrecedences()
728 for(j=0; j<s2->nsubsym; j++){ in FindFirstSets()
858 if( a->nsubsym!=b->nsubsym ) return 0; in same_symbol()
859 for(i=0; i<a->nsubsym; i++){ in same_symbol()
909 for(i=0; i<sp->nsubsym; i++){ in buildshifts()
1280 for(k=0; k<xsp->nsubsym; k++){ in Configlist_closure()
2168 msp->nsubsym = 1; in parseonetoken()
2174 msp->nsubsym++; in parseonetoken()
2818 for(j=1; j<sp->nsubsym; j++){ in Reprint()
2844 for(j=1; j<sp->nsubsym; j++){ in ConfigPrint()
[all …]
/dports/databases/xapian-core12/xapian-core-1.2.25/queryparser/
H A Dlemon.c599 for(j=0; j<sp->nsubsym; j++){
661 for(j=0; j<s2->nsubsym; j++){
795 if( a->nsubsym!=b->nsubsym ) return 0;
796 for(i=0; i<a->nsubsym; i++){
848 for(i=0; i<sp->nsubsym; i++){
1225 for(k=0; k<xsp->nsubsym; k++){
2199 msp->nsubsym = 1;
2205 msp->nsubsym++;
2837 for(j=1; j<sp->nsubsym; j++){
2865 for(j=1; j<sp->nsubsym; j++){
[all …]
/dports/games/zdoom/zdoom-2.8.1/tools/lemon/
H A Dlemon.c595 for(j=0; j<sp->nsubsym; j++){
657 for(j=0; j<s2->nsubsym; j++){
791 if( a->nsubsym!=b->nsubsym ) return 0;
792 for(i=0; i<a->nsubsym; i++){
844 for(i=0; i<sp->nsubsym; i++){
1222 for(k=0; k<xsp->nsubsym; k++){
2166 msp->nsubsym = 1;
2172 msp->nsubsym++;
2777 for(j=1; j<sp->nsubsym; j++){
2805 for(j=1; j<sp->nsubsym; j++){
[all …]

12