TODO:

delete deleted daughters from daughters of rule, since they can't ever be present in unified-in daughters

figure out why unpacking is so much slower than PET (sometimes 10x slower!)
	- mrs extraction is the big bottleneck
	- approach one: memoization; most bits and pieces of MRS are reused many times
		- tried this on mrs_var's with good results, should also do ep's and hcon's
	- type names perhaps should be pointers to types, since much time is spent looking up and comparing types
	- maybe some other aspects of unpacking are slow? not clear yet.

learn something from head-corner strategy

freeze qc settings into grammar file

ignore punctuation-chars for jacy

freeze POST & configurable-ize it

try to prove/analyze interesting things at grammar compile time
	- *intelligently* auto pick quickcheck paths
		- make quickcheck used for packing ignore packing restrictor
		- and the shameless hack(tm) in qc.c with 0-1-lists
	- e.g. the INFLECTD is monotonic, '-' becomes '+'
		- this would help rule out applying inflectional rules like non3sg_fin_verb when 3sg_fin_verb is on the orth-agenda
		- might be lots of other such features we could find
	- auto pick packing restrictor
	- for each type of rule, precompute segments of the rule which are non-reentrant with ARGS[k]
		- then on filling in ARGS[k], copy() can know to structure-share without looking at those segments

find a way of making web / email ersatz work; preprocessor breaks them now, thanks to new treatment which separates U.S. into U. S. and X/Y into X / Y...

optimize lexicon storage; maybe use provided lexdb schema
maybe support lexdb

make STEM actually be updated by ortho rules; apparently some grammars depend on it.

make unpacking support 2+-ary

loading: use an instance to define configuration paths?

check correctness of unicode support for preprocessor and morphology somehow
	- possibly still need a call to setlocale() in main()