lua/llex.h

65 lines
1.6 KiB
C
Raw Normal View History

1997-09-16 12:25:59 -07:00
/*
1999-06-17 10:04:03 -07:00
** $Id: llex.h,v 1.11 1999/02/25 19:13:56 roberto Exp roberto $
1999-02-25 13:07:26 -08:00
** Lexical Analyzer
1997-09-16 12:25:59 -07:00
** See Copyright Notice in lua.h
*/
#ifndef llex_h
#define llex_h
#include "lobject.h"
#include "lzio.h"
1998-05-27 06:08:34 -07:00
#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};
1999-06-17 10:04:03 -07:00
#ifndef MAX_IFS
#define MAX_IFS 5 /* arbitrary limit */
#endif
/* "ifstate" keeps the state of each nested $if the lexical is dealing with. */
struct ifState {
1999-02-25 13:07:26 -08:00
int elsepart; /* true if it's in the $else part */
int condition; /* true if $if condition is true */
1998-06-19 09:14:09 -07:00
int skip; /* true if part must be skipped */
};
typedef struct LexState {
int current; /* look ahead character */
1998-05-27 06:08:34 -07:00
int token; /* look ahead token */
struct FuncState *fs; /* 'FuncState' is private for the parser */
union {
real r;
TaggedString *ts;
} seminfo; /* semantics information */
1997-12-02 04:43:44 -08:00
struct zio *lex_z; /* input stream */
int linenumber; /* input line counter */
int iflevel; /* level of nested $if's (for lexical analysis) */
1998-01-09 06:57:43 -08:00
struct ifState ifstate[MAX_IFS];
} LexState;
void luaX_init (void);
1998-05-27 06:08:34 -07:00
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 (int token, char *s);
1997-09-16 12:25:59 -07:00
#endif