Abstract Syntax Tree Cleanups and Resolver Rewrite

[0x19]

I have no idea what the heck it was in my head that current approach could be useful (which still will be for edge cases) but in order to resolve forwarded statements, with current approach logic of the code needs to become so complex that I just dislike idea of moving forward with it. Therefore, will introduce following changes into the code base:

• Sources sorted based on graph and topological sorting algorithms in order to sort imports by the lowest requirement to the highest. This will help to a point.
• to be defined, not sure what yet...
• Get at least a bit more code coverage and documentation done in the process... It's ridiculous that AST which is a base package is becoming less and less documented and tested.

Currently we get panics because type descriptions cannot be found, including forward contract creations that cannot be discovered in time which results in us needing to write t_unknown_{nodeId} and later on processing them in the resolver. You see, I bored myself already by just typing this thing down. That would be a shit so complex that anyone trying, including me, look into the codebase would just evaporate from the project. Therefore, lets build something performant and nice to look at.

For example, this one right here -> https://bscscan.com/address/0x7a4af156379f512de147ed3b96393047226d923f#code, jumps from contract/statement to a contract/statement like it's a candy season and thus, the reason where I've discovered numerous of panics and well... Let's fix it.

Fun to talk with myself.

[0x19]

Topological sorting is resolved: #76 It improves speed of figuring out code almost without using references which is a big win!

[0x19]

Another round of bugfixes, especially node resolution and tree building #77.

[0x19]

Completed!