In your opinion would you consider that task to be too challenging for a first
year?
All I can for see is adding a quantifier class under the symbol module.it would
then need to check if what its being imputed is either an English word or a
symbol then convert it to the opposite and return.
An example of this would be given the parameters
Domain: The set of programs, P.
Let S(x) represent x has a syntax error.
Let C(x) represent x will compile
and the the logic statement ForAll(p) Element(P); S(p) = !C(p)
And it would return the English sentence: “If a program has a syntax error,
Oh, we currently don't have any quantifier support, so that would have
to be added first.
Aaron Meurer
On Tue, Apr 23, 2013 at 8:36 PM, Marsci estebanm...@gmail.com wrote:
An example of this would be given the parameters
Domain: The set of programs, P.
Let S(x) represent x has a syntax error.
I have not been able to find anything in the SymPy for a logic
statement translator. I was wondering if this would this be a good module
to implement or would it veer too far from the symbolic aspect that is
SymPy? The translator would take a logic statement given in symbolic
notation and
Can you give a concrete example of this? I suppose it would just be
implemented as a printer.
Aaron Meurer
On Mon, Apr 22, 2013 at 2:49 PM, Marsci estebanm...@gmail.com wrote:
I have not been able to find anything in the SymPy for a logic statement
translator. I was wondering if this would
