org.combinators.cls.inhabitation
Finds all productive left hand sides in rules
.
Finds all productive left hand sides in rules
.
A left hand side is productive, if any of its right hand sides only requires arguments, which are productive
left hand sides of the grammar.
Inhabits all types in targets and return a set of tree grammar rules to represent results.
Inhabits all types in targets and return a set of tree grammar rules to represent results. The resulting tree grammar is pruned to eliminate unproductive derivation chains.
Removes all unproductive left hand sides in rules
.
Removes all unproductive left hand sides in rules
.
FiniteCombinatoryLogic.groundTypesOf(Set[Rule])
for a description of productivity.
(Since version ) see corresponding Javadoc for more information.
Type inhabitation for finite combinatory logic (FCL)