class Arborist::ExprCallTreeController

• Arborist::ExprCallTreeController
• Reference
• Object

Defined in:

expression_call_tree.cr

Constructors

• .new

Instance Method Summary

• #add(pos : Int32, rule : Rule, memoized_parse_tree : MemoizedParseTree) : MemoizedParseTree
• #apply_calls_in_call_stack : Array(ApplyCall)
• #apply_calls_that_resulted_in_left_recursion : Array(ApplyCall)
• #current_apply_node : ApplyCallTree | Nil
• #current_apply_node=(current_apply_node : ApplyCallTree | Nil)
• #current_expr_call_failed
• #current_node : ExprCallTree | Nil
• #current_node=(current_node : ExprCallTree | Nil)
• #exist?(pos : Int32, rule : Rule) : Bool
• #lookup(pos : Int32, rule : Rule) : MemoizedParseTree | Nil
• #lookup_most_recent_rule_application_in_call_stack(rule : Rule) : ApplyCall | Nil

  returns the deepest/most-recent application of rule in the rule application stack

• #lookup_oldest_rule_application_that_resulted_in_left_recursion(rule) : ApplyCall | Nil

  returns the leftmost/earliest/oldest/shallowest application of rule in the rule application stack that resulted in left recursion

• #lookup_rule_application_in_call_stack(rule : Rule, pos : Int32) : ApplyCall | Nil
• #most_recent_rule_application : ApplyCall | Nil
• #pop_off_of_call_stack : ExprCall

  this assumes that popping off will work

• #push_onto_call_stack(expr_call : ExprCall)
• #reset
• #root : ExprCallTree | Nil
• #root=(root : ExprCallTree | Nil)
• #rule_in_recursion_call_stack_state : Array(Tuple(Int32, Rule))

  returns an array of {pos, rule} pairs representing the ApplyCalls from the call stack that all resulted in left recursion

• #top_apply_call_that_resulted_in_left_recursion : ApplyCallTree | Nil

Constructor Detail

Instance Method Detail