From ece202806a0621329a9c301996d0f519b018e9bd Mon Sep 17 00:00:00 2001 From: bculkin2442 Date: Thu, 21 Apr 2016 21:14:39 -0400 Subject: Fixed lazy evaluation of arrays --- .../dicelang/ast/DiceASTReferenceSanitizer.java | 48 ++++++++++++---------- 1 file changed, 26 insertions(+), 22 deletions(-) (limited to 'dice-lang/src/main/java/bjc/dicelang/ast/DiceASTReferenceSanitizer.java') diff --git a/dice-lang/src/main/java/bjc/dicelang/ast/DiceASTReferenceSanitizer.java b/dice-lang/src/main/java/bjc/dicelang/ast/DiceASTReferenceSanitizer.java index 6263ea9..9ace97f 100644 --- a/dice-lang/src/main/java/bjc/dicelang/ast/DiceASTReferenceSanitizer.java +++ b/dice-lang/src/main/java/bjc/dicelang/ast/DiceASTReferenceSanitizer.java @@ -34,8 +34,8 @@ public class DiceASTReferenceSanitizer { }); } - private static TopDownTransformResult - shouldSanitize(IDiceASTNode node) { + private static TopDownTransformResult shouldSanitize( + IDiceASTNode node) { if (!node.isOperator()) { return TopDownTransformResult.SKIP; } @@ -63,7 +63,7 @@ public class DiceASTReferenceSanitizer { throw new UnsupportedOperationException( "Assignment must have two arguments."); } - + ITree nameTree = ast.getChild(0); ITree valueTree = ast.getChild(1); @@ -73,8 +73,8 @@ public class DiceASTReferenceSanitizer { nameTree.doForChildren((child) -> { if (allSimpleVariables.getValue()) { - boolean isSimple = - DiceASTUtils.containsSimpleVariable(child); + boolean isSimple = DiceASTUtils + .containsSimpleVariable(child); allSimpleVariables.replace(isSimple); } @@ -104,20 +104,20 @@ public class DiceASTReferenceSanitizer { if (valueTree.getHead() == OperatorDiceNode.ARRAY) { IHolder childCounter = new Identity<>(0); - ITree returnTree = - new Tree<>(OperatorDiceNode.ARRAY); + ITree returnTree = new Tree<>( + OperatorDiceNode.ARRAY); nameTree.doForChildren((child) -> { String variableName = child.transformHead((node) -> { return ((VariableDiceNode) node).getVariable(); }); - ITree currentValue = - valueTree.getChild(childCounter.getValue()); + ITree currentValue = valueTree + .getChild(childCounter.getValue()); - ITree sanitizedSubtree = - doSingleSanitize(ast, enviroment, child, - currentValue, variableName); + ITree sanitizedSubtree = doSingleSanitize( + ast, enviroment, child, currentValue, + variableName); if (sanitizedSubtree == null) { ITree oldTree = new Tree<>( @@ -134,8 +134,8 @@ public class DiceASTReferenceSanitizer { return returnTree; } - ITree returnTree = - new Tree<>(OperatorDiceNode.ARRAY); + ITree returnTree = new Tree<>( + OperatorDiceNode.ARRAY); nameTree.doForChildren((child) -> { String variableName = child.transformHead( @@ -144,8 +144,8 @@ public class DiceASTReferenceSanitizer { ITree sanitizedChild = doSingleSanitize(ast, enviroment, child, valueTree, variableName); if (sanitizedChild == null) { - ITree oldTree = - new Tree<>(ast.getHead(), child, valueTree); + ITree oldTree = new Tree<>(ast.getHead(), + child, valueTree); returnTree.addChild(oldTree); } else { @@ -177,16 +177,20 @@ public class DiceASTReferenceSanitizer { if (enviroment.containsKey(variableName)) { // @ is a meta-variable standing for the left side of an // assignment - enviroment.put("@", enviroment.get(variableName)); + ITree oldVal = enviroment.put("@", + enviroment.get(variableName)); // We should always inline out references to last, because it // will always change - ITree inlinedValue = - DiceASTInliner.selectiveInline(valueTree, enviroment, - variableName, "last", "@"); + ITree inlinedValue = DiceASTInliner + .selectiveInline(valueTree, enviroment, variableName, + "last", "@"); - // Remove temporary meta-variable - enviroment.remove("@"); + if (oldVal != null) { + enviroment.put("@", oldVal); + } else { + enviroment.remove("@"); + } return new Tree<>(ast.getHead(), nameTree, inlinedValue); } -- cgit v1.2.3