org.combinators.cls.inhabitation
Enumerates all combinator expressions for the tree grammar grammar
and start symbol root
.
Enumerates all combinator expressions for the tree grammar grammar
and start symbol root
.
Assumes that the grammar does not contain unproductive non-terminals:
S -> f(X, Y) | f(S); X -> A(); Y -> B(); Z -> C(); is ok S -> f(X, Y) | f(S); X -> A(); Z -> C(); is not ok, because Y is missing S -> f(S); X -> A(); Y -> B(); Z -> C(); is not ok, because S is unproductive
Helper object to obtain enumerations.