src/parser.lex

   1 %{
   2
   3 #include <string.h>
   4 #include <stdlib.h>
   5 #include <stdio.h>
   6 #include "../lib/q.h"
   7 #include "parser.h"
   8
   9 //RVALUE         {NUMBER}|{PERCENT}|{NAME}|\"{STRING}\"|{DIM}
  10 //<a>.                {printf("<a>%s\n", yytext);}
  11 // %x: exclusive, %s: inclusive
  12 char*type_names[] = {"twip","number","command","string","assignment","identifier","label","end"};
  13 static int line=1;
  14 static int column=1;
  15
  16 mem_t strings;
  17 mem_t tokens;
  18
  19 static void count(char*text, int len, int condition)
  20 {
  21     int t;
  22     for(t=0;t<len;t++) {
  23         if(text[t]=='\n') {
  24             line++;
  25             column=1;
  26         } else {
  27             column++;
  28         }
  29     }
  30 }
  31
  32 static char*prefix = 0;
  33
  34 static char utf8buf[16];
  35 static char* getUTF8(unsigned int charnum)
  36 {
  37     memset(utf8buf, 0, sizeof(utf8buf));
  38
  39     if(charnum < 0x80) {
  40         utf8buf[0] = charnum;
  41         return utf8buf;
  42     } else if(charnum <0x800) {
  43         /* 0000 0080-0000 07FF   110xxxxx 10xxxxxx */
  44         utf8buf[0] = 0xc0 | (charnum >> 6);
  45         utf8buf[1] = 0x80 | (charnum & 0x3f);
  46         return utf8buf;
  47     } else if(charnum < 0x10000) {
  48         /* 0000 0800-0000 FFFF   1110xxxx 10xxxxxx 10xxxxxx */
  49         utf8buf[0] = 0xe0 | (charnum >> 12);
  50         utf8buf[1] = 0x80 |((charnum >> 6)&0x3f);
  51         utf8buf[2] = 0x80 |((charnum     )&0x3f);
  52         return utf8buf;
  53     } else if(charnum < 0x200000) {
  54         /* 0001 0000-001F FFFF   11110xxx 10xxxxxx 10xxxxxx 10xxxxxx */
  55         utf8buf[0] = 0xf0 | (charnum >> 18);
  56         utf8buf[1] = 0x80 |((charnum >> 12)&0x3f);
  57         utf8buf[2] = 0x80 |((charnum >> 6 )&0x3f);
  58         utf8buf[3] = 0x80 |((charnum      )&0x3f);
  59         return utf8buf;
  60     } else if(charnum < 0x4000000) {
  61         /* 0020 0000-03FF FFFF   111110xx 10xxxxxx 10xxxxxx 10xxxxxx 10xxxxxx */
  62         utf8buf[0] = 0xf8 | (charnum >> 24);
  63         utf8buf[1] = 0x80 |((charnum >> 18)&0x3f);
  64         utf8buf[2] = 0x80 |((charnum >> 12)&0x3f);
  65         utf8buf[3] = 0x80 |((charnum >> 6 )&0x3f);
  66         utf8buf[4] = 0x80 |((charnum      )&0x3f);
  67         return utf8buf;
  68     } else if(charnum < 0x80000000) {
  69         /* 0400 0000-7FFF FFFF   1111110x 10xxxxxx ... 10xxxxxx */
  70         utf8buf[0] = 0xfc | (charnum >> 30);
  71         utf8buf[1] = 0x80 |((charnum >> 24)&0x3f);
  72         utf8buf[2] = 0x80 |((charnum >> 18)&0x3f);
  73         utf8buf[3] = 0x80 |((charnum >> 12)&0x3f);
  74         utf8buf[4] = 0x80 |((charnum >> 6 )&0x3f);
  75         utf8buf[5] = 0x80 |((charnum      )&0x3f);
  76         return utf8buf;
  77     } else {
  78         fprintf(stderr, "Illegal character: 0x%08x\n", charnum);
  79         return utf8buf;
  80     }
  81 }
  82
  83 static void unescapeString(string_t * tmp)
  84 {
  85     char *p, *p1;
  86     /* fixme - this routine expects the string to be
  87        null-terminated */
  88
  89     for (p1=tmp->str; (p=strchr(p1, '\\')); p1 = p+1)
  90     {
  91         int nr=2;
  92         int new=1;
  93         switch(p[1])
  94         {
  95             case '\\': p[0] = '\\'; break;
  96             case '"': p[0] = '"'; break;
  97             case 'b': p[0] = '\b'; break;
  98             case 'f': p[0] = '\f'; break;
  99             case 'n': p[0] = '\n'; break;
 100             case 'r': p[0] = '\r'; break;
 101             case 't': p[0] = '\t'; break;
 102             case 'x':  {
 103                 int num=0;
 104                 while(strchr("0123456789abcdefABCDEF", p[nr])) {
 105                     num <<= 4;
 106                     if(p[nr]>='0' && p[nr]<='9') num |= p[nr] - '0';
 107                     if(p[nr]>='a' && p[nr]<='f') num |= p[nr] - 'a' + 10;
 108                     if(p[nr]>='A' && p[nr]<='F') num |= p[nr] - 'A' + 10;
 109                     nr++;
 110                 }
 111                 char*utf8 = getUTF8(num);
 112                 new = strlen(utf8);
 113
 114                 memcpy(p, utf8, new); // do not copy the terminating zero
 115                 break;
 116             }
 117             default:
 118                 continue;
 119         }
 120         tmp->len -= (nr-new);
 121         int t;
 122         char*to=p+new,*from=p+nr;
 123         while(*from) {
 124             *to = *from;
 125             to++;
 126             from++;
 127         }
 128     }
 129 }
 130
 131 static void store(enum type_t type, int line, int column, char*text, int length)
 132 {
 133     struct token_t token;
 134     string_t tmp;
 135     token.type = type;
 136     token.line = line;
 137     token.column = column;
 138     //printf("->%d(%s) %s\n", type, type_names[type], text);fflush(stdout);
 139
 140     token.text = 0;
 141     switch(type) {
 142         case END:
 143             string_set2(&tmp, "", 0);
 144             token.text = (char*)mem_putstring(&strings, tmp);
 145         break;
 146         case STRING:
 147             string_set2(&tmp, text+1, length-2);
 148             unescapeString(&tmp);
 149             token.text = (char*)mem_putstring(&strings, tmp);
 150         break;
 151         case TWIP:
 152         case NUMBER:
 153         case IDENTIFIER:
 154             string_set2(&tmp, text, length);
 155             if(prefix) {
 156                 //strcat
 157                 token.text = (char*)mem_put(&strings, prefix, strlen(prefix));
 158                 mem_putstring(&strings, tmp);
 159             } else {
 160                 token.text = (char*)mem_putstring(&strings, tmp);
 161             }
 162             prefix = 0;
 163         break;
 164         case RAWDATA:
 165             string_set2(&tmp, text+1/*:*/, length-5/*.end*/);
 166             token.text = (char*)mem_putstring(&strings, tmp);
 167         break;
 168         case COMMAND:
 169             string_set2(&tmp, text+1, length-1);
 170             token.text = (char*)mem_putstring(&strings, tmp);
 171         break;
 172         case ASSIGNMENT: {
 173             char*x = &text[length-1];
 174             if(x[-1] == '-' || x[-1] == '+')
 175                 x--;
 176             do{x--;} while(*x==32 || *x==10 || *x==13 || *x=='\t');
 177             x++; //first space
 178             string_set2(&tmp, text, x-text);
 179             token.text = (char*)mem_putstring(&strings, tmp);
 180             /*char*y,*x = strchr(text, '=');
 181             if(!x) exit(1);
 182             y=x;
 183             do{y--;} while(*y==32 || *y==10 || *y==13 || *y=='\t');
 184             do{x++;} while(*x==32 || *x==10 || *x==13 || *x=='\t');
 185             token.text1 = (char*)put(&strings, text, y-text + 1, 1);
 186             token.text2 = (char*)put(&strings, x, length-(x-text), 1);*/
 187         } break;
 188     }
 189
 190     mem_put(&tokens, &token, sizeof(struct token_t));
 191     prefix = 0;
 192 }
 193
 194 #define MAX_INCLUDE_DEPTH 16
 195 YY_BUFFER_STATE include_stack[MAX_INCLUDE_DEPTH];
 196 int line_stack[MAX_INCLUDE_DEPTH];
 197 int column_stack[MAX_INCLUDE_DEPTH];
 198 int include_stack_ptr = 0;
 199
 200 void handleInclude(char*text, int len)
 201 {
 202     text+=9;len-=9;
 203     while(len >=1 && (text[0] == ' ' || text[0] == '\t')) {
 204         text++;len--;
 205     }
 206     while(len >= 1 && (text[len-1] == ' ' || text[len-1] == '\n')) {
 207         len--;
 208     }
 209     if(len >= 2 && text[0] == '"' && text[len-1] == '"') {
 210         text++; len-=2;
 211     }
 212     text[len] = 0;
 213     if(include_stack_ptr >= MAX_INCLUDE_DEPTH) {
 214         fprintf( stderr, "Includes nested too deeply" );
 215         exit( 1 );
 216     }
 217     include_stack[include_stack_ptr] = YY_CURRENT_BUFFER;
 218     line_stack[include_stack_ptr] = line;
 219     column_stack[include_stack_ptr] = column;
 220     include_stack_ptr++;
 221     yyin = fopen(text, "rb");
 222     if (!yyin) {
 223         fprintf(stderr, "Couldn't open %s\n", text);
 224         exit(1);
 225     }
 226     yy_switch_to_buffer(
 227         yy_create_buffer( yyin, YY_BUF_SIZE ) );
 228     BEGIN(INITIAL);
 229 }
 230
 231 #define c() {count(yytext, yyleng, YY_START);}
 232 #define s(type) {store(type, line, column, yytext, yyleng);}
 233 %}
 234
 235 %s R
 236 %x BINARY
 237
 238 NAME     [a-zA-Z_./](-*[a-zA-Z0-9_./])*
 239 TWIP     (-?[0-9]+(\.([0-9]([05])?)?)?)
 240 NUMBER   -?[0-9]+(\.[0-9]*)?
 241 PERCENT  {NUMBER}%
 242 STRING   (\\.|[^\\"\n])*
 243 S        [ \n\r\t]
 244 RVALUE   \"{STRING}\"|([^ \n\r\t]+)
 245
 246 %%
 247
 248 <BINARY>\] {c();BEGIN(0);}
 249 <BINARY>.  {c();}
 250 <BINARY>\n {c();}
 251 {TWIP}/[ \n\r\t]            {s(TWIP);c();BEGIN(0);}
 252 {NUMBER}/[ \n\r\t]          {s(NUMBER);c();BEGIN(0);}
 253 ^#[^\n]*\n                  {c();}
 254 [ \t\r]#[^\n]*\n            {c();}
 255 \"{STRING}\"                {s(STRING);c();BEGIN(0);}
 256 \"{STRING}$                 {c();printf("unterminated string in line %d: %s\n", line, yytext);exit(1);yyterminate();}
 257 {NAME}{S}*\+=               {s(ASSIGNMENT);prefix="<plus>";c();BEGIN(R);}
 258 {NAME}{S}*-=                {s(ASSIGNMENT);prefix="<minus>";c();BEGIN(R);}
 259 {NAME}{S}*=                 {s(ASSIGNMENT);c();BEGIN(R);}
 260 <R>{ /* values which appear only on the right-hand side of assignments, like: x=50% */
 261     [^ :\n\t\r]*                    {s(IDENTIFIER);c();BEGIN(0);}
 262 }
 263 \.include{S}.*\n                    {handleInclude(yytext, yyleng);}
 264 \.{NAME}                    {s(COMMAND);c();}
 265 :([^.]|\.[^e]|\.e[^n]|\.en[^d]|[ \n\r\t])*\.end     {s(RAWDATA);c();}
 266 {NAME}                      {s(IDENTIFIER);c();}
 267 "["                         {c();BEGIN(BINARY);}
 268 {S}                         {c();}
 269 .                           {char c,c1=yytext[0];
 270                              printf("Syntax error in line %d, %d: %s", line, column, yytext);
 271                              while(1) {
 272                                  c=input();
 273                                  if(c=='\n' || c==EOF)
 274                                      break;
 275                                 printf("%c", c);
 276                              }
 277                              if(c1>='0' && c1<='9')
 278                                  printf(" (identifiers must not start with a digit)");
 279                              printf("\n");
 280                              exit(1);
 281                              yyterminate();
 282                             }
 283 <<EOF>>                     {c();
 284                              if ( --include_stack_ptr < 0 ) {
 285                                 s(END);
 286                                 yyterminate();
 287                              } else {
 288                                  yy_delete_buffer( YY_CURRENT_BUFFER );
 289                                  yy_switch_to_buffer(
 290                                       include_stack[include_stack_ptr] );
 291                                  column = column_stack[include_stack_ptr];
 292                                  line = line_stack[include_stack_ptr];
 293                              }
 294                             }
 295
 296 %%
 297
 298 int yywrap()
 299 {
 300     return 1;
 301 }
 302
 303 void freeTokens(struct token_t*file)
 304 {
 305     mem_clear(&strings);
 306     mem_clear(&tokens);
 307 }
 308
 309 struct token_t* generateTokens(char*filename)
 310 {
 311     FILE*fi = fopen(filename, "rb");
 312     int t;
 313     struct token_t*result;
 314     int num;
 315     if(!fi) {
 316         printf("Couldn't find file %s\n", filename);
 317         return 0;
 318     }
 319     yyin = fi;
 320
 321     mem_init(&strings);
 322     mem_init(&tokens);
 323     mem_put(&strings, &t, 1); //hack- make all valid strings start at position >0
 324
 325     line=1;
 326     column=1;
 327
 328     yylex();
 329     yy_delete_buffer(yy_current_buffer);
 330
 331     result = (struct token_t*)tokens.buffer;
 332     num = tokens.pos/sizeof(struct token_t);
 333
 334     for(t=0;t<tokens.pos/sizeof(struct token_t);t++) {
 335         if(result[t].text)
 336             result[t].text += (int)strings.buffer;
 337     }
 338
 339     fclose(fi);
 340     return result;
 341 }
 342