mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 14:54:07 +10:00
Kayne Ruse
14653a303f
To help with storing strings within tables, I've replaced the unused '_padding' member of 'Toy_String' with 'cachedHash', which is set to zero on string allocation. The hash of a string isn't generated and stored until it's actually needed, as the rope pattern means not every string needs a hash - hopefully this will save unnecessarily wasted time. When a hash of a string is needed, the hashing function first checks to see if that string already has one, and if so, returns it. Again, less time wasted. When generating a new string hash, the hashing function takes the string's type into account, as node-based strings first need their contents assembled into a simple char buffer. Other changes include: * Changed 'TOY_VALUE_TO_*' to 'TOY_VALUE_FROM_*' * Changed 'TOY_VALUE_IS_EQUAL' to 'TOY_VALUES_ARE_EQUAL' * Added a missing '#pragma once' to 'toy_print.h'
29 lines
755 B
C
29 lines
755 B
C
#pragma once
|
|
|
|
#include "toy_common.h"
|
|
#include "toy_token_types.h"
|
|
|
|
//lexers are bound to a string of code
|
|
typedef struct {
|
|
unsigned int start; //start of the current token
|
|
unsigned int current; //current position of the lexer
|
|
unsigned int line; //track this for error handling
|
|
const char* source;
|
|
} Toy_Lexer;
|
|
|
|
//tokens are intermediaries between lexers and parsers
|
|
typedef struct {
|
|
Toy_TokenType type;
|
|
unsigned int length;
|
|
unsigned int line;
|
|
const char* lexeme;
|
|
} Toy_Token;
|
|
|
|
TOY_API void Toy_bindLexer(Toy_Lexer* lexer, const char* source);
|
|
TOY_API Toy_Token Toy_private_scanLexer(Toy_Lexer* lexer);
|
|
TOY_API void Toy_private_printToken(Toy_Token* token); //debugging
|
|
|
|
//util
|
|
#define TOY_BLANK_TOKEN() ((Toy_Token){TOY_TOKEN_NULL, 0, 0, NULL})
|
|
|