| 1 |
%{ |
| 2 |
/* |
| 3 |
* Copyright (c) 1998 - 2017 Kungliga Tekniska Högskolan |
| 4 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 5 |
* All rights reserved. |
| 6 |
* |
| 7 |
* Redistribution and use in source and binary forms, with or without |
| 8 |
* modification, are permitted provided that the following conditions |
| 9 |
* are met: |
| 10 |
* |
| 11 |
* 1. Redistributions of source code must retain the above copyright |
| 12 |
* notice, this list of conditions and the following disclaimer. |
| 13 |
* |
| 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 |
* |
| 18 |
* 3. Neither the name of the Institute nor the names of its contributors |
| 19 |
* may be used to endorse or promote products derived from this software |
| 20 |
* without specific prior written permission. |
| 21 |
* |
| 22 |
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND |
| 23 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 24 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 25 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE |
| 26 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 27 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 28 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 29 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 30 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 31 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 32 |
* SUCH DAMAGE. |
| 33 |
*/ |
| 34 |
|
| 35 |
/* |
| 36 |
* This is to handle the definition of this symbol in some AIX |
| 37 |
* headers, which will conflict with the definition that lex will |
| 38 |
* generate for it. It's only a problem for AIX lex. |
| 39 |
*/ |
| 40 |
|
| 41 |
#undef ECHO |
| 42 |
|
| 43 |
#include "compile_et.h" |
| 44 |
#include "parse.h" |
| 45 |
#include "lex.h" |
| 46 |
|
| 47 |
static unsigned lineno = 1; |
| 48 |
static int getstring(void); |
| 49 |
|
| 50 |
#define YY_NO_UNPUT |
| 51 |
|
| 52 |
#undef ECHO |
| 53 |
|
| 54 |
%} |
| 55 |
|
| 56 |
%option nounput |
| 57 |
|
| 58 |
%% |
| 59 |
et { return ET; } |
| 60 |
error_table { return ET; } |
| 61 |
ec { return EC; } |
| 62 |
error_code { return EC; } |
| 63 |
prefix { return PREFIX; } |
| 64 |
index { return INDEX; } |
| 65 |
id { return ID; } |
| 66 |
end { return END; } |
| 67 |
[0-9]+ { yylval.number = atoi(yytext); return NUMBER; } |
| 68 |
#[^\n]* ; |
| 69 |
[ \t] ; |
| 70 |
\n { lineno++; } |
| 71 |
\" { return getstring(); } |
| 72 |
[a-zA-Z0-9_]+ { yylval.string = strdup(yytext); return STRING; } |
| 73 |
. { return *yytext; } |
| 74 |
%% |
| 75 |
|
| 76 |
int |
| 77 |
yywrap () |
| 78 |
{ |
| 79 |
return 1; |
| 80 |
} |
| 81 |
|
| 82 |
static int |
| 83 |
getstring(void) |
| 84 |
{ |
| 85 |
char x[128]; |
| 86 |
int i = 0; |
| 87 |
int c; |
| 88 |
int quote = 0; |
| 89 |
while(i < sizeof(x) - 1 && (c = input()) != EOF){ |
| 90 |
if(quote) { |
| 91 |
x[i++] = c; |
| 92 |
quote = 0; |
| 93 |
continue; |
| 94 |
} |
| 95 |
if(c == '\n'){ |
| 96 |
_lex_error_message("unterminated string"); |
| 97 |
lineno++; |
| 98 |
break; |
| 99 |
} |
| 100 |
if(c == '\\'){ |
| 101 |
quote++; |
| 102 |
continue; |
| 103 |
} |
| 104 |
if(c == '\"') |
| 105 |
break; |
| 106 |
x[i++] = c; |
| 107 |
} |
| 108 |
x[i] = '\0'; |
| 109 |
yylval.string = strdup(x); |
| 110 |
if (yylval.string == NULL) |
| 111 |
err(1, "malloc"); |
| 112 |
return STRING; |
| 113 |
} |
| 114 |
|
| 115 |
void |
| 116 |
_lex_error_message (const char *format, ...) |
| 117 |
{ |
| 118 |
va_list args; |
| 119 |
|
| 120 |
va_start (args, format); |
| 121 |
fprintf (stderr, "%s:%d:", filename, lineno); |
| 122 |
vfprintf (stderr, format, args); |
| 123 |
va_end (args); |
| 124 |
numerror++; |
| 125 |
} |