+++ /dev/null
-/*!@file
- \brief lexical analyzer implementation for APC
- \details The lexer manages two FIFO stacks. One for maintaining tokens, the
- other for maintaining a list of files to be scanned. During
- execution, the lexer will return a token from its token queue if any
- are present. If not, the lexer will will pop an element from its
- file queue to 'scanner' to be tokenized. If the file queue is empty,
- the lexer will instead call 'parsedir' to traverse the directory tree
- and tokenize the results. If 'parsedir' does not generate any new
- tokens, we are done.
- \author Jordan Lavatai
- \date Aug 2016
- ----------------------------------------------------------------------------*/
-/* Standard */
-#include <stdio.h>
-#include <string.h>
-#include <stdint.h>
-#include <errno.h>
-/* Posix */
-#include <unistd.h>
-#include <unitypes.h>
-#include <unistr.h>
-#include <uniconv.h>
-#include <uniname.h>
-#include <unistdio.h>
-#include <stdlib.h>
-#include <dirent.h>
-/* Local */
-#include "apc.h"
-#include "parser.tab.h"
-/* Public */
-/* Private */
-extern //lexer.rl
-int lexer_lexstring(uint8_t const*, int);
-extern //scanner.c
-yypstate* apc_pstate;
-extern //scanner.c
-yycstate* apc_cstate;
-
-