1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
|
%{
// levcomp.lpp:
// Level compiler lexer for Dungeon Crawl Stone Soup.
//
// Based loosely on NetHack's lev_comp.l
#include "AppHdr.h"
#include <algorithm>
#include <cstring>
#include <queue>
#include "end.h"
#include "mapdef.h"
#include "levcomp.tab.h"
static bool alloced = false;
static queue<const char *> free_queue;
static void flush_free_queue(unsigned int max_allowed)
{
while (free_queue.size() > max_allowed)
{
const char *s = free_queue.front();
free((void *) s);
free_queue.pop();
}
}
static void add_to_queue(const char *s)
{
free_queue.push(s);
flush_free_queue(100);
}
static void clean()
{
if (yylval.text && alloced)
add_to_queue(yylval.text);
yylval.text = nullptr;
alloced = false;
}
// Enter a new state, first clearing yylval of junk.
#define CBEGIN(x) do { BEGIN(x); clean(); } while (0)
static void post_proc_text(char *text, bool trim_right,
int strip_trailing, int strip_leading)
{
char *s = nullptr;
if (trim_right)
{
s = text + strlen(text) - 1;
while (s >= text && isspace(*s))
*s-- = 0;
}
if (strip_trailing)
{
if (!s)
s = text + strlen(text) - 1;
while (s >= text && --strip_trailing >= 0)
*s-- = 0;
}
if (strip_leading)
{
const int original_length = strlen(text);
if (original_length > strip_leading)
memmove(text, text + strip_leading,
original_length - strip_leading);
if (original_length >= strip_leading)
text[original_length - strip_leading] = 0;
}
}
static char *copy_text(bool trim_right, int strip_trailing, int strip_leading)
{
char *newstring = nullptr;
if ((yylval.text = newstring = strdup(yytext)))
{
alloced = true;
post_proc_text(newstring, trim_right, strip_trailing, strip_leading);
}
return (newstring);
}
static void settext(bool trim_right = false,
int strip_trailing = 0,
int strip_leading = 0)
{
clean();
char *newstring = copy_text(trim_right, strip_trailing, strip_leading);
yylval.text = newstring;
}
static void str_check()
{
if (!yylval.text)
{
char *buf = (char *) malloc(1);
if (buf)
{
yylval.text = buf;
*buf = 0;
alloced = true;
}
}
}
static void cattext(bool trim_right = false, int strip_trailing = 0)
{
if (!yylval.text)
settext(trim_right, strip_trailing);
else
{
bool was_alloced = alloced;
char *newbuf = (char*) malloc(strlen(yylval.text) + strlen(yytext) + 1);
if (!newbuf)
end(1, false, "Out of memory");
alloced = true;
strcpy(newbuf, yylval.text);
strcat(newbuf, yytext);
post_proc_text(newbuf, trim_right, strip_trailing, 0);
if (was_alloced)
free((void*) yylval.text);
yylval.text = newbuf;
}
}
%}
%x MAPDEF
%x LUA
%x LUA_ONELINER
%s ARGUMENT
%s MNAME
%s KEYWORDS
%x ITEM_LIST
%option yylineno
%option never-interactive
NSPACE [^\ \t\r\n]
SPACE [\ \t\r]
%%
<MAPDEF>^\s*ENDMAP[ ]* { BEGIN(INITIAL); }
<MAPDEF>^[^\r\n\t]+ {
settext(true);
return MAP_LINE;
}
<MAPDEF>^[ ]*\r?\n return CHARACTER;
<MAPDEF># return CHARACTER;
<MAPDEF>[\ ][^\ \r\n] return CHARACTER;
<MAPDEF>[ ]*\r?\n ;
<LUA>\s*\}\}[ \t\r]*$ { BEGIN(INITIAL); }
<LUA>[^\r\n]+\}\}[ \t\r]*$ {
settext(true, 2);
BEGIN(INITIAL);
return LUA_LINE;
}
<LUA>[^\r\n]+ {
settext(true);
return LUA_LINE;
}
<LUA>\r?\n ;
<LUA_ONELINER>[^\r\n]+\r?$ {
settext(true);
return LUA_LINE;
}
<LUA_ONELINER>\r?\n { BEGIN(INITIAL); }
<KEYWORDS>[A-Za-z_0-9\-]+ {
settext();
return STRING;
}
<KEYWORDS>{SPACE}*\\{SPACE}*\n ;
<KEYWORDS>[ \t]+ ;
<KEYWORDS>[ \t]*\r?\n { BEGIN(INITIAL); }
<ITEM_LIST>[^,\ \t\r\n][^,\r\n]*\\{SPACE}*\n {
cattext(true, 1);
}
<ITEM_LIST>{SPACE}*\\{SPACE}*\n ;
<ITEM_LIST>[^, \t\r\n][^,\r\n]*[^, \t\r\n] {
cattext();
return ITEM_INFO;
}
<ITEM_LIST>, { clean(); return COMMA; }
<ITEM_LIST>[ \t]+ ;
<ITEM_LIST>[ \t]*\r?\n { BEGIN(INITIAL); }
<MNAME>[\ \t\r]*\n { BEGIN(INITIAL); }
<MNAME>[^,\ \t\r\n][^,\r\n]*\\{SPACE}*\n {
cattext(true, 1);
}
<MNAME>{SPACE}*\\{SPACE}*\n ;
<MNAME>[^,\ \t\r\n][^,\r\n]*[^,\ \t\r\n] {
cattext();
return MONSTER_NAME;
}
<MNAME>, { clean(); return COMMA; }
<MNAME>[ \t\r]+ ;
<ARGUMENT>{NSPACE}.*\\{SPACE}*\n {
cattext(true, 1);
}
<ARGUMENT>{SPACE}*\\{SPACE}*\n ;
<ARGUMENT>{NSPACE}.*{NSPACE} {
cattext();
}
<ARGUMENT>{NSPACE} cattext();
<ARGUMENT>{SPACE}*$ { BEGIN(INITIAL); str_check(); return STRING; }
^[ \t]*#.* ;
^\s*MAP[ \t\r]*$ { BEGIN(MAPDEF); }
^[ \t]*: { BEGIN(LUA_ONELINER); return MAIN; }
^[ \t]*prelude[ \t]*\{\{ { BEGIN(LUA); return PRELUDE; }
^[ \t]*lua[ \t]*\{\{ { BEGIN(LUA); return MAIN; }
^[ \t]*\{\{ { BEGIN(LUA); return MAIN; }
^[ \t]*validate[ \t]*\{\{ { BEGIN(LUA); return VALIDATE; }
^[ \t]*veto[ \t]*\{\{ { BEGIN(LUA); return VETO; }
^[ \t]*epilogue[ \t]*\{\{ { BEGIN(LUA); return EPILOGUE; }
NAME: { CBEGIN(ARGUMENT); return NAME; }
default-depth: { CBEGIN(ARGUMENT); return DEFAULT_DEPTH; }
DESC: { CBEGIN(ARGUMENT); return DESC; }
DEPTH: { CBEGIN(ARGUMENT); return DEPTH; }
ORIENT: { CBEGIN(ARGUMENT); return ORIENT; }
PLACE: { CBEGIN(ARGUMENT); return PLACE; }
WELCOME: { CBEGIN(ARGUMENT); return WELCOME; }
CHANCE: return CHANCE;
WEIGHT: return WEIGHT;
TAGS: { CBEGIN(KEYWORDS); return TAGS; }
SUBST: { CBEGIN(ITEM_LIST); return SUBST; }
NSUBST: { CBEGIN(ITEM_LIST); return NSUBST; }
COLOUR: { CBEGIN(ITEM_LIST); return COLOUR; }
LFLOORCOL: { CBEGIN(ARGUMENT); return LFLOORCOL; }
LROCKCOL: { CBEGIN(ARGUMENT); return LROCKCOL; }
LFLOORTILE: { CBEGIN(ARGUMENT); return LFLOORTILE; }
LROCKTILE: { CBEGIN(ARGUMENT); return LROCKTILE; }
FTILE: { CBEGIN(ITEM_LIST); return FTILE; }
RTILE: { CBEGIN(ITEM_LIST); return RTILE; }
TILE: { CBEGIN(ITEM_LIST); return TILE; }
FHEIGHT: { CBEGIN(ITEM_LIST); return FHEIGHT; }
MONS: { CBEGIN(MNAME); return MONS; }
ITEM: { CBEGIN(ITEM_LIST); return ITEM; }
MARKER: { CBEGIN(ARGUMENT); return MARKER; }
SHUFFLE: { CBEGIN(ITEM_LIST); return SHUFFLE; }
CLEAR: { CBEGIN(ARGUMENT); return CLEAR; }
ORDER: { return ORDER; }
KFEAT: { CBEGIN(ARGUMENT); return KFEAT; }
KITEM: { CBEGIN(ARGUMENT); return KITEM; }
KMONS: { CBEGIN(ARGUMENT); return KMONS; }
KMASK: { CBEGIN(ARGUMENT); return KMASK; }
KPROP: { CBEGIN(ARGUMENT); return KPROP; }
SUBVAULT: { CBEGIN(ARGUMENT); return SUBVAULT; }
, return COMMA;
: return COLON;
% return PERC;
- return DASH;
[+-]?[.][0-9]+|[+-]?[0-9]+[.]?[0-9]* {
clean();
yylval.f = strtod(yytext, nullptr);
return NUMBER;
}
\([^\r\n)]*\) {
settext(true, 1, 1);
return STRING;
}
[\ \t]+ ;
\r?\n ;
\r ;
. return CHARACTER;
%%
int yywrap()
{
clean();
flush_free_queue(0);
return 1;
}
|