Changeset bbd44c5

Timestamp:

Nov 21, 2016, 11:38:16 AM (8 years ago)

Author:

Aaron Moss <a3moss@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

687165a

Parents:

ba5131d

Message:

Updated resolver design working doc with ideas from meeting with Dr. Van Beek

File:

• doc/working/resolver_design.md (modified) (1 diff)

doc/working/resolver_design.md

@@ -1382 +1382 @@
 hypothesis needs to be empirically validated.
 
+Another approach would be to abandon expression-tree ordering for 
+subexpression matching, and order by "most constrained symbol"; symbols would  
+be more constrained if there were fewer matching declarations, fewer 
+subexpressions yet to resolve, or possibly fewer possible types the expression 
+could resolve to. Ordering the expressions in a priority-queue by this metric 
+would not necessarily produce a top-down or a bottom-up order, but would add 
+opportunities for pruning based on memoized upper and lower bounds.
+
 Both Baker and Cormack explicitly generate all possible interpretations of a 
 given expression; thinking of the set of interpretations of an expression as a