• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.10/tcl-105/tcl84/tcl/generic/

Lines Matching defs:lexeme

56     int lexeme;			/* Type of last lexeme scanned in expr.
59 CONST char *start; /* First character in lexeme. */
60 int size; /* Number of bytes in lexeme. */
64 * last one in the previous lexeme. Used to
134 * entries must match the order and number of the lexeme definitions above.
180 fprintf(stderr, "%*s%s: lexeme=%s, next=\"%.20s\"\n", \
182 lexemeStrings[infoPtr->lexeme], infoPtr->next); \
262 info.lexeme = UNKNOWN;
271 * Get the first lexeme then parse the expression.
282 if (info.lexeme != END) {
342 if (infoPtr->lexeme == QUESTY) {
387 if (infoPtr->lexeme != COLON) {
456 while (infoPtr->lexeme == OR) {
517 while (infoPtr->lexeme == AND) {
578 while (infoPtr->lexeme == BIT_OR) {
640 while (infoPtr->lexeme == BIT_XOR) {
702 while (infoPtr->lexeme == BIT_AND) {
752 int firstIndex, lexeme, code;
764 lexeme = infoPtr->lexeme;
765 while ((lexeme == EQUAL) || (lexeme == NEQ)
766 || (lexeme == STREQ) || (lexeme == STRNEQ)) {
784 lexeme = infoPtr->lexeme;
817 int firstIndex, lexeme, operatorSize, code;
829 lexeme = infoPtr->lexeme;
830 while ((lexeme == LESS) || (lexeme == GREATER) || (lexeme == LEQ)
831 || (lexeme == GEQ)) {
833 if ((lexeme == LEQ) || (lexeme == GEQ)) {
853 lexeme = infoPtr->lexeme;
886 int firstIndex, lexeme, code;
898 lexeme = infoPtr->lexeme;
899 while ((lexeme == LEFT_SHIFT) || (lexeme == RIGHT_SHIFT)) {
916 lexeme = infoPtr->lexeme;
949 int firstIndex, lexeme, code;
961 lexeme = infoPtr->lexeme;
962 while ((lexeme == PLUS) || (lexeme == MINUS)) {
979 lexeme = infoPtr->lexeme;
1012 int firstIndex, lexeme, code;
1024 lexeme = infoPtr->lexeme;
1025 while ((lexeme == MULT) || (lexeme == DIVIDE) || (lexeme == MOD)) {
1042 lexeme = infoPtr->lexeme;
1075 int firstIndex, lexeme, code;
1082 lexeme = infoPtr->lexeme;
1083 if ((lexeme == PLUS) || (lexeme == MINUS) || (lexeme == BIT_NOT)
1084 || (lexeme == NOT)) {
1143 int lexeme, exprIndex, firstIndex, numToMove, code;
1150 lexeme = infoPtr->lexeme;
1151 if (lexeme == OPEN_PAREN) {
1160 if (infoPtr->lexeme != CLOSE_PAREN) {
1192 switch (lexeme) {
1405 if (infoPtr->lexeme != OPEN_PAREN) {
1472 while (infoPtr->lexeme != CLOSE_PAREN) {
1478 if (infoPtr->lexeme == COMMA) {
1483 } else if (infoPtr->lexeme != CLOSE_PAREN) {
1522 sprintf(buf, "unexpected operator %s", lexemeStrings[lexeme]);
1529 * Advance to the next lexeme before returning.
1555 * number. If the lexical analysis is successful, infoPtr->lexeme
1557 * infoPtr->next is advanced past the lexeme. Also, if the lexeme is a
1559 * character of the lexeme; otherwise it is set NULL.
1572 * including the resulting lexeme. */
1582 * Record where the previous lexeme ended. Since we always read one
1583 * lexeme ahead during parsing, this helps us know the source length of
1590 * Scan over leading white space at the start of a lexeme.
1602 infoPtr->lexeme = END;
1608 * Try to parse the lexeme first as an integer or floating-point
1633 infoPtr->lexeme = LITERAL;
1669 infoPtr->lexeme = LITERAL;
1684 * Not an integer or double literal. Initialize the lexeme's fields
1685 * assuming the common case of a single character lexeme.
1695 infoPtr->lexeme = OPEN_BRACKET;
1699 infoPtr->lexeme = OPEN_BRACE;
1703 infoPtr->lexeme = OPEN_PAREN;
1707 infoPtr->lexeme = CLOSE_PAREN;
1711 infoPtr->lexeme = DOLLAR;
1715 infoPtr->lexeme = QUOTE;
1719 infoPtr->lexeme = COMMA;
1723 infoPtr->lexeme = MULT;
1727 infoPtr->lexeme = DIVIDE;
1731 infoPtr->lexeme = MOD;
1735 infoPtr->lexeme = PLUS;
1739 infoPtr->lexeme = MINUS;
1743 infoPtr->lexeme = QUESTY;
1747 infoPtr->lexeme = COLON;
1751 infoPtr->lexeme = LESS;
1755 infoPtr->lexeme = LEFT_SHIFT;
1760 infoPtr->lexeme = LEQ;
1770 infoPtr->lexeme = GREATER;
1774 infoPtr->lexeme = RIGHT_SHIFT;
1779 infoPtr->lexeme = GEQ;
1789 infoPtr->lexeme = UNKNOWN;
1791 infoPtr->lexeme = EQUAL;
1799 infoPtr->lexeme = NOT;
1801 infoPtr->lexeme = NEQ;
1809 infoPtr->lexeme = BIT_AND;
1811 infoPtr->lexeme = AND;
1819 infoPtr->lexeme = BIT_XOR;
1823 infoPtr->lexeme = BIT_OR;
1825 infoPtr->lexeme = OR;
1833 infoPtr->lexeme = BIT_NOT;
1838 infoPtr->lexeme = STREQ;
1849 infoPtr->lexeme = STRNEQ;
1871 infoPtr->lexeme = FUNC_NAME;
1889 infoPtr->lexeme = UNKNOWN_CHAR;