| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | dfa.cc | 67 class DFA { class
69 DFA(Prog* prog, Prog::MatchKind kind, int64_t max_mem);
70 ~DFA();
347 DFA(const DFA&) = delete;
348 DFA& operator=(const DFA&) = delete;
371 class DFA::Workq : public SparseSet {
423 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64_t max_mem) in DFA() function in re2::DFA
442 mem_budget_ -= sizeof(DFA); in DFA()
472 DFA::~DFA() { in ~DFA()
493 std::string DFA::DumpWorkq(Workq* q) { in DumpWorkq()
[all …]
|
| /external/antlr/runtime/ActionScript/project/test/org/antlr/runtime/test/ |
| D | TestDFA.as | 4 import org.antlr.runtime.DFA;
12 assertEquals("2,9,9,9", DFA.unpackEncodedString("\x01\x02\x03\x09"));
18 assertEquals("32767,32767,32767", DFA.unpackEncodedString(testVal));
19 assertEquals("32767,32767,32767", DFA.unpackEncodedString(testVal, true));
23 assertEquals("-1,-1", DFA.unpackEncodedString(testVal));
24 assertEquals("65535,65535", DFA.unpackEncodedString(testVal, true));
|
| /external/rust/crates/aho-corasick/src/ |
| D | dfa.rs | 13 pub enum DFA<S> { enum
20 impl<S: StateID> DFA<S> { impl
23 DFA::Standard(ref dfa) => dfa.repr(), in repr()
24 DFA::ByteClass(ref dfa) => dfa.repr(), in repr()
25 DFA::Premultiplied(ref dfa) => dfa.repr(), in repr()
26 DFA::PremultipliedByteClass(ref dfa) => dfa.repr(), in repr()
64 DFA::Standard(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
71 DFA::ByteClass(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
78 DFA::Premultiplied(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
85 DFA::PremultipliedByteClass(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
[all …]
|
| D | ahocorasick.rs | 5 use dfa::{self, DFA};
1027 Imp::DFA(ref dfa) => dfa.heap_bytes(), in heap_bytes()
1038 DFA(DFA<S>), enumerator
1046 Imp::DFA(ref dfa) => dfa.match_kind(), in match_kind()
1054 Imp::DFA(ref dfa) => dfa.start_state(), in start_state()
1064 Imp::DFA(ref dfa) => dfa.max_pattern_len(), in max_pattern_len()
1074 Imp::DFA(ref dfa) => dfa.pattern_count(), in pattern_count()
1083 Imp::DFA(ref dfa) => dfa.prefilter(), in prefilter()
1113 Imp::DFA(ref dfa) => dfa.overlapping_find_at( in overlapping_find_at()
1135 Imp::DFA(ref dfa) => { in earliest_find_at()
[all …]
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestDFAMatching.java | 30 import org.antlr.analysis.DFA;
50 DFA dfa = g.getLookaheadDFA(1); in testSimpleAltCharTest()
63 DFA dfa = g.getLookaheadDFA(1); in testSets()
77 DFA dfa = g.getLookaheadDFA(1); in testFiniteCommonLeftPrefixes()
91 DFA dfa = g.getLookaheadDFA(3); in testSimpleLoops()
97 protected void checkPrediction(DFA dfa, String input, int expected) in checkPrediction()
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| D | JavaScript.stg | 40 …<cyclicDFAs:{dfa | this.dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNum…
78 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
165 …<cyclicDFAs:{dfa | this.dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNum…
215 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
604 * number. A DFA predicts the alternative and then a simple switch
843 /** Same as a normal DFA state except that we don't examine lookahead
853 /** A DFA state that is actually the loopback decision of a closure
888 /** A DFA state where a SWITCH may be generated. The code generator
932 /** The code to initiate execution of a cyclic DFA; this is used
933 * in the rule to predict an alt just like the fixed DFA case.
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| D | Java.stg | 129 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
130 <cyclicDFAs:cyclicDFA(); separator="\n\n"><! dump tables for all DFA !>
259 …<cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisio…
260 <cyclicDFAs:cyclicDFA(); separator="\n\n"><! dump tables for all DFA !>
664 * number. A DFA predicts the alternative and then a simple switch
957 /** Same as a normal DFA state except that we don't examine lookahead
967 /** A DFA state that is actually the loopback decision of a closure
1002 /** A DFA state where a SWITCH may be generated. The code generator
1048 /** The code to initiate execution of a cyclic DFA; this is used
1049 * in the rule to predict an alt just like the fixed DFA case.
[all …]
|
| /external/antlr/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| D | SimpleCLexer.java | 695 static final short[] DFA4_eot = DFA.unpackEncodedString(DFA4_eotS);
696 static final short[] DFA4_eof = DFA.unpackEncodedString(DFA4_eofS);
697 static final char[] DFA4_min = DFA.unpackEncodedStringToUnsignedChars(DFA4_minS);
698 static final char[] DFA4_max = DFA.unpackEncodedStringToUnsignedChars(DFA4_maxS);
699 static final short[] DFA4_accept = DFA.unpackEncodedString(DFA4_acceptS);
700 static final short[] DFA4_special = DFA.unpackEncodedString(DFA4_specialS);
707 DFA4_transition[i] = DFA.unpackEncodedString(DFA4_transitionS[i]);
711 class DFA4 extends DFA {
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| D | Scala.stg | 72 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
111 …<cyclicDFAs:{dfa | private val dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.deci…
194 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
240 …<cyclicDFAs:{dfa | private val dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.deci…
630 * number. A DFA predicts the alternative and then a simple switch
901 /** Same as a normal DFA state except that we don't examine lookahead
911 /** A DFA state that is actually the loopback decision of a closure
946 /** A DFA state where a SWITCH may be generated. The code generator
990 /** The code to initiate execution of a cyclic DFA; this is used
991 * in the rule to predict an alt just like the fixed DFA case.
[all …]
|
| /external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/ |
| D | DFA.as | 3 /** A DFA implemented as a set of transition tables.
12 * lexer's Tokens rule DFA has 326 states roughly.
14 public class DFA { class in org.antlr.runtime
25 /** Which recognizer encloses this DFA? Needed to check backtracking */
32 public function DFA(recognizer:BaseRecognizer, decisionNumber:int, description:String, method in org.antlr.runtime.DFA
57 * using this DFA (representing the covering regular approximation
63 trace("Enter DFA.predict for decision "+decisionNumber);
70 …if ( debug ) trace("DFA "+decisionNumber+" state "+s+" LA(1)="+String.fromCharCode(input.LA(1))+"(…
75 trace("DFA "+decisionNumber+
80 trace("DFA "+decisionNumber+
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| D | CSharp3.stg | 187 #region DFA
188 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
193 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
196 <cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
346 #region DFA
347 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
352 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
355 <cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
356 #endregion DFA
890 * number. A DFA predicts the alternative and then a simple switch
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| D | CSharp2.stg | 192 #region DFA
193 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
198 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateS…
201 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
354 #region DFA
355 <cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
360 …<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialState…
363 <cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
364 #endregion DFA
914 * number. A DFA predicts the alternative and then a simple switch
[all …]
|
| /external/antlr/runtime/JavaScript/src/org/antlr/runtime/ |
| D | DFA.js | 12 org.antlr.runtime.DFA = function() {}; class in org.antlr.runtime
14 org.antlr.runtime.DFA.prototype = {
119 org.antlr.lang.augmentObject(org.antlr.runtime.DFA, {
147 return org.antlr.runtime.DFA.unpackEncodedString(encodedString);
|
| /external/rust/crates/regex-automata/src/ |
| D | codegen.rs | 13 use dense::DFA;
24 pub fn is_match_forward<S: StateID>(dfa: &DFA<S>) -> String { in is_match_forward()
71 dfa: &DFA<S>, in state_enum_def()
95 fn state_variant_names<S: StateID>(dfa: &DFA<S>) -> HashMap<S, String> { in state_variant_names()
|
| D | regex.rs | 3 use dfa::DFA;
58 pub struct Regex<D: DFA = DenseDFA<Vec<usize>, usize>> {
172 impl<D: DFA> Regex<D> {
415 pub struct Matches<'r, 't, D: DFA + 'r> {
422 impl<'r, 't, D: DFA> Matches<'r, 't, D> {
428 impl<'r, 't, D: DFA> Iterator for Matches<'r, 't, D> {
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| D | DFA.cs | 40 public delegate int SpecialStateTransitionHandler( DFA dfa, int s, IIntStream input ); in SpecialStateTransitionHandler()
55 public class DFA class
72 public DFA() in DFA() method in Antlr.Runtime.DFA
77 public DFA( SpecialStateTransitionHandler specialStateTransition ) in DFA() method in Antlr.Runtime.DFA
251 static int SpecialStateTransitionDefault( DFA dfa, int s, IIntStream input ) in SpecialStateTransitionDefault()
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| D | DFA.cs | 38 public delegate int SpecialStateTransitionHandler(DFA dfa, int s, IIntStream input); in SpecialStateTransitionHandler()
53 public class DFA { class
54 public DFA() in DFA() method in Antlr.Runtime.DFA
57 public DFA(SpecialStateTransitionHandler specialStateTransition) { in DFA() method in Antlr.Runtime.DFA
203 static int SpecialStateTransitionDefault(DFA dfa, int s, IIntStream input) { in SpecialStateTransitionDefault()
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| D | Perl5.stg | 67 use ANTLR::Runtime::DFA;
106 $self->dfa<dfa.decisionNumber>(<name>::DFA<dfa.decisionNumber>->new({ recognizer => $self }));
112 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
241 <cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = __PACKAGE__::DFA<dfa.decisionNumber>->new($self);}; se…
242 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
624 * number. A DFA predicts the alternative and then a simple switch
872 /** Same as a normal DFA state except that we don't examine lookahead
882 /** A DFA state that is actually the loopback decision of a closure
917 /** A DFA state where a SWITCH may be generated. The code generator
963 /** The code to initiate execution of a cyclic DFA; this is used
[all …]
|
| /external/antlr/runtime/ObjC/Framework/examples/LL-star/ |
| D | SimpleCParser.h | 25 #pragma mark Cyclic DFA interface start DFA2
26 @interface DFA2 : DFA {
32 #pragma mark Cyclic DFA interface end DFA2
|
| /external/rust/crates/regex/ |
| D | PERFORMANCE.md | 101 *during search*. For example, when executing a DFA, its states are computed
153 leftmost-first match. It can use the DFA matcher for this, but must run it
161 spend a lot of time shuffling states around. The DFA limits the performance hit
203 ## Unicode word boundaries may prevent the DFA from being used
208 It's a sad state of the current implementation. At the moment, the DFA will try
210 If the DFA comes across any non-ASCII byte, it will quit and fall back to an
216 expression. Even though the DFA may not be used, specialized routines will
223 can be transformed into a regex that uses the DFA with `(?-u:\b).+(?-u:\b)`. It
230 boundary in the first place, since the DFA will speculatively interpret it as
232 boundary is used explicitly, then the DFA won't quit in the presence of
[all …]
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | NonLLStarDecisionException.java | 34 public DFA abortedDFA;
35 public NonLLStarDecisionException(DFA abortedDFA) { in NonLLStarDecisionException()
|
| D | AnalysisTimeoutException.java | 32 public DFA abortedDFA;
33 public AnalysisTimeoutException(DFA abortedDFA) { in AnalysisTimeoutException()
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Python3/ |
| D | Python3.stg | 157 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
299 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
742 * number. A DFA predicts the alternative and then a simple switch
998 /** Same as a normal DFA state except that we don't examine lookahead
1008 /** A DFA state that is actually the loopback decision of a closure
1042 /** A DFA state where a SWITCH may be generated. The code generator
1087 /** The code to initiate execution of a cyclic DFA; this is used
1088 * in the rule to predict an alt just like the fixed DFA case.
1095 /* Dump DFA tables as run-length-encoded Strings of octal values.
1100 * encode/decode approach. See analysis and runtime DFA for
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| D | Python.stg | 154 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
292 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
735 * number. A DFA predicts the alternative and then a simple switch
991 /** Same as a normal DFA state except that we don't examine lookahead
1001 /** A DFA state that is actually the loopback decision of a closure
1035 /** A DFA state where a SWITCH may be generated. The code generator
1080 /** The code to initiate execution of a cyclic DFA; this is used
1081 * in the rule to predict an alt just like the fixed DFA case.
1088 /* Dump DFA tables as run-length-encoded Strings of octal values.
1093 * encode/decode approach. See analysis and runtime DFA for
[all …]
|
| /external/antlr/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| D | ActionScript.stg | 101 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
217 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
599 * number. A DFA predicts the alternative and then a simple switch
858 /** Same as a normal DFA state except that we don't examine lookahead
868 /** A DFA state that is actually the loopback decision of a closure
903 /** A DFA state where a SWITCH may be generated. The code generator
947 /** The code to initiate execution of a cyclic DFA; this is used
948 * in the rule to predict an alt just like the fixed DFA case.
957 dfa<dfa.decisionNumber> = new DFA(this, <dfa.decisionNumber>,
959 DFA<dfa.decisionNumber>_eot, DFA<dfa.decisionNumber>_eof, DFA<dfa.decisionNumber>_min,
[all …]
|