class Arborist::ExprCall

Overview

The various ExprCall classes represent invocations, or calls, of the various expression types, at different positions in an input string. The invocations/calls form a call stack, because a PEG parser is by nature a recursive descent parser, and each rule application and the evaluations of the different expressions that make up those rules form a call stack.

Direct Known Subclasses

Defined in:

arborist.cr

Constructors

Instance Method Summary

Constructor Detail


[View source]

Instance Method Detail

def expr : Expr #

[View source]
def expr=(expr : Expr) #

[View source]
def inspect(io) #

[View source]
def pos : Int32 #

[View source]
def pos=(pos : Int32) #

[View source]