1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162 |
- /*
- ** $Id: llex.h,v 1.8 1998/05/27 13:03:40 roberto Exp roberto $
- ** Lexical Analizer
- ** See Copyright Notice in lua.h
- */
- #ifndef llex_h
- #define llex_h
- #include "lobject.h"
- #include "lzio.h"
- #define FIRST_RESERVED 260
- /* maximum length of a reserved word (+1 for terminal 0) */
- #define TOKEN_LEN 15
- enum RESERVED {
- /* terminal symbols denoted by reserved words */
- AND = FIRST_RESERVED,
- DO, ELSE, ELSEIF, END, FUNCTION, IF, LOCAL, NIL, NOT, OR,
- REPEAT, RETURN, THEN, UNTIL, WHILE,
- /* other terminal symbols */
- NAME, CONC, DOTS, EQ, GE, LE, NE, NUMBER, STRING, EOS};
- #define MAX_IFS 5
- /* "ifstate" keeps the state of each nested $if the lexical is dealing with. */
- struct ifState {
- int elsepart; /* true if its in the $else part */
- int condition; /* true if $if condition is true */
- int skip; /* true if part must be skipped */
- };
- typedef struct LexState {
- int current; /* look ahead character */
- int token; /* look ahead token */
- struct FuncState *fs; /* 'FuncState' is private for the parser */
- union {
- real r;
- TaggedString *ts;
- } seminfo; /* semantics information */
- struct zio *lex_z; /* input stream */
- int linenumber; /* input line counter */
- int iflevel; /* level of nested $if's (for lexical analysis) */
- struct ifState ifstate[MAX_IFS];
- } LexState;
- void luaX_init (void);
- void luaX_setinput (LexState *LS, ZIO *z);
- int luaX_lex (LexState *LS);
- void luaX_syntaxerror (LexState *ls, char *s, char *token);
- void luaX_error (LexState *ls, char *s);
- void luaX_token2str (LexState *ls, int token, char *s);
- #endif
|