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 --> @(X -> Y, X) | @(S -> S, S); S -> S --> f; X -> Y --> g; X --> A; Y --> B; Z --> C; is ok S --> @(X -> Y, X) | @(S -> S, S); S -> S --> f; X -> Y --> g; X --> A; Z --> C; is not ok, because Y is missing S --> @(S -> S, S); S -> S --> f; X -> Y --> g; X --> A; Y --> B; Z --> C; is not ok, because S is unproductive
(Since version ) see corresponding Javadoc for more information.
Helper object to obtain enumerations.