laentropia
f3373123e1
Now its fine, the code i find it clear if one just sits down to read it for a moment, next is the parser that REALLY needs reworking and a few helper structs.
77 lines
1.4 KiB
C
77 lines
1.4 KiB
C
#ifndef LEXER_H
|
|
#define LEXER_H
|
|
|
|
#include "arraylist.h"
|
|
#include <stddef.h>
|
|
#include <stdbool.h>
|
|
#include <stdint.h>
|
|
|
|
// For identifing
|
|
typedef enum {
|
|
TOKEN_INTEGER,
|
|
TOKEN_OPERATOR,
|
|
} TokenType;
|
|
// For classify operators
|
|
typedef enum {
|
|
OP_ADD,
|
|
OP_SUB,
|
|
OP_MUL,
|
|
OP_DIV,
|
|
OP_POW,
|
|
OP_FACTORIAL,
|
|
OP_START_PAR,
|
|
OP_END_PAR,
|
|
} Operator;
|
|
|
|
typedef enum {
|
|
LEXER_OK = 0,
|
|
LEXER_INT_OVERFLOW,
|
|
LEXER_FAILED_NUMBER_CONVERSION,
|
|
LEXER_NOT_RECOGNIZED_SYMBOL,
|
|
LEXER_EMPTY_INPUT,
|
|
LEXER_BUF_OVERFLOW,
|
|
} LexerErr;
|
|
|
|
// Can be thought as tokens, they will be used by the parser.
|
|
typedef struct {
|
|
TokenType type;
|
|
union {
|
|
int64_t num;
|
|
Operator op;
|
|
};
|
|
} Token;
|
|
|
|
typedef struct {
|
|
bool is_valid;
|
|
union {
|
|
LexerErr err;
|
|
ArrayList *arr;
|
|
};
|
|
} TokenizeResult;
|
|
|
|
typedef struct {
|
|
bool is_valid;
|
|
union {
|
|
LexerErr err;
|
|
Token token;
|
|
};
|
|
} TokenResult;
|
|
|
|
typedef struct {
|
|
bool is_valid;
|
|
union {
|
|
LexerErr err;
|
|
int64_t num;
|
|
};
|
|
} LexerI64Result;
|
|
|
|
// Lexer funtions as well as few functionality
|
|
TokenizeResult tokenize(const char* input);
|
|
TokenResult tokenize_number(const char* input, size_t *offset);
|
|
LexerI64Result string_to_integer(const char buf[]);
|
|
bool isoperator(int c);
|
|
Operator char_to_operator(int c);
|
|
char operator_to_char(Operator op);
|
|
|
|
#endif // !LEXER_H
|