Lines Matching full:token
797 token.append(0); // close buffer
813 Buffer_char token;
817 token.reset();
847 token.append(c);
848 token.append(0);
853 case '$' : state = IN_VAR_FIRST; token.append(c); break;
858 } else if (isDigit(c)){ state = IN_NUM; token.append(c);
859 } else if (isAlphabet(c)){ state = IN_STRING; token.append(c);
865 token.append(c);
872 token.append(c);
880 token.append(c);
897 token.append(c);
908 token.append(c); // eat up everything, includes back slash
914 case 'n' : token.append('\n'); break;
915 case 'r' : token.append('\r'); break;
916 case 't' : token.append('\t'); break;
917 case '\'' : token.append('\''); break;
918 case '\\' : token.append('\\'); break;
919 default: token.append(c); // unknown escaping, treat it as literal
946 TokenType & token;
950 if (token == expected) {
951 token = s.getNextToken();
960 if (token == NUMBER){
961 int temp = atoi(s.token);
978 switch (token){
1000 if (token != NUMBER){
1003 min = atoi(s.token);
1005 if (token == RBRACE){
1009 } else if (token == COMMA) {
1011 if (token == RBRACE){
1015 } else if (token == NUMBER) {
1016 max = atoi(s.token);
1069 switch(token){
1077 node = new Variable(&symbols, s.token);
1081 node = new Literal(s.token);
1096 switch(token){
1132 while (token == VAR || token == STRING || token == LPAR){
1142 if (token == SEMI || token == RPAR || token == BAR){
1160 if (token == VAR || token == STRING || token == LPAR){
1174 while (token == NUMBER || token == BAR){
1175 if(token == NUMBER) {
1177 if (token == BAR){
1186 } // else token == BAR
1199 if (token == SEMI || token == RPAR) {
1217 if (token == BAR || token == NUMBER){ // find a real alternation1, create it.
1231 if (token == VAR){
1233 name.append_array(s.token, strlen(s.token) + 1);
1249 token = s.getNextToken();
1252 if (token == STREAM_END){
1263 Parser(const char *const source):s(source), token(s.tokenType){
1559 pass = strcmp( &(t.token[0]), str_r[i++]) == 0;
