| /external/libnfc-nci/ |
| D | Android.mk | 11 NFA := src/nfa
33 $(LOCAL_PATH)/$(NFA)/include \
34 $(LOCAL_PATH)/$(NFA)/int \
41 $(call all-c-files-under, $(NFA)/ce $(NFA)/dm $(NFA)/ee) \
42 $(call all-c-files-under, $(NFA)/hci $(NFA)/int $(NFA)/p2p $(NFA)/rw $(NFA)/sys) \
73 $(LOCAL_PATH)/$(NFA)/include \
|
| /external/regex-re2/re2/ |
| D | nfa.cc | 34 class NFA { class
36 NFA(Prog* prog);
37 ~NFA();
125 DISALLOW_EVIL_CONSTRUCTORS(NFA);
128 NFA::NFA(Prog* prog) { in NFA() function in re2::NFA
146 NFA::~NFA() { in ~NFA()
157 void NFA::FreeThread(Thread *t) { in FreeThread()
164 NFA::Thread* NFA::AllocThread() { in AllocThread()
175 void NFA::CopyCapture(const char** dst, const char** src) { in CopyCapture()
186 void NFA::AddToThreadq(Threadq* q, int id0, int flag, in AddToThreadq()
[all …]
|
| /external/chromium_org/third_party/re2/re2/ |
| D | nfa.cc | 34 class NFA { class
36 NFA(Prog* prog);
37 ~NFA();
125 DISALLOW_EVIL_CONSTRUCTORS(NFA);
128 NFA::NFA(Prog* prog) { in NFA() function in re2::NFA
146 NFA::~NFA() { in ~NFA()
157 void NFA::FreeThread(Thread *t) { in FreeThread()
164 NFA::Thread* NFA::AllocThread() { in AllocThread()
175 void NFA::CopyCapture(const char** dst, const char** src) { in CopyCapture()
186 void NFA::AddToThreadq(Threadq* q, int id0, int flag, in AddToThreadq()
[all …]
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestDFAMatching.java | 31 import org.antlr.analysis.NFA;
52 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER); in testSimpleAltCharTest()
79 checkPrediction(dfa,"q", NFA.INVALID_ALT_NUMBER); in testFiniteCommonLeftPrefixes()
92 checkPrediction(dfa,".2", NFA.INVALID_ALT_NUMBER); in testSimpleLoops()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | NFA.java | 38 public class NFA { class
49 public NFA(Grammar g) { in NFA() method in NFA
|
| D | DFAState.java | 67 public static final int PREDICTED_ALT_UNSET = NFA.INVALID_ALT_NUMBER-1;
429 int alt = NFA.INVALID_ALT_NUMBER; in getUniquelyPredictedAlt()
439 if ( alt==NFA.INVALID_ALT_NUMBER ) { in getUniquelyPredictedAlt()
443 return NFA.INVALID_ALT_NUMBER; in getUniquelyPredictedAlt()
455 int alt = NFA.INVALID_ALT_NUMBER; in getUniqueAlt()
459 if ( alt==NFA.INVALID_ALT_NUMBER ) { in getUniqueAlt()
463 return NFA.INVALID_ALT_NUMBER; in getUniqueAlt()
|
| D | NFAState.java | 57 public NFA nfa = null;
108 public NFAState(NFA nfa) { in NFAState()
|
| D | LL1DFA.java | 107 s.cachedUniquelyPredicatedAlt = NFA.INVALID_ALT_NUMBER; in LL1DFA()
|
| D | NFAToDFAConverter.java | 289 if ( t.getUniqueAlt()==NFA.INVALID_ALT_NUMBER ) { in findNewDFAStatesAndAddDFATransitions()
971 if ( alt!=NFA.INVALID_ALT_NUMBER ) { // uniquely predicts an alt? in addDFAStateToWorkList()
|
| D | DFA.java | 154 public NFA nfa;
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| D | nfa.st | 1 digraph NFA {
|
| D | dfa.st | 1 digraph NFA {
|
| D | dot.stg | 34 digraph NFA {
43 digraph NFA {
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| D | ACyclicDFACodeGenerator.java | 95 int EOTPredicts = NFA.INVALID_ALT_NUMBER; in walkFixedDFAGeneratingStateMachine()
158 if ( EOTPredicts!=NFA.INVALID_ALT_NUMBER ) { in walkFixedDFAGeneratingStateMachine()
|
| D | CodeGenerator.java | 1291 if ( EOTPredicts==NFA.INVALID_ALT_NUMBER ) { in canGenerateSwitch()
|
| /external/chromium_org/third_party/re2/patches/ |
| D | remove-valgrind-code.patch | 13 "if the NFA would be faster (for testing).");
|
| D | re2-msvc9-chrome.patch | 103 // If this happens too often, RE2 falls back on the NFA implementation.
|
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| D | TreeToNFAConverter.g | 33 /** Build an NFA from a tree representing an ANTLR grammar. */
56 /** Which NFA object are we filling in? */
57 protected NFA nfa = null;
59 /** Which grammar are we converting an NFA for? */
69 public TreeToNFAConverter(TreeNodeStream input, Grammar g, NFA nfa, NFAFactory factory) {
552 // for NFA construction
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | Interpreter.java | 246 if ( predictedAlt == NFA.INVALID_ALT_NUMBER ) { in parseEngine()
429 return NFA.INVALID_ALT_NUMBER; in predict()
|
| D | NFAFactory.java | 50 NFA nfa = null;
62 public NFAFactory(NFA nfa) { in NFAFactory()
|
| D | Grammar.java | 296 public NFA nfa;
971 nfa = new NFA(this); in createRuleStartAndStopNFAStates()
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
| D | en.stg | 238 <paths:{ it | alt <it.alt> via NFA path <it.states; separator=","><\n>}>
280 <paths:{ it | alt <it.alt> via NFA path <it.states; separator=","><\n>}>
|
| /external/antlr/antlr-3.4/tool/ |
| D | CHANGES.txt | 63 * Added option -Xconversiontimeout back in. Turns out we hit NFA conversion
580 * an NFA target of EOF predicate transition in DFA cause an exception in
754 * actions are now added to the NFA.
1090 the same input sequence reaches multiple locations in the NFA
1092 NFA states to look for more input. Commonly at EOF target states.
1117 wacking NFA configurations etc in each DFA state after DFA construction.
1244 src/org/antlr/analysis/NFA.java # edit
1245 NFA now span multiple grammars and so I moved the NFAs state
1346 NFA state numbers and unique token types. This keeps a tree
1720 * Changed (hidden) option -verbose to -Xnfastates; this just prints out the NFA states along each n…
[all …]
|
| /external/antlr/antlr-3.4/runtime/C/ |
| D | README | 234 -nfa generate an NFA for each rule
718 * made epsilon edges italics in the NFA diagrams.
806 * Fixed bug where EOT transitions led to no NFA configs in a DFA state,
1044 * Added NFA->DFA conversion early termination report to the -report option
1048 * Added a dozen unit tests to test autobacktrack NFA construction.
1192 generated NFA.
1319 * Fixed NFA construction so it generates NFA for (A*)* such that ANTLRWorks
|
| /external/pcre/dist/ |
| D | HACKING | 37 matches individual wild portions of the pattern. This is an "NFA algorithm" in
107 it implements an NFA algorithm, similar to the original Henry Spencer algorithm
|