1abe5b502238a4f95fd96c0a099fcfa8b0bdfde8
2 \brief lexical analyzer implementation for APC
3 \details The lexer manages two FIFO stacks. One for maintaining tokens, the
4 other for maintaining a list of files to be scanned. During
5 execution, the lexer will return a token from its token queue if any
6 are present. If not, the lexer will will pop an element from its
7 file queue to 'scanner' to be tokenized. If the file queue is empty,
8 the lexer will instead call 'parsedir' to traverse the directory tree
9 and tokenize the results. If 'parsedir' does not generate any new
11 \author Jordan Lavatai
13 ----------------------------------------------------------------------------*/
23 #include "parser.tab.h"
25 #define DE_STACKSIZE 1024
28 #define TK_STACKSIZE 1024
33 int lexer_lexfile(const char*);
34 void lexer_pushtok(int, YYSTYPE
);
36 int lexer_lex(const char*);
37 struct dirent
* lexer_direntpa
[DE_STACKSIZE
], **lexer_direntpp
;
40 int scanner_init(void);
44 int dredge_current_depth(void);
49 { YYSTYPE lval
; //token val
50 int tok_t
; //token type
51 } token_stack
[TK_STACKSIZE
];
54 { int* tpt
; //token pointer type
56 YYSTYPE
* tvp
; //token value pointer
59 /* Directory Entity Array/Stack
60 Simple array for keeping track of dirents yet to be processed by the scanner.
61 If this list is empty and there are no tokens, the lexer is done.
62 This array is populated by the scanner as an array, and popped locally by the
65 #define DE_STACK (lexer_direntpa)
66 #define DE_STACKP (lexer_direntpp)
67 #define DE_LEN() (DE_STACKP - DE_STACK)
68 #define DE_INIT() (DE_STACKP = DE_STACK)
69 #define DE_POP() (*--DE_STACKP)
72 This is a FIFO stack whose pointers are a union of either a pointer to an
73 integer, or a pointer to two integers (a struct tok). This way, integers may
74 be added or removed from the stack either singularly (IPUSH/IPOP), or as a
75 full token of two integers (PUSH/POP).
76 An alignment error will occur if IPOP or IPUSH are used a non-even number of
79 #define TK_STACK (token_stack)
80 #define TK_STACKP (tks.tok)
81 #define TK_STACKPI (tks.tpt)
82 #define TK_STACKPL (tks.tvp)
83 #define TK_STACKX (tkx.tok)
84 #define TK_STACKXI (tkx.tpt)
85 #define TK_LEN() (TK_STACKX - TK_STACKP)
86 #define TK_INIT() (TK_STACKP = TK_STACKX = TK_STACK)
87 #define TK_POP() (*TK_STACKP++)
88 #define TK_POPI() (*TK_STACKPI++);
89 #define TK_POPL() (*TK_STACKPL++);
90 #define TK_PUSH(T,L) (*TK_STACKX++ = (struct tok){L,T})
93 The initializer returns boolean true if an error occurs, which may be handled with standard errno.
99 return scanner_init();
103 If the token buffer is empty, 'lexer' will initialize the token buffer and
104 call 'lexer_scandir'. If SCAN_ERROR is returned, an error is printed
105 before sending a null return to bison. If 0 tokens are generated, the error
106 printing is skipped. In all other cases, 'yylval' is set, and the token's
107 integer representation is returned.
111 #define SCAN_ERROR -1
112 #define TK_EMPTY (TK_STACKP == TK_STACKX)
115 fprintf(stderr,__VA_ARGS__); \
120 while (DE_LEN() > 0) //lex any directory entries in our stack
121 if (lexer_lexfile(DE_POP()->d_name
) == 0)
122 FAIL("Lexer failed to tokenize [%s]\n",(*DE_STACKP
)->d_name
);
123 if (TK_EMPTY
) //if there are no tokens,
124 { TK_INIT(); //initialize the token stack back to 0
126 { case SCAN_ERROR
: //if an error occurred,
127 FAIL("Scanner error\n");
128 case 0: //if the the scanner finds no dirents,
129 goto done
; //then we are done
130 default: //if we found some elements to scan,
131 goto start
; //start over and lex them
143 This receiver takes a struct tok and pushes it to the FIFO stack.
146 #define $($)#$ //stringifier
147 #define ERR_TK "Fatal: Generated over " $(TK_STACKSIZE) " tokens in one pass."
148 ( int tok
, YYSTYPE lval
)
149 { if (TK_LEN() >= TK_STACKSIZE
)
150 { fprintf(stderr
, ERR_TK
);
154 printf("Pushed Token %i | %i\n", TK_STACK
[TK_LEN() - 1].tok_t
, TK_STACK
[TK_LEN() - 1].lval
.val
);
157 /* Lexical analysis of a file
158 Strips a filename to its base name, then sends it to lexer_lex
161 #define MAX_FNAME 2048
162 #define HIDDEN_WARNING "%s is hidden and will not be parsed!\n", filename
163 ( const char *filename
165 { static char fname
[MAX_FNAME
];
166 char *last_period
= NULL
, *iter
;
168 if (*filename
== '.')
169 { fprintf (stderr
, HIDDEN_WARNING
);
172 strncpy(fname
,filename
,MAX_FNAME
);
174 for (iter
= fname
; *iter
; iter
++)
179 return lexer_lex(fname
);