New structure : VM bytecode and compiling#1
Merged
Merged
Conversation
BREAKING CHANGE: Replace AST evaluation with bytecode VM - Add bytecode VM with stack-based architecture (~2μs execution time) - Implement 18 opcodes (PUSH, LOAD_GLOBAL, OP_EQ, OP_IN, etc.) - Support for int8/16/32, string, bool, and array types - Optimized handlers using array lookup instead of switch - Add Value.Compare() for unified comparisons - Remove redundant opcodes (NEQ, NOT_CONTAINS) in favor of composition - VM supports record loading and bytecode execution Performance: ~10x faster at least than AST walking for repeated queries
Also refactored int and string with generic function
Enhanced AST and Parser with NOT support. Removed MATCHES Operator for this current version, will be implemented in further version.
Now use a vm with bytecode compilation and enhanced parser
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Entirely terraformed this project with a more efficient structure : bytecode interpretation.
Previously, it was just AST-Walking. Created a stack-based VM in Go, make my AST compiles each node in bytecode recursively and so added execution of this bytecode.
Simple architecture but robust. Added a lot of tests to cover all the important parts.
Removed
MATCHESoperator for the moment, will add in a future release.Also remade the negation and logical operators section. 🙃