Changeset 66f8528 for doc/working/resolver_design.md

Timestamp:

Dec 15, 2016, 5:16:42 PM (9 years ago)

Author:

Rob Schluntz <rschlunt@…>

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:

43385ca, f7ff3fb

Parents:

5802a4f (diff), 596f987b (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' into tuples

Conflicts:

src/ResolvExpr/CommonType.cc
src/tests/.expect/32/extension.txt
src/tests/.expect/32/gccExtensions.txt
src/tests/.expect/64/declarationSpecifier.txt
src/tests/.expect/64/extension.txt
src/tests/.expect/64/gccExtensions.txt
src/tests/.expect/castError.txt
src/tests/Makefile.am

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