FMSLogo Code

Refactoring: Extract function retreeify_running_proc()
This is a chunk of logic from the evaluator that doesn't access much of the evaluator's state.
Moving this logic into its own function enables getting rid of a label in evaluator().

Correct some misinformation in a comment.
When the Unbound generation is propagated up, it's not applied to the first line.
It's applied to the "bodylist", which is the container for the first node.

Cleanup: Remove unused local variable "definition"

Fix a bug in the way debug_dump_node printed repated CASEOBJ nodes.

Add debug_dump_node(), a debug-only function to be called in gcc to dump a NODE*.
This is different from debug_print_node() which only prints the NODE* but doesn't show its structure or print the objects.
I implemented just enough to give me insight into the structure of a TREE.
It feels like this would be better implemented as a gdb extension, but I don't know how to do that.

Add more description for TREE and LINE.

Add test variations for SUM with various strings.
These are mostly tests for cnv_node_to_numnode and unfortunately found Bug #623

Refactoring: Simplify the implementation of lword.

Add some tests for the vbar behavior of WORD

Add tests to ensure that the recoverable errors of WORD are really recoverable.