6 Commits

Author	SHA1	Message	Date
Daniel Lubarov	7e91720088	Store literals as U256 (or u8 for BYTES) ... Instead of the original strings. Will make optimizations simpler.	2022-07-31 12:12:35 -07:00
Daniel Lubarov	bd6847e8fc	Allow %stack to work with labels ... There's no syntax to distinguish named stack items from labels, so this simply searches the former first. I.e. labels can be shadowed by stack items.	2022-07-31 12:12:17 -07:00
Daniel Lubarov	c7ba4eb6ee	Feedback	2022-07-20 09:45:05 -07:00
Daniel Lubarov	78fb34a9b6	Minor	2022-07-20 00:10:52 -07:00
Daniel Lubarov	1a0d6f4413	Pruning	2022-07-19 23:43:29 -07:00
Daniel Lubarov	05a1fbfbae	Stack manipulation macro ... Uses a variant of Dijkstra's, with a few pruning mechanics, to find a path of instructions between the two stack states. We don't explicitly store the graph though. The Dijkstra implementation is somewhat inspired by the `pathfinding` crate. That crate doesn't quite fit our needs though. If we need to make it faster later, there are a lot of allocations and clones that we could probably eliminate.	2022-07-19 22:59:56 -07:00