代码汇总

///小C语言程序
/*******************
此程序只是将源程序分解为各个单词按顺序输出。
******************/
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
string name[5] = {"keyword","identifier","integer","boundary","operator"};
string key[6] = {"main","if","else","for","while","int"};
void pre(string ch)///处理关键字，自定义标识符，数字
{
    if(ch[0] >= '0'&&ch[0] <= '9') ///以数字开头肯定就是数字了
    {
        cout<<"("<<name[2]<<","<<ch<<")"<<endl;
    }
    else  ///判断是关键字还是自定义的东东。
    {
        int f = 1;
        for(int i = 0; i < 6; i++)
        {
            if(ch == key[i])
            {
                f = 0;
                cout<<"("<<name[0]<<","<<ch<<")"<<endl;
            }
        }
        if(f)
        {
            cout<<"("<<name[1]<<","<<ch<<")"<<endl;
        }
    }
}
int main() ///处理运算符，界符
{
string s;
while(cin>>s)
{
     int len = s.length();
     string temp = "";
     for(int i = 0; i < len; i++)
     {
         if(s[i] == '='||s[i] == '+'||s[i] == '-'||s[i] == '*'||s[i] == '/'||s[i] == '!'||s[i] == '>'||s[i] == '<')
         {
             if(temp.length())
             {
                 pre(temp);
             }
             temp = "";
             if(s[i+1] == '=')///处理==和!=运算符
             {
                 cout<<"("<<name[4]<<","<<s[i]<<s[i+1]<<")"<<endl;
                 i++;
             }
             else
             {
                 cout<<"("<<name[4]<<","<<s[i]<<")"<<endl;
             }
         }
         else if(s[i] == '('||s[i] == ')'||s[i] == '{'||s[i] == '}'||s[i] == ','||s[i] == ';')
            {
                if(temp.length())
                {
                    pre(temp);
                }
                temp = "";
                cout<<"("<<name[3]<<","<<s[i]<<")"<<endl;
            }
            else ///遇到关键字了吗？自定义东东了吗？数字了吗？在这里是判断不出来的。因为其后面是啥东东还不知道，所以不能冲动地输出哦。
            {
                temp+=s[i];
            }
     }
      if(temp.length()) ///搞出来字符串的最后几个符号（一定为非运算符，操作符）
      {
          pre(temp);
      }
}
return 0;
}

///表达式语法分析
/*********************
此程序用于输出分析每个语句表达式时用到的所有产生式。
*********************/
#include <bits/stdc++.h>
using namespace std;
char str[100];
int num = 0;
int cur = 0;
void E();
void G();
void T();
void S();
void F();
void G()
{
    if(str[cur] == '+')
    {
        printf("%d G-->+TG\n",num++);
        cur++;
        T();
        G();
    }
    else
        printf("%d G-->&\n",num++);
}
void S()
{
    if(str[cur] == '*')
    {
        printf("%d S-->*FS\n",num++);
        cur++;
        F();
        S();
    }
    else
        printf("%d S-->&\n",num++);
}
void F()
{
    if(str[cur] == 'i')
    {
        printf("%d F-->i\n",num++);
        cur++;
    }
    else
    if(str[cur] == '(')
    {
        printf("%d F-->(E)\n",num++);
        cur++;
        E();
        if(str[cur] == ')')
        {
            cur++;
        }
        else
        {
            printf("error\n");
            exit(0);
        }
    }
    else
    {
        printf("error\n");
        exit(0);
    }
}
void E()
{
    if(str[cur] == '('||str[cur] == 'i')
    {
    printf("%d E-->TG\n",num++);
    T();
    G();
    }
    else
    {
        printf("error\n");
        exit(0);
    }
}
void T()
{
    if(str[cur] == '('||str[cur] == 'i')
    {
    printf("%d T-->FS\n",num++);
    F();
    S();
    }
    else
    {
        printf("error\n");
        exit(0);
    }
}
int main()
{
    scanf("%s",str);
    E();
    if(str[cur] == '#')
        printf("accept\n");
    else
        printf("error\n");
    return 0;
}

///翻译布尔（逻辑）表达式
/*****************
此程序专门处理逻辑表达式，将其转换成四元式输出
*****************/
#include <bits/stdc++.h>
using namespace std;
vector<string>tt;
string s,x;
int main()
{
    getline(cin,s);
    s+=" end";
    int true1 = 1,false1 = 100,id = 100;
    stringstream ss(s);
    while(ss>>x)
     {
        if(x == "or"||x == "end")
        {
            if(x == "or")false1+=2;
            else false1 = 0;
            int len = tt.size();
            for(int  i = 0; i < len - 3; i=i+3)
            {
                printf("%d(j%s,%s,%s,%d)\n",id,tt[i+1].c_str(),tt[i].c_str(),tt[i+2].c_str(),id+2);
                id++;///每生成一条四元式id加1
                printf("%d(j,_,_,%d)\n",id,false1);
                false1 = id++;
            }
            printf("%d(j%s,%s,%s,%d)\n",id,tt[len-2].c_str(),tt[len-3].c_str(),tt[len-1].c_str(),true1);
           true1 = id++;
           printf("%d(j,_,_,%d)\n",id,false1);
           id++;
           tt.clear();
           if(x == "end")break;
        }
        else if(x == "and")false1+=2;
        else tt.push_back(x);
    }
return 0;
}

