/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/ |
DLexer.h | 56 automaton = m;
60 sprintf((char *)ebuf,"Invalid automaton mode = %d ",m);
81 /* interactive version of automaton */
83 state = newstate = dfa_base[automaton];
97 if ((state != dfa_base[automaton]) && (newstate == DfaStates)){
106 if ( state == dfa_base[automaton] ){
111 else { /* non-interactive version of automaton */
116 state = dfa_base[automaton];
125 if ( state == dfa_base[automaton] ){
164 /* MR1 */ automaton);
[all...] |
dlgdef.h | 90 extern void zzmode(int k); /* switch to automaton 'k' */
111 extern void zzmode(/*k*/); /* switch to automaton 'k' */
|
DLexerBase.cpp | 77 this->automaton = 0;
93 this->automaton = 0;
113 state->auto_num = automaton;
137 automaton = state->auto_num;
|
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/ |
DLexer.cpp | 51 automaton = m;
55 sprintf((char *)ebuf,"Invalid automaton mode = %d ",m);
76 /* interactive version of automaton */
78 state = newstate = dfa_base[automaton];
92 if ((state != dfa_base[automaton]) && (newstate == DfaStates)){
101 if ( state == dfa_base[automaton] ){
106 else { /* non-interactive version of automaton */
111 state = dfa_base[automaton];
119 if ( state == dfa_base[automaton] ){
158 /* MR1 */ automaton);
[all...] |
dlgdef.h | 90 extern void zzmode(int k); /* switch to automaton 'k' */
111 extern void zzmode(/*k*/); /* switch to automaton 'k' */
|
DLexerBase.cpp | 76 this->automaton = 0;
92 this->automaton = 0;
112 state->auto_num = automaton;
136 automaton = state->auto_num;
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is
4 created. The linear automaton traverses the linear paths from the
18 """Class for a node of the Aho-Corasick automaton used in matching"""
39 to the matcher(a common Aho-Corasick automaton). The fixer is
50 "Recursively adds a linear pattern to the AC automaton"
86 automaton. Nodes are only checked once as the tree is
87 retraversed. When the automaton fails, we give it one more
125 #matching failed, reset automaton
145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/ |
rexpr.h | 24 int match( NodePtr automaton, char *s );
|
/external/python/cpython2/Lib/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is 4 created. The linear automaton traverses the linear paths from the 18 """Class for a node of the Aho-Corasick automaton used in matching""" 39 to the matcher(a common Aho-Corasick automaton). The fixer is 50 "Recursively adds a linear pattern to the AC automaton" 86 automaton. Nodes are only checked once as the tree is 87 retraversed. When the automaton fails, we give it one more 125 #matching failed, reset automaton 145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/external/python/cpython3/Lib/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is 4 created. The linear automaton traverses the linear paths from the 18 """Class for a node of the Aho-Corasick automaton used in matching""" 39 to the matcher(a common Aho-Corasick automaton). The fixer is 50 "Recursively adds a linear pattern to the AC automaton" 86 automaton. Nodes are only checked once as the tree is 87 retraversed. When the automaton fails, we give it one more 125 #matching failed, reset automaton 145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is 4 created. The linear automaton traverses the linear paths from the 18 """Class for a node of the Aho-Corasick automaton used in matching""" 39 to the matcher(a common Aho-Corasick automaton). The fixer is 50 "Recursively adds a linear pattern to the AC automaton" 86 automaton. Nodes are only checked once as the tree is 87 retraversed. When the automaton fails, we give it one more 125 #matching failed, reset automaton 145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is 4 created. The linear automaton traverses the linear paths from the 18 """Class for a node of the Aho-Corasick automaton used in matching""" 39 to the matcher(a common Aho-Corasick automaton). The fixer is 50 "Recursively adds a linear pattern to the AC automaton" 86 automaton. Nodes are only checked once as the tree is 87 retraversed. When the automaton fails, we give it one more 125 #matching failed, reset automaton 145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is 4 created. The linear automaton traverses the linear paths from the 18 """Class for a node of the Aho-Corasick automaton used in matching""" 39 to the matcher(a common Aho-Corasick automaton). The fixer is 50 "Recursively adds a linear pattern to the AC automaton" 86 automaton. Nodes are only checked once as the tree is 87 retraversed. When the automaton fails, we give it one more 125 #matching failed, reset automaton 145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
btm_matcher.py | 3 their rarest linear path, a linear Aho-Corasick automaton is 4 created. The linear automaton traverses the linear paths from the 18 """Class for a node of the Aho-Corasick automaton used in matching""" 39 to the matcher(a common Aho-Corasick automaton). The fixer is 50 "Recursively adds a linear pattern to the AC automaton" 86 automaton. Nodes are only checked once as the tree is 87 retraversed. When the automaton fails, we give it one more 125 #matching failed, reset automaton 145 "Prints a graphviz diagram of the BM automaton(for debugging)"
|
/external/skia/src/sksl/lex/ |
NFA.h | 15 * A nondeterministic finite automaton for matching regular expressions. The NFA is initialized with 20 * Adds a new regular expression to the set of expressions matched by this automaton, returning
|
DFA.h | 15 * Tables representing a deterministic finite automaton for matching regular expressions.
|
/external/skqp/src/sksl/lex/ |
NFA.h | 15 * A nondeterministic finite automaton for matching regular expressions. The NFA is initialized with 20 * Adds a new regular expression to the set of expressions matched by this automaton, returning
|
DFA.h | 15 * Tables representing a deterministic finite automaton for matching regular expressions.
|
/external/scapy/test/tls/ |
travis_test_server.py | 57 # Prepare automaton 63 # Run server automaton
|
tests_tls_netaccess.uts | 7 + TLS server automaton tests 86 + TLS client automaton tests
|
/external/scapy/scapy/ |
all.py | 35 from scapy.automaton import *
|
/external/scapy/scapy/modules/krack/ |
__init__.py | 28 from scapy.modules.krack.automaton import KrackAP
|
/external/scapy/scapy/layers/ |
tftp.py | 14 from scapy.automaton import * 121 class TFTP_read(Automaton): 123 Automaton.parse_args(self, **kargs) 213 class TFTP_write(Automaton): 215 Automaton.parse_args(self, **kargs) 294 class TFTP_WRQ_server(Automaton): 297 Automaton.parse_args(self, *args, **kargs) 371 class TFTP_RRQ_server(Automaton): 373 Automaton.parse_args(self,**kargs)
|
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/dlg/ |
dlg.1 | 35 The automaton will treat upper and lower case characters identically.
36 This is accomplished in the automaton; the characters in the lexical
|
/external/libxml2/os400/iconv/ |
README.iconv | 39 finite automaton from the files mentioned above into a C file for all 44 with libxml2, the generated automaton is stored within sources and need not
|