Open aconstlink opened 1 year ago
At the moment, there is no time for this kind of endeavor. The current parser needs to handle much of the problem. There could be a intermediate solution by just inserting new "tags" into the statement list the parser creates so the generators could react appropriate.
For better code analysis, a node tree is requried for the nsl code. At the moment, all the post parse structures, handed over to the generators, store strings where the generators need to go over the whole code again. For a more efficient code handling, it needs to be represented in binary form as a node graph.
Basically this #323