A lambda calculus expression parser.
|
|
|
|
|
process(self,
data)
Put whitespace between symbols to make parsing easier |
source code
|
|
|
get_all_symbols(self)
This method exists to be overridden |
source code
|
|
|
inRange(self,
location)
Return TRUE if the given location is within the buffer |
source code
|
|
|
|
|
|
|
parse_Expression(self,
allow_adjuncts=True)
Parse the next complete expression from the stream and return it. |
source code
|
|
|
handle(self,
tok)
This method is intended to be overridden for logics that use
different operators or expressions |
source code
|
|
|
|
|
|
|
|
|
|
|
get_QuantifiedExpression_factory(self,
tok)
This method serves as a hook for other logic parsers that have
different quantifiers |
source code
|
|
|
|
|
|
|
|
|
make_EqualityExpression(self,
first,
second)
This method serves as a hook for other logic parsers that have
different equality expression classes |
source code
|
|
|
|
|
get_BooleanExpression_factory(self)
This method serves as a hook for other logic parsers that have
different boolean operators |
source code
|
|
|
make_BooleanExpression(self,
type,
first,
second)
This method exists to be overridden by parsers with more complex
logic for creating BooleanExpressions |
source code
|
|
|
|
|
make_ApplicationExpression(self,
function,
argument) |
source code
|
|
|
|
|
make_LambdaExpression(self,
variable,
term) |
source code
|
|
|
|
|
|