Searched refs:transition (Results 1 - 25 of 143) sorted by relevance

123456

/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
H A DSimpleCLexer.m116 if (!(transition = calloc(33, sizeof(void*)))) {
121 transition[0] = dfa4_transition5;
122 transition[1] = dfa4_transition;
123 transition[2] = dfa4_transition;
124 transition[3] = dfa4_transition;
125 transition[4] = dfa4_transition;
126 transition[5] = dfa4_transition;
127 transition[6] = dfa4_transition;
128 transition[7] = dfa4_transition11;
129 transition[
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DNFAState.java48 public Transition[] transition = new Transition[MAX_TRANSITIONS]; field in class:NFAState
100 /** Is this state the sole target of an EOT transition? */
118 throw new IllegalArgumentException("You can't add a null transition");
120 if ( numTransitions>transition.length ) {
121 throw new IllegalArgumentException("You can only have "+transition.length+" transitions");
124 transition[numTransitions] = e;
139 * transition another state has.
143 throw new IllegalArgumentException("You can't use a solitary null transition");
145 transition[0] = e;
146 transition[
150 public Transition transition(int i) { method in class:NFAState
[all...]
H A DState.java45 public abstract Transition transition(int i); method in class:State
H A DLL1Analyzer.java199 if ( s.transition[0] instanceof RuleClosureTransition ) {
200 System.out.println("go to rule "+((NFAState)s.transition[0].target).enclosingRule);
218 Transition transition0 = s.transition[0];
232 // compute FIRST of transition 0
234 // if transition 0 is a rule call and we don't want FOLLOW, check cache
242 // save FIRST cache for transition 0 if rule call
270 Transition transition1 = s.transition[1];
314 Transition transition0 = s.transition[0];
375 Transition transition1 = s.transition[1];
410 Transition transition0 = s.transition[
[all...]
H A DLL1DFA.java115 // add a transition to pred target from d
120 NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
159 NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
161 if ( altStartState.transition[0].isSemanticPredicate() ) {
162 SemanticContext ctx = altStartState.transition[0].label.getSemanticContext();
168 ((SemanticContext.Predicate)altStartState.transition[0].label.getSemanticContext()).predicateAST);
173 return (SemanticContext.Predicate)altStartState.transition[0].label.getSemanticContext();
H A DDFA.java171 /** Map an edge transition table to a unique set number; ordered so
173 * and then ref them from within the transition[][] table. Like this
188 /** The unique edge transition class number; every time we see a new
191 * some of the big edge transition tables are seen about 57 times.
195 /* This DFA can be converted to a transition[state][char] table and
214 public Vector transition; field in class:DFA
330 if ( transition==null || transition.size()==0 ) {
333 List encoded = new ArrayList(transition.size());
334 // walk Vector<Vector<FormattedInteger>> which is the transition[][] tabl
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/output1/
H A DSymbolTableLexer.m103 if (!(transition = calloc(21, sizeof(void*)))) {
108 transition[0] = dfa4_transition0;
109 transition[1] = dfa4_transition6;
110 transition[2] = dfa4_transition;
111 transition[3] = dfa4_transition;
112 transition[4] = dfa4_transition;
113 transition[5] = dfa4_transition;
114 transition[6] = dfa4_transition;
115 transition[7] = dfa4_transition;
116 transition[
[all...]
/external/skia/bench/DATA/skia_resources/
H A Dslides_utils.lua34 if slide.transition then
35 io.write(" transition = \"", slide.transition, "\",\n")
79 local transition_type = parse_attr(s, "transition")
82 block["transition"] = transition_type
/external/skia/dm/DATA/skia_resources/
H A Dslides_utils.lua34 if slide.transition then
35 io.write(" transition = \"", slide.transition, "\",\n")
79 local transition_type = parse_attr(s, "transition")
82 block["transition"] = transition_type
/external/skia/gm/DATA/skia_resources/
H A Dslides_utils.lua34 if slide.transition then
35 io.write(" transition = \"", slide.transition, "\",\n")
79 local transition_type = parse_attr(s, "transition")
82 block["transition"] = transition_type
/external/skia/resources/
H A Dslides_utils.lua34 if slide.transition then
35 io.write(" transition = \"", slide.transition, "\",\n")
79 local transition_type = parse_attr(s, "transition")
82 block["transition"] = transition_type
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Ddfa.py38 """@brief A DFA implemented as a set of transition tables.
49 eot, eof, min, max, accept, special, transition
61 self.transition = transition
91 # look for a normal char transition
99 snext = self.transition[s][c-self.min[s]]
103 #print "not a normal transition"
104 # was in range but not a normal transition
/external/antlr/antlr-3.4/runtime/Python/unittests/
H A Dtestdfa.py38 transition=[]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRDFA.h40 const int **transition; variable
77 @property const int **transition; variable
/external/v8/test/mjsunit/
H A Delements-transition.js111 function transition(x) { x[0] = 1.5; } function
114 transition(ignore); // Handled by runtime.
117 transition(a); // Handled by IC.
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3cyclicdfa.h83 const ANTLR3_INT32 * const * const transition; member in struct:ANTLR3_CYCLIC_DFA_struct
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DDFA.cs40 /** <summary>A DFA implemented as a set of transition tables.</summary>
67 protected short[][] transition; field in class:Antlr.Runtime.DFA
117 // look for a normal char transition
120 int snext = transition[s][c - min[s]]; // move to next state
122 // was in range but not a normal transition
128 Console.Error.WriteLine("EOT transition");
147 Console.Error.WriteLine("EOT transition");
163 for (int p = 0; p < transition[s].Length; p++) {
164 Console.Error.Write(transition[s][p] + " ");
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
H A DDFA.cs41 /** <summary>A DFA implemented as a set of transition tables.</summary>
62 protected short[][] transition; field in class:Antlr.Runtime.DFA
139 // look for a normal char transition
143 int snext = transition[s][c - min[s]]; // move to next state
146 // was in range but not a normal transition
153 Console.Error.WriteLine( "EOT transition" );
173 Console.Error.WriteLine( "EOT transition" );
191 for ( int p = 0; p < transition[s].Length; p++ )
193 Console.Error.Write( transition[s][p] + " " );
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
H A DDFA.java30 /** A DFA implemented as a set of transition tables.
48 protected short[][] transition; field in class:DFA
96 // look for a normal char transition
99 int snext = transition[s][c-min[s]]; // move to next state
101 // was in range but not a normal transition
106 if ( debug ) System.err.println("EOT transition");
124 if ( debug ) System.err.println("EOT transition");
139 for (int p=0; p<transition[s].length; p++) {
140 System.err.print(transition[s][p]+" ");
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
H A Dtest-dfa.rb30 dfa.transition.should == DFASubclass::TRANSITION
/external/icu/icu4c/source/layout/
H A DThaiShaping.cpp145 le_uint8 ThaiShaping::doTransition (StateTransition transition, LEUnicode currChar, le_int32 inputIndex, le_uint8 glyphSet, argument
150 switch (transition.action) {
225 return transition.nextState;
231 StateTransition transition; local
234 transition = getTransition(prevState, charClass);
236 return doTransition(transition, ch, inputIndex, glyphSet, errorChar, output, glyphStorage, outputIndex);
242 StateTransition transition = getTransition(prevState, charClass); local
244 switch (transition.action) {
H A DHangulLayoutEngine.cpp252 const StateTransition transition = stateTable[state][chClass]; local
256 if ((transition.actionFlags & AF_T) != 0) {
263 if ((transition.actionFlags & AF_L) != 0) {
269 if ((transition.actionFlags & AF_V) != 0) {
275 if ((transition.actionFlags & AF_T) != 0) {
282 state = transition.newState;
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DDFA.as3 /** A DFA implemented as a set of transition tables.
21 protected var transition:Array; // short[][]
33 eot:Array, eof:Array, min:Array, max:Array, accept:Array, special:Array, transition:Array,
45 this.transition = transition;
94 // look for a normal char transition
97 var snext:int = transition[s][c-min[s]]; // move to next state
99 // was in range but not a normal transition
104 if ( debug ) trace("EOT transition");
122 if ( debug ) trace("EOT transition");
[all...]
/external/chromium-trace/trace-viewer/tracing/third_party/tvcm/third_party/rjsmin/bench/
H A Dbootstrap.js5 * bootstrap-transition.js v2.0.4
34 $.support.transition = (function () {
44 , 'transition' : 'transitionend'
126 $.support.transition && $parent.hasClass('fade') ?
127 $parent.on($.support.transition.end, removeElement) :
351 if ($.support.transition && this.$element.hasClass('slide')) {
358 this.$element.one($.support.transition.end, function () {
485 this.transition('addClass', $.Event('show'), 'shown')
494 this.transition('removeClass', $.Event('hide'), 'hidden')
511 , transition
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Ddfa.rb55 value against the transition parameters associated with the current state, and
57 machine cannot transition any further. If the machine cannot transition any
70 a transition for state +s+
73 a transition for state +s+
78 If positive, it specifies a state transition in
105 :accept, :special, :transition, :special_block
109 :accept, :special, :transition
147 transition = nil, &special_block )
156 @transition
[all...]

Completed in 1403 milliseconds

123456