///简单代码生成
/*******************
此程序将三元式代码翻译为汇编语言代码。
*******************/
#include <bits/stdc++.h>
using namespace std;
char s[100][100];
char reg[101];
int n,m,mm = 0;
int is_register(char ch)
{
    for(int i = 0; i < m; i++)
    {
        if(ch == reg[i])
        {
            return i;
        }
    }
    return -1;
}
int last_use(int r,char ch)
{
    for(int  i = r; i < n; i++)
    {
        if(ch == s[i][3]||ch == s[i][5])
            return i;
    }
    return n;
}
int get_register(int r)
{
    if(mm < m)return mm++;
    int f = -1,ans = -1;
    for(int i = 0; i < m; i++)
    {

        int v = last_use(r,reg[i]);
        if(v > ans)
        {
            ans = v;
            f = i;
        }
    }
    return f;
}
void print1(char ch)
{
    if(ch == '+')printf("ADD ");
    else if(ch == '-')printf("SUB ");
    else if(ch == '*')printf("MUL ");
    else if(ch == '\\')printf("DIV ");
}
void print2(char ch)
{
    int r = is_register(ch);
    if(r != -1)
        printf("R%d\n",r);
    else printf("%c\n",ch);
}
int main()
{
    cin>>n>>m;
    for(int i = 0; i < n; i++)
    {
        cin>>s[i];
    }
    for(int i = 0; i < n; i++)
    {
        int r = is_register(s[i][3]);
        if(r == -1)
        {
             r = get_register(i);
             if(reg[r] != '\0'&&last_use(i,reg[r]) < n)
             {
                 printf("ST R%d, %c\n",r,reg[r]); ///把寄存器r里面的东东弄到内存里去
                 reg[r] = NULL;
             }
             printf("LD R%d, %c\n",r,s[i][3]);
        }
        print1(s[i][4]);
        printf("R%d, ",r);
        print2(s[i][5]);
        reg[r] = s[i][0];
    }
    return 0;
}

///DAG图优化
#include <bits/stdc++.h>
using namespace std;
const int max1 = 101;
int num,n;
char s[max1],ans[max1][max1];
bool flas[max1];
struct tree
{
    char value;///每个结点的值:具体值(区分root).
    int left = -1;
    int right = -1;
    vector<char>root;  ///char root[]存结点：变量
}node[max1];
bool is_have(int i,char c)
{
    int len = node[i].root.size();
    for(int k = 0; k < len; k++)
    {
        if(node[i].root[k] == c)
            return true;
    }
    return false;
}
int add_node(char c)
{
    for(int i = num-1; i >= 0; i--)
    {
        if(node[i].value == c||is_have(i,c))///合并已知量
        return i;
    }
    node[num].value = c;  ///*********注意*********
    return num++;
}
void add_operator(char c,char op,int l,int r)
{
    for(int i = num-1; i >= 0; i--)
    {
        if(op == node[i].value&&l==node[i].left&&r==node[i].right)
        {
            node[i].root.push_back(c);
            return ;
        }
    }
    node[num].value = op;
    node[num].left = l;
    node[num].right = r;
    node[num].root.push_back(c);
    num++;
}
void DFS(int i)
{
    if(node[i].left!=-1)
    {
       flas[i] = 1;
       DFS(node[i].left);
       DFS(node[i].right);
    }
}
int main()
{
num = 0;
cin>>n;
for(int i = 0; i < n; i++)
{
    cin>>s;
    int l = add_node(s[2]);
    int r = add_node(s[4]);
    add_operator(s[0],s[3],l,r);
}
for(int i = 0; i <num ; i++)
{
    if(node[i].left != -1)
    {
        ans[i][0] = node[i].root[0];
        ans[i][1] = '=';
        tree ll = node[node[i].left];
        tree  rr = node[node[i].right];
        ans[i][2] = ll.root.size()>0?ll.root[0]:ll.value;
        ans[i][3] = node[i].value;
        ans[i][4] = rr.root.size()>0?rr.root[0]:rr.value;
        ans[i][5] = 0;
    }
}
for(int i = num-1; i >= 0; i--)
{
    if(ans[i][0] == 'A')
        {DFS(i);
    break;}
}
for(int i = num-1; i >= 0; i--)
{
    if(ans[i][0] == 'B')
        {DFS(i);
        break;}
}
for(int i = 0; i < num; i++)
{
    if(flas[i])
     puts(ans[i]);
}
    return 0;
}