More MPSL library functions documented.
[mpsl.git] / mpsl.l
blob2e4e950567f5c313decff4e092d5b88cc29c856c
1 %{
2 /*
4     MPSL - Minimum Profit Scripting Language
5     Copyright (C) 2003/2007 Angel Ortega <angel@triptico.com>
7     mpsl.l - Minimum Profit Scripting Language [F]lexer
9     This program is free software; you can redistribute it and/or
10     modify it under the terms of the GNU General Public License
11     as published by the Free Software Foundation; either version 2
12     of the License, or (at your option) any later version.
14     This program is distributed in the hope that it will be useful,
15     but WITHOUT ANY WARRANTY; without even the implied warranty of
16     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
17     GNU General Public License for more details.
19     You should have received a copy of the GNU General Public License
20     along with this program; if not, write to the Free Software
21     Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
23     http://www.triptico.com
27 #include <stdio.h>
28 #include <wchar.h>
29 #include "mpdm.h"
31 #include <stdlib.h>
32 #include "y.tab.h"
34 void yyerror(char * s);
35 int yy_input_for_flex(char * buf, int max);
37 /* redefinition of input function for GNU Flex */
38 #undef YY_INPUT
39 #define YY_INPUT(b,r,m) (r = yy_input_for_flex(b,m))
41 /* internal pointer to next character in code */
42 wchar_t *mpsl_next_char = NULL;
44 /* file stream for compiling from file */
45 FILE *mpsl_file = NULL;
47 /* line number */
48 int mpsl_line = 0;
50 /* cached value MPSL.LC */
51 mpdm_t mpsl_lc = NULL;
53 /* dynamic string manipulation macros */
54 #ifndef ds_init
55 struct ds { wchar_t * d; int p; int s; };
56 #define ds_init(x) do { x.d = (wchar_t *)0; x.p = x.s = 0; } while(0)
57 #define ds_rewind(x) x.p = 0;
58 #define ds_free(x) do { if(x.d) free(x.d); ds_init(x); } while(0)
59 #define ds_redim(x) do { if(x.p >= x.s) x.d = realloc(x.d, ++x.s * sizeof(wchar_t)); } while(0)
60 #define ds_poke(x,c) do { ds_redim(x); x.d[x.p++] = c; } while(0)
61 #define ds_pokes(x,t) do { wchar_t *p = t; while(*p) ds_poke(x, *p++); } while(0)
62 #endif /* ds_init */
64 /* a dynamic string */
65 struct ds ds_v;
67 static wchar_t *s_mbstowcs(char *str)
68 /* converts from mbs to wcs, using a static buffer */
70         static wchar_t * wc = NULL;
71         static int wc_s = 0;
72         int n;
74         /* allocs wchar_t space, if needed */
75         if ((n = mbstowcs(NULL, str, 0)) > wc_s) {
76                 wc_s = n;
77                 wc = realloc(wc, (wc_s + 1) * sizeof(wchar_t));
78         }
80         /* really converts */
81         mbstowcs(wc, str, n);
82         wc[n] = L'\0';
84         return wc;
88 static mpdm_t literal_cache(char *ptr, wchar_t *wptr)
89 /* the cache of literal values */
91         mpdm_t v;
93         /* convert to wchar_t */
94         if (ptr != NULL)
95                 wptr = s_mbstowcs(ptr);
97         /* search in cache */
98         if ((v = mpdm_hget_s(mpsl_lc, wptr)) == NULL) {
99                 v = MPDM_S(wptr);
100                 mpdm_hset(mpsl_lc, v, v);
101         }
103         return v;
109 DIGIT           [0-9]
110 LETTER          [a-zA-Z_]
111 WSPACE          [ \t\r]+
112 OCTDIGIT        [0-7]
113 HEXDIGIT        [0-9a-fA-F]
114 HEXQUAD         {HEXDIGIT}{1,4}
116 DECINTEGER      {DIGIT}+
117 OCTINTEGER      0{OCTDIGIT}+
118 HEXINTEGER      0[xX]{HEXDIGIT}+
120 REAL            {DIGIT}*[\.]?{DIGIT}+
121 SCIENT          {DIGIT}+(\.{DIGIT}+)?[eE][-+]?{DIGIT}+
122 SYMBOL          {LETTER}({LETTER}|{DIGIT})*
123 INTEGER         ({DECINTEGER}|{OCTINTEGER}|{HEXINTEGER})
125 %x REM
126 %x STR
130 {INTEGER}       {
131                         /* integers */
132                         yylval.v = literal_cache(yytext, NULL);
133                         return INTEGER;
134                 }
136 ({REAL}|{SCIENT})       {
137                         /* real numbers */
138                         yylval.v = literal_cache(yytext, NULL);
139                         return REAL;
140                 }
142 \'[^']*\'       {
143                         /* single quoted string; return as is */
144                         yytext[yyleng - 1] = '\0';
145                         yylval.v = literal_cache(yytext + 1, NULL);
146                         return STRING;
147                 }
149 "NULL"          return NULLV;
150 "while"         return WHILE;
151 "if"            return IF;
152 "else"          return ELSE;
153 "sub"           return SUB;
154 "foreach"       return FOREACH;
155 "local"         return LOCAL;
156 "break"         return BREAK;
157 "return"        return RETURN;
159 "=="            return NUMEQ;
160 "!="            return NUMNE;
161 ">="            return NUMGE;
162 "<="            return NUMLE;
163 "&&"            return BOOLAND;
164 "||"            return BOOLOR;
165 "=>"            return HASHPAIR;
166 ".."            return RANGE;
167 "&"             return BITAND;
168 "|"             return BITOR;
169 "^"             return BITXOR;
171 "eq"            return STREQ;
172 "ne"            return STRNE;
173 "~"             return STRCAT;
175 "++"            return INC;
176 "--"            return DEC;
177 "+="            return IADD;
178 "-="            return ISUB;
179 "*="            return IMUL;
180 "/="            return IDIV;
181 "%"             return MOD;
182 "%="            return IMOD;
184 {SYMBOL}        {
185                         /* symbol name */
186                         yylval.v = literal_cache(yytext, NULL);
187                         return SYMBOL;
188                 }
190 {WSPACE}        ;       /* ignore spaces */
192 \n              { mpsl_line++; }
194 \/\*            { BEGIN REM; /* C-like comments */ }
195 <REM>\*\/       { BEGIN 0; }
196 <REM>\n         { mpsl_line++; }
197 <REM>.          ;
199 \"              { BEGIN STR; ds_rewind(ds_v); }
200 <STR>\n         { ds_poke(ds_v, L'\n'); mpsl_line++; }
201 <STR>\\n        { ds_poke(ds_v, L'\n'); }
202 <STR>\\t        { ds_poke(ds_v, L'\t'); }
203 <STR>\\r        { ds_poke(ds_v, L'\r'); }
204 <STR>\\e        { ds_poke(ds_v, 27); }
205 <STR>\\\"       { ds_poke(ds_v, L'\"'); }
206 <STR>\\\\       { ds_poke(ds_v, L'\\'); }
207 <STR>\"\\\n[ \t]+\"     ;
208 <STR>\"         {
209                         ds_poke(ds_v, L'\0');
210                         yylval.v = literal_cache(NULL, ds_v.d);
211                         BEGIN 0;
212                         return STRING;
213                 }
214 <STR>\\x\{{HEXQUAD}\} {
215                         int c;
217                         sscanf(yytext, "\\x{%x}", &c);
218                         ds_poke(ds_v, (wchar_t) c);
219                 }
220 <STR>.          { wchar_t wc; if (mbtowc(&wc, yytext, 1) > 0) ds_poke(ds_v, wc); }
222 .               { return *yytext; }
226 int yywrap(void) { return 1; }
228 int yy_input_for_flex(char *buf, int max)
230         int n = 0;
232         if (mpsl_file != NULL) {
233                 while (n < max) {
234                         int c;
236                         if ((c = fgetc(mpsl_file)) == EOF) {
237                                 mpsl_file = NULL;
238                                 break;
239                         }
241                         buf[n++] = c;
242                 }
243         }
244         else
245         if (mpsl_next_char != NULL) {
246                 for (;;) {
247                         char tmp[64];   /* really MB_CUR_MAX + 1 */
248                         int c, i;
250                         if (*mpsl_next_char == L'\0' ||
251                            (c = wctomb(tmp, *mpsl_next_char)) < 0) {
252                                 mpsl_next_char = NULL;
253                                 break;
254                         }
256                         /* no room? try next time */
257                         if (n + c >= max)
258                                 break;
260                         mpsl_next_char++;
262                         /* transfer */
263                         for (i = 0; i < c; i++)
264                                 buf[n++] = tmp[i];
265                 }
266         }
268         return n;