6 #include "parser.tab.h"
11 void lexer_quit(void);
12 int lexer_lexfile(uint8_t*);
13 int lexer_lexdir(uint8_t*);
14 int lexer_lexstring(uint8_t*, int);
20 /* Ring buffer for keeping lexical tokens valid for up to 255 tokens */
22 YYSTYPE lval_stack[0xFF + 1];
26 #define PUSHTOK(T,L) yypush_parse(pstate, T, (L), cstate)
27 #define LEXTOK(T,Y,L) do { \
29 ulc_fprintf(stdout, "["$(T)); \
31 case NAME: case PATH: \
32 ulc_fprintf(stdout, "->%U", L); break; \
34 ulc_fprintf(stdout, "->%X", L); break; \
37 ulc_fprintf(stdout, "]"); \
39 lval_stack[lval_offs].Y = L; \
40 PUSHTOK(T,lval_stack + lval_offs); \
44 #define PUSHFACE(F) LEXTOK(FACING, face, F)
45 #define PUSHREF(R) LEXTOK(REF, ref, R)
46 #define PUSHLINK() LEXTOK(LINK, val, 0)
47 #define PUSHNUM(N) LEXTOK(NUM, val, N)
48 #define PUSHNAME(N) LEXTOK(NAME, str, N)
49 #define PUSHOP(O) LEXTOK(O, val, 0)
50 #define PUSHPATH(P) LEXTOK(PATH, str, P)
52 /* Lexstring is the main lexer for APC and is generated by ragel. It lexes file names of files
53 that have been scanned and pushes their types and values into the tok_stack, which yyparse
54 eventually calls during parsing. */
59 # set up yylval and tok_t to be pushed to stack
60 action push_ref { errno = 0;
61 lval.ref = strtoll((char*)ts,NULL,16);
63 { ulc_fprintf(stderr, "Invalid hex number in file %U\n",str);
68 action push_link { PUSHLINK(); }
69 action push_val { errno = 0;
70 lval.val = strtoll((char*)ts,NULL,10);
72 { ulc_fprintf(stderr, "strtoll could not parse %U\n",str);
77 action push_name { PUSHNAME(ts); }
78 action push_map { PUSHOP(MAP); }
79 action set_ts { ts = p; }
80 action push_SS { PUSHOP(SS); }
81 action push_S { PUSHFACE(SFACE); }
82 action push_SW { PUSHFACE(SWFACE); }
83 action push_W { PUSHFACE(WFACE); }
84 action push_NW { PUSHFACE(NWFACE); }
85 action push_N { PUSHFACE(NFACE); }
86 action push_NE { PUSHFACE(NEFACE); }
87 action push_E { PUSHFACE(EFACE); }
88 action push_SE { PUSHFACE(SEFACE); }
89 action ref_error { ulc_fprintf(stderr, "ref from %U to %U has an inappropriate amount of hex digits, it must have eight.\n", ts, p);
92 action p { dprintf("Lexer_lexstring:: p = %U\n", p); }
103 tok_delimiter = [_\0];
105 direction = (N | W | S | E | NW | NE | SW | SE) ;
106 dimensions = (digit+ - '0') >set_ts %push_val 'x' (digit+ - '0') >set_ts %push_val;
107 link = '#' %push_link;
108 SS = ('+SS' %to(push_SS)) | ('+SS' %to(push_SS) link ) ;
109 ref = '0x' >set_ts alnum{8} $err(ref_error) %push_ref ;
110 val = digit+ >set_ts %push_val ;
111 name = lower >set_ts (lower | digit)* %push_name ;
112 map = '+MAP' %to(push_map);
113 tok = (name | val | ref | dimensions | map | link | SS | direction);
116 main := (tok tok_delimiter)* tok ;
118 write data nofinal noerror noprefix;
124 { pstate = yypstate_new();
125 cstate = yycstate_new();
127 return !pstate || !cstate;
133 { if (pstate) yypstate_delete(pstate);
134 if (cstate) yycstate_delete(cstate);
141 { uint8_t* p, * ts, * pe, * eof;
152 /* Lexical analysis of a file
153 Strips a filename to its base name, then sends it to lexer_lexstring before
154 pushing a PATH token with the filename
155 Returns the number of tokens pushed to the parser.
158 ( uint8_t* filename )
159 { uint8_t* last_period,* iter,* filename_end;
162 for (iter = filename; *iter; iter++)
164 { // Keep track of the last 'dot' in the name
165 case '.' : last_period = iter; continue;
166 // replace '_' with '\0' so bison can use strlen on them as tokens.
167 case '_' : *iter = '\0';
170 // Mark the end of the filename
172 // Lex from either the last period, if present, or filename end
173 dprintf("%U\n\t",filename);
174 ntok = (last_period) ?
175 lexer_lexstring(filename, (int)(last_period - filename))
176 : lexer_lexstring(filename, (int)(iter - filename));
178 // Replace nulls with their original '_'
179 for (iter = filename; iter < filename_end; iter++)
183 dprintf("\n\t[%i Token%s]\n", ntok, (ntok > 1) ? "s" : "");
191 if (DEBUG) putchar('\t');
194 if (DEBUG) putchar('\n');
201 if (DEBUG) putchar('\t');
203 if (DEBUG) putchar('\n');