Fixed a bug
parent
8871f1430d
commit
e41de764e8
16
lamb/node.py
16
lamb/node.py
|
@ -372,7 +372,7 @@ class Call(Node):
|
|||
def print_node(node: Node) -> str:
|
||||
if not isinstance(node, Node):
|
||||
raise TypeError(f"I don't know how to print a {type(node)}")
|
||||
else:
|
||||
|
||||
out = ""
|
||||
|
||||
for s, n in node:
|
||||
|
@ -489,16 +489,13 @@ def bind_variables(node: Node, *, ban_macro_name = None) -> None:
|
|||
# Returns the function's output.
|
||||
def call_func(fn: Func, arg: Node):
|
||||
for s, n in fn:
|
||||
if isinstance(n, Bound):
|
||||
if isinstance(n, Bound) and (s == Direction.UP):
|
||||
if n == fn.input:
|
||||
if n.parent is None:
|
||||
raise Exception("Tried to substitute a None bound variable.")
|
||||
|
||||
if n.parent_side == Direction.LEFT:
|
||||
n.parent.left = clone(arg)
|
||||
else:
|
||||
n.parent.right = clone(arg)
|
||||
return fn.left
|
||||
n.parent.set_side(n.parent_side, clone(arg)) # type: ignore
|
||||
return clone(fn.left)
|
||||
|
||||
|
||||
# Do a single reduction step
|
||||
|
@ -514,7 +511,10 @@ def reduce(node: Node, *, macro_table = {}) -> tuple[ReductionType, Node]:
|
|||
out = call_func(n.left, n.right)
|
||||
out._set_parent(None, None)
|
||||
else:
|
||||
n.parent.left = call_func(n.left, n.right)
|
||||
n.parent.set_side(
|
||||
n.parent_side, # type: ignore
|
||||
call_func(n.left, n.right)
|
||||
)
|
||||
|
||||
return ReductionType.FUNCTION_APPLY, out
|
||||
|
||||
|
|
|
@ -11,7 +11,6 @@ class StopReason(enum.Enum):
|
|||
LOOP_DETECTED = ("class:warn", "Loop detected")
|
||||
MAX_EXCEEDED = ("class:err", "Too many reductions")
|
||||
INTERRUPT = ("class:warn", "User interrupt")
|
||||
RECURSION = ("class:err", "Python Recursion Error")
|
||||
|
||||
class MacroDef:
|
||||
@staticmethod
|
||||
|
@ -107,9 +106,10 @@ class Runner:
|
|||
node,
|
||||
macro_table = self.macro_table
|
||||
)
|
||||
except RecursionError:
|
||||
stop_reason = StopReason.RECURSION
|
||||
except KeyboardInterrupt:
|
||||
stop_reason = StopReason.INTERRUPT
|
||||
break
|
||||
|
||||
node = new_node
|
||||
|
||||
# If we can't reduce this expression anymore,
|
||||
|
|
Reference in New Issue