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'
23 lines
465 B
C
23 lines
465 B
C
#pragma once
|
|
|
|
#include "toy_common.h"
|
|
|
|
#include "toy_lexer.h"
|
|
#include "toy_ast.h"
|
|
|
|
typedef struct Toy_Parser {
|
|
Toy_Lexer* lexer;
|
|
|
|
//last two outputs
|
|
Toy_Token current;
|
|
Toy_Token previous;
|
|
|
|
bool error;
|
|
bool panic; //currently processing an error
|
|
} Toy_Parser;
|
|
|
|
TOY_API void Toy_bindParser(Toy_Parser* parser, Toy_Lexer* lexer);
|
|
TOY_API Toy_Ast* Toy_scanParser(Toy_Bucket** bucketHandle, Toy_Parser* parser);
|
|
TOY_API void Toy_resetParser(Toy_Parser* parser);
|
|
|