Next: Cyclic and non-cyclic Up: Reversible Unification Grammars Previous: Computability
Possible relaxations
It is easy to see that the completeness and coherence requirements make life hard for the rulewriter as she/he needs to know exactly what the possible values of inputs are for some component. It is possible to relax the completeness and coherence requirement in two ways that will not affect the reversibility properties between strings. The usefulness of these relaxations depends on the analyses a user wishes to define.
Gertjan van Noord
Fri Nov 25 13:42:02 MET 1994