Lonami
Lonami
For dynamically sized lists, memory cells can indeed be used. But remember that a memory cell can be as small as 64 numbers in capacity. For this code: ```python if...
Not sure how to best answer to your comment. Tuples actually compiling to a switch seems reasonable, since we also want the following to compile: ```python index = 2 tup...
We cannot know the type of variables, so we cannot force them to be "immovable" (if by that you mean `another_tuple = tuple_variable`).
> I mean that when someone tries to copy it (`another_tuple` = `tuple_variable`) instead of `another_tuple` holding a copy of `tuple_variable` , it holds a reference of `tuple_variable`, so any...
Note that: ```python nested_tulpe = ( ("a", "b"), (1, 2), ("c", "d") ) ``` should probably compile fine and result in 4 compiled jump tables (three for the inner ones,...
Maybe: ```python tup = ("a", "b") a, b = tup ``` could also work (well, that would be another feature of tuples).
We do not care about that. Whenever the compiler sees `for VAR in ITERABLE` (where both `VAR` and `ITERABLE` are variable names the user created), we assume `ITERABLE` points to...
`Env.links()` and others are special-cased "system calls". You can tell them apart because they have the form `Namespace.name`, as opposed to just a `name` the user can create. Those work...
This would add an extra check every time such an operation occurs, with an overhead of 2 instructions (compare and jump) at a minimum. We shouldn't get too fancy. The...
I would first implement tuples and then worry about dynamic arrays (dynamic arrays could be similar to tuples. Imagine they compile to the same switch table, but instead of jumping...