3 commits

Author	SHA1	Message	Date
Sei Lisa	a87022b73f	Get rid of StSw craziness and use lsllastpass to make another pass. ... This has been a TODO item for long. Now that we have lsllastpass, it's actually easy to implement. Adds an LSLTypeDefaults dictionary to lslcommon, just in case the state-changing function returns a value and we need to insert a return statement. We've also added subtree-local info to lsllastpass (lost when we return to the parent after visiting a subtree). This fixes a bug where naked switch statements could appear as a result of optimization, and cause the compilation to fail.	2017-11-02 18:20:14 +01:00
Sei Lisa	a0d4c77081	Minor cleanups; no functional changes. ... lslcleanup: Variables renamed, order changed, comments added. Other changes: remove semicolon at end of sentence, use self.Cast instead of creating a CAST node on the fly.	2017-09-22 15:42:42 +02:00
Sei Lisa	a6a08fe3f3	Implement transformation of lists into additions. ... If the list in brackets is SEF: [a, b, ...] -> (list)a + b + ... ListExpr + [a, b, ...] -> ListExpr + a + b + ...	2017-09-15 22:30:22 +02:00