bin/sh/arith_lex.l

   1 %{
   2 /*-
   3  * Copyright (c) 1993
   4  *      The Regents of the University of California.  All rights reserved.
   5  *
   6  * This code is derived from software contributed to Berkeley by
   7  * Kenneth Almquist.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted provided that the following conditions
  11  * are met:
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  * 2. Redistributions in binary form must reproduce the above copyright
  15  *    notice, this list of conditions and the following disclaimer in the
  16  *    documentation and/or other materials provided with the distribution.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33
  34 #if 0
  35 #ifndef lint
  36 static char sccsid[] = "@(#)arith_lex.l 8.3 (Berkeley) 5/4/95";
  37 #endif
  38 #endif /* not lint */
  39
  40 #include <sys/cdefs.h>
  41 __FBSDID("$FreeBSD$");
  42
  43 #include <string.h>
  44
  45 #include "arith.h"
  46 #include "shell.h"
  47 #include "y.tab.h"
  48 #include "error.h"
  49 #include "memalloc.h"
  50 #include "var.h"
  51
  52 int yylex(void);
  53
  54 struct varname
  55 {
  56         struct varname *next;
  57         char name[1];
  58 };
  59 static struct varname *varnames;
  60
  61 #undef YY_INPUT
  62 #define YY_INPUT(buf,result,max) \
  63         result = (*buf = *arith_buf++) ? 1 : YY_NULL;
  64 #define YY_NO_UNPUT
  65 %}
  66
  67 %%
  68 [ \t\n] { ; }
  69
  70 0x[a-fA-F0-9]+  {
  71                         yylval.l_value = strtoarith_t(yytext, NULL, 16);
  72                         return ARITH_NUM;
  73                 }
  74
  75 0[0-7]+         {
  76                         yylval.l_value = strtoarith_t(yytext, NULL, 8);
  77                         return ARITH_NUM;
  78                 }
  79
  80 [0-9]+          {
  81                         yylval.l_value = strtoarith_t(yytext, NULL, 10);
  82                         return ARITH_NUM;
  83                 }
  84
  85 [A-Za-z][A-Za-z0-9_]*   {
  86                         /*
  87                          * If variable doesn't exist, we should initialize
  88                          * it to zero.
  89                          */
  90                         struct varname *temp;
  91                         if (lookupvar(yytext) == NULL)
  92                                 setvarsafe(yytext, "0", 0);
  93                         temp = ckmalloc(sizeof(struct varname) +
  94                             strlen(yytext));
  95                         temp->next = varnames;
  96                         varnames = temp;
  97                         yylval.s_value = strcpy(temp->name, yytext);
  98
  99                         return ARITH_VAR;
 100                 }
 101
 102 "("             {       return ARITH_LPAREN;    }
 103 ")"             {       return ARITH_RPAREN;    }
 104 "||"            {       return ARITH_OR;        }
 105 "&&"            {       return ARITH_AND;       }
 106 "|"             {       return ARITH_BOR;       }
 107 "^"             {       return ARITH_BXOR;      }
 108 "&"             {       return ARITH_BAND;      }
 109 "=="            {       return ARITH_EQ;        }
 110 "!="            {       return ARITH_NE;        }
 111 ">"             {       return ARITH_GT;        }
 112 ">="            {       return ARITH_GE;        }
 113 "<"             {       return ARITH_LT;        }
 114 "<="            {       return ARITH_LE;        }
 115 "<<"            {       return ARITH_LSHIFT;    }
 116 ">>"            {       return ARITH_RSHIFT;    }
 117 "*"             {       return ARITH_MUL;       }
 118 "/"             {       return ARITH_DIV;       }
 119 "%"             {       return ARITH_REM;       }
 120 "+"             {       return ARITH_ADD;       }
 121 "-"             {       return ARITH_SUB;       }
 122 "~"             {       return ARITH_BNOT;      }
 123 "!"             {       return ARITH_NOT;       }
 124 "="             {       return ARITH_ASSIGN;    }
 125 "+="            {       return ARITH_ADDASSIGN; }
 126 "-="            {       return ARITH_SUBASSIGN; }
 127 "*="            {       return ARITH_MULASSIGN; }
 128 "/="            {       return ARITH_DIVASSIGN; }
 129 "%="            {       return ARITH_REMASSIGN; }
 130 ">>="           {       return ARITH_RSHASSIGN; }
 131 "<<="           {       return ARITH_LSHASSIGN; }
 132 "&="            {       return ARITH_BANDASSIGN; }
 133 "^="            {       return ARITH_BXORASSIGN; }
 134 "|="            {       return ARITH_BORASSIGN; }
 135 .               {
 136                         error("arith: syntax error: \"%s\"\n", arith_startbuf);
 137                 }
 138 %%
 139
 140 void
 141 arith_lex_reset(void)
 142 {
 143         struct varname *name, *next;
 144
 145         YY_NEW_FILE;
 146
 147         name = varnames;
 148         while (name != NULL) {
 149                 next = name->next;
 150                 ckfree(name);
 151                 name = next;
 152         }
 153         varnames = NULL;
 154 }