修改了输出&增加对加减乘除的求导运算

Author: 冷漠

SCMath.pro.user

@@ -1,6 +1,6 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <!DOCTYPE QtCreatorProject>
-<!-- Written by QtCreator 4.5.0, 2019-02-15T12:44:16. -->
+<!-- Written by QtCreator 4.5.0, 2019-02-17T11:29:11. -->
 <qtcreator>
  <data>
   <variable>EnvironmentId</variable>

ast.cpp

@@ -9,7 +9,6 @@ map<string,int> ast::BinOpPriority;
 
 static void ast::Init()
 {
-
     //初始化所有内置函数实体
     Function* add = new Function(BuiltinFunc::hasTwoSonNodes, BuiltinFunc::add,2);
     Function* sub = new Function(BuiltinFunc::hasTwoSonNodes, BuiltinFunc::sub,2);
@@ -49,7 +48,7 @@ bool ast::isLetter(const char &c)
     return (c >= 'A' && c <='Z') || (c >= 'a' && c <= 'z');
 }
 
-bool ast::canpush(stack<string> &stackOp, string op)
+bool ast::canpush(stack<string> &stackOp, const string& op)
 {
     if (stackOp.empty()) return true;
     return BinOpPriority[op] > BinOpPriority[stackOp.top()];
@@ -69,7 +68,7 @@ BasicNode* ast::__ToAST(string &s)
 
         if ((s[j] == '+' || s[j] == '-') && (j == 0 || isBinOp(s[j - 1])))
        {
-            temp += s[j];
+            j++;
         }//检查负号还是减号
         if(j < n && isNum(s[j]))
         {
@@ -95,11 +94,11 @@ BasicNode* ast::__ToAST(string &s)
             {
                  FunNode* node = new FunNode(record::globalScope.functionList[s.substr(i, j - i)]);
                  //此时s[j] == '('
-                 while(s[j] != ')' && s[j] != '$')
+                 while(s[j] != ')' && s[j] != LowestPriority)
                  {
                      i = j;
                      j++;
-                    while(j < n && s[j] != ',' && s[j] != ')' && s[j] != '$')
+                    while(j < n && s[j] != ',' && s[j] != ')' && s[j] != LowestPriority)
                         j++;
                     node->addNode(ToAST(s.substr(i + 1, j - i - 1)));
                  }
@@ -133,7 +132,7 @@ BasicNode* ast::__ToAST(string &s)
         }
 
 
-        if(i < n && (isBinOp(s[i]) || s[i] == '$'))//按理说，一个数字/变量/函数结束之后是一个运算符/字符串结尾
+        if(i < n && (isBinOp(s[i]) || s[i] == LowestPriority))//按理说，一个数字/变量/函数结束之后是一个运算符/字符串结尾
         {
           if (canpush(stackOp, s.substr(i,1)))
           {

ast.h

@@ -15,11 +15,12 @@ class record
 
 namespace ast
 {
+    static const char LowestPriority = '$';
     extern bool isInit;
     extern map<string,int> BinOpPriority;
 
     static void Init();
-    static bool canpush(stack<string> &, string);
+    static bool canpush(stack<string> &, const string &);
     static bool isNum(const char &);
     static bool isBinOp(const char &);
     static bool isLetter(const char &);

main.cpp

@@ -8,21 +8,49 @@ using namespace std;
 
 int main()
 {
-    /*
-    string s = "1+2-3*4/5*(7+8-b)+sin(0)+a + 2 ^    5 ";
-    BasicNode* ans = ast::ToAST(s);
-    output::outputAST(ans);
+
+    string TestBuildTree = "1-(2+3)-(4-5)";
+    BasicNode* ansTestBuildTree = ast::ToAST(TestBuildTree);
+    BasicNode* ansAfterEval;
+    output::outputASTstruct(ansTestBuildTree);
+    output::outputAST(ansTestBuildTree);
+    cout << endl;
+    output::outputAST(ansAfterEval = ansTestBuildTree ->eval());
+    cout << endl;
+    delete ansAfterEval;
+    output::outputAST(ansTestBuildTree);
+    cout << endl << endl;
+    delete ansTestBuildTree;
+
+    string TestSimplificate ="(1+2)*(3+4)+(a+b)/(c+d)";
+    BasicNode* ansTestSimplificate = ast::ToAST(TestSimplificate);
+    output::outputAST(ansTestSimplificate);
+    cout << endl;
+    Simplificate(ansTestSimplificate);
+    output::outputAST(ansTestSimplificate);
+    cout << endl << endl;
+    delete ansTestSimplificate;
+
+    string TestDerivation = "a+b-c*d/e";
+    BasicNode* ansTestDerivation = ast::ToAST(TestDerivation);
+    BasicNode* ansAfterDerivation;
+    output::outputAST(ansTestDerivation);
     cout << endl;
-    output::outputAST(ans ->eval());
+    ansAfterDerivation = Derivation(ansTestDerivation, "a");
+    Simplificate(ansAfterDerivation);
+    output::outputAST(ansAfterDerivation);
     cout << endl;
-    output::outputAST(ans);
-    */
-    string s ="(1+2)*(3+4)+(a+b)/(c+d)";
-    BasicNode* ans = ast::ToAST(s);
-    output::outputAST(ans);
+    delete ansAfterDerivation;
+    ansAfterDerivation = Derivation(ansTestDerivation, "c");
+    Simplificate(ansAfterDerivation);
+    output::outputAST(ansAfterDerivation);
     cout << endl;
-    Simplificate(ans);
-    output::outputAST(ans);
+    delete ansAfterDerivation;
+    ansAfterDerivation = Derivation(ansTestDerivation, "e");
+    Simplificate(ansAfterDerivation);
+    output::outputAST(ansAfterDerivation);
     cout << endl;
+    delete ansAfterDerivation;
+    delete ansTestDerivation;
     return 0;
 }

output.cpp

@@ -8,37 +8,75 @@ bool output::isBinOp(const string &c)
 }
 
 
-void output::outputAST(BasicNode* now, int fatherpriority)
+void output::outputAST(BasicNode* now, const string& FatherOP)
 {
     if(now == nullptr)
         return;
-    if(now->getType() == Num){
-        cout << ((NumNode*)now)->getNum();
+    if(now->getType() == Num)
+    {
+        double nownum = ((NumNode*)now)->getNum();
+        if(nownum < 0)
+            cout << '(' << nownum << ')';
+        else
+            cout << nownum;
         return;
     }
-    if(now->getType() == Fun){
+    if(now->getType() == Fun)
+    {
         FunNode* t = (FunNode*)now;
-        Function* l = t->getEntity();
-        if(output::isBinOp(l->NAME)){
-            if(ast::BinOpPriority[l->NAME] < fatherpriority)
+        string op = t->getEntity()->NAME;
+        if(output::isBinOp(op))
+        {
+            if(ast::BinOpPriority[op] < ast::BinOpPriority[FatherOP])
                 cout << '(';
-            outputAST(t->sonNode[0], ast::BinOpPriority[l->NAME]);
-            cout << l->NAME;
-            outputAST(t->sonNode[1], ast::BinOpPriority[l->NAME]);
-            if(ast::BinOpPriority[l->NAME] < fatherpriority)
+            outputAST(t->sonNode[0], op);
+            cout << op;
+            if(op == "-" && t->sonNode[1]->getType() == Fun && ast::BinOpPriority[op] == ast::BinOpPriority[((FunNode*)(t->sonNode[1]))->getEntity()->NAME])
+                cout << '(';
+            outputAST(t->sonNode[1], op);
+            if(ast::BinOpPriority[op] < ast::BinOpPriority[FatherOP])
+                cout << ')';
+            if(op == "-" && t->sonNode[1]->getType() == Fun && ast::BinOpPriority[op] == ast::BinOpPriority[((FunNode*)(t->sonNode[1]))->getEntity()->NAME])
                 cout << ')';
             return;
         }
-        cout << l->NAME << '(';
-        for(int i = 0 ; i < l->getParnum(); i++){
+        cout << op << '(';
+        int n = t->getEntity()->getParnum();
+        for(int i = 0 ; i < n; i++)
+        {
             outputAST(t->sonNode[i], 0);
-            if(i != l->getParnum() - 1)
+            if(i != n - 1)
                 cout << ",";
         }
         cout << ')';
         return;
     }
-    if(now->getType() == Var){
+    if(now->getType() == Var)
+    {
         cout << ((VarNode*)now)->NAME;
     }
 }
+
+void output::outputASTstruct(BasicNode* now, int depth)//方便输出AST结构(并没有找到别的好方法)
+{
+    for(int i = 0; i < depth; i++)
+        cout << ' ';
+    if(now->getType() == Num)
+    {
+        cout << ((NumNode*)now)->getNum() << endl;
+        return;
+    }
+    if(now->getType() == Var)
+    {
+        cout << ((VarNode*)now)->NAME << endl;
+        return;
+    }
+    if(now->getType() == Fun)
+    {
+        FunNode* temp = (FunNode*)now;
+        int n = temp->getEntity()->getParnum();
+        cout << temp->getEntity()->NAME << endl                                                ;
+        for(int i = 0; i < n; i++)
+            outputASTstruct(temp->sonNode[i], depth+1);;
+    }
+}

output.h

@@ -5,5 +5,6 @@
 namespace output
 {
     static bool isBinOp(const string &c);
-    void outputAST(BasicNode* ,int = 0);
+    void outputAST(BasicNode* ,const string& = string(ast::LowestPriority, 1));
+    void outputASTstruct(BasicNode*, int = 0);
 }