Open Kerl13 opened 4 years ago
It would be a nice feature. Unfortunately, it requires the so-called general implicit theorem and, in particular, a different algorithm, see Section 5.2 of "Algorithms for Combinatorial Structures: Well-Founded Systems and Newton Iteration" by Pivoteau, Salvy, and Soria.
For the time being, you can use the --force
flag.
Oh I see, thanks for the pointer! I didn't suspect this to be that a subtle point.
If I can use the --force
flag whenever I know the general implicit theorem applies, this is not a big issue then.
Boltzmann brain rejects the binary tree example from the example folder with the following error message:
The grammar is:
I guess using
--force
on this particular example is fine but I think it'd be nice if bb could accept this type of grammars.