Parser
This is the LookupTreeAdaptor for building and navigating the lazyTypeFilterTrees. It gets built from 2-tuples containing a phrase type and a corresponding A_ParsingPlanInProgress. The type is used to perform type filtering after parsing each leaf argument, and the phrase type is the expected type of that latest argument.
Functions
Compare two types to produce a TypeComparison.
Create a LookupTree, using the provided collection of Elements, and the list of initial argument types.
Compute the bounding signature from the given List of TypeRestrictions.
Convert from an Element to a suitable A_Type for organizing the tree.
Use the tuple of types to traverse the tree. Answer the solution, a Result. Uses iteration rather than recursion to limit stack depth.
Use the given singular value to traverse the tree. Answer the solution, a Result. Uses iteration rather than recursion to limit stack depth.
Given a List of A_BasicObjects, use their types to traverse the LookupTree. Answer the solution, a Result. Uses iteration rather than recursion to limit stack depth.
true if Elements with more specific signatures exclude those with strictly more general signatures, false otherwise.
true if the tree uses whole type testing, or false if the tree tests individual elements of a tuple type.