Searched refs:automaton (Results 1 – 9 of 9) sorted by relevance
51 automaton = m; in mode()78 state = newstate = dfa_base[automaton]; in nextTokenType()92 if ((state != dfa_base[automaton]) && (newstate == DfaStates)){ in nextTokenType()101 if ( state == dfa_base[automaton] ){ in nextTokenType()111 state = dfa_base[automaton]; in nextTokenType()119 if ( state == dfa_base[automaton] ){ in nextTokenType()158 /* MR1 */ automaton); in nextTokenType()
76 this->automaton = 0; in DLGLexerBase()92 this->automaton = 0; in reset()112 state->auto_num = automaton; in saveState()136 automaton = state->auto_num; in restoreState()
141 int automaton; variable
56 automaton = m; in mode()83 state = newstate = dfa_base[automaton]; in nextTokenType()97 if ((state != dfa_base[automaton]) && (newstate == DfaStates)){ in nextTokenType()106 if ( state == dfa_base[automaton] ){ in nextTokenType()116 state = dfa_base[automaton]; in nextTokenType()125 if ( state == dfa_base[automaton] ){ in nextTokenType()164 /* MR1 */ automaton); in nextTokenType()
77 this->automaton = 0; in DLGLexerBase()93 this->automaton = 0; in reset()113 state->auto_num = automaton; in saveState()137 automaton = state->auto_num; in restoreState()
145 int automaton; variable
24 int match( NodePtr automaton, char *s );
149 static int match(NodePtr automaton,char *s) in match() argument151 static int match(automaton, s) in match()152 NodePtr automaton; in match()158 if ( automaton == accept && *s == '\0' ) return 1; /* match */160 for (p=automaton->arcs; p!=NULL; p=p->next) /* try all arcs */
47 -ci The automaton will treat upper and lower case charac-