OK, so you want a function:
parseCall: String -> String
that takes a string parses it, calls the respective FriCAS function and
returns the result as a string?
1) I separate the two stages. parseCall prepares everything for applying
the needed standard function who's name is parsed at the top.
The remaining stage is simpler.
2) First, a string is broken to lexemes : LexList ==> List String.
I am going to try the format
Sergei,
1) You give ParseCallRes as a return type. But isn't it true that in the
end you want to have a string that you can send back to Haskell?
2) Can you upload your code to your account on github and give me a link
to it. That would make it easier for me to see the development of your
code and enable me to propose some changes directly to your code.
Ralf
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
