zoukankan      html  css  js  c++  java
  • 自动转换机

    #include<stdio.h>
    #define MAX 20
    main()
    {
        int i=0,j=0,k,l,m,n,number;
        char ch;
        char a[MAX][MAX];
        printf("请输入正规式:");
        ch=getchar();
        while(ch!='
    ')
        {
            if(ch=='/')
            {
                a[i][j]='';
                j=0;
                i++;
                ch=getchar();
                continue;
            }
            a[i][j]=ch;
            j++;
            ch=getchar();
        }
        a[i][j]='';
    
        number=2;
        for(k=0;k<=i;k++)
        {
            l=0;
            m=1;
            while(a[k][l]!='')
            {
                if(a[k][l]=='.'||a[k][l]=='*')
                {
    
                   if(a[k][l]=='.'&&m==1)
                   {
                     m++;
                     printf("f(0,%c)=%d
    ",a[k][l-1],number);
                     if(a[k][l+2]=='')
                      printf("f(%d,%c)=1
    ",number,a[k][l+1]);
                     number=number+1;
                   }
    
                   else if(a[k][l]=='.'&&m!=1)
                   {
                       m++;
                       printf("f(%d,%c)=%d
    ",number-1,a[k][l-1],number);
                       if(a[k][l+2]=='')
                        printf("f(%d,%c)=1
    ",number,a[k][l+1]);
                        number=number+1;
                   }
    
                   else if(a[k][l]=='*'&&m==1)
                   {
                       m++;
                       printf("f(0,~)=%d
    ",number);
                       printf("f(%d,%c)=%d
    ",number,a[k][l-1],number);
                       if(a[k][l+1]=='')
                        printf("f(%d,~)=1
    ",number);
                       else
                        printf("f(%d,~)=%d
    ",number,number+1);
                       number=number+1;
                   }
    
                   else if(a[k][l]=='*'&&m!=1)
                   {
                        m++;
                       printf("f(%d,%c)=%d
    ",number,a[k][l-1],number);
                       if(a[k][l+1]=='')
                        printf("f(%d,~)=1
    ",number);
                       else
                        printf("f(%d,~)=%d
    ",number,number+1);
                       number=number+1;
                   }
                }
                l++;
            }
        }
    
    
    }
    

      

  • 相关阅读:
    linux消息队列相关操作
    linux下删除3分钟之前指定文件夹下的指定类型文件
    centos6.5安装gmime-2.6
    centos6.5安装filezilla
    posix 正则库程序
    nginx正向vs反向代理
    AbstractQueuedSynchronizer 原理分析
    JAVA NIO详解
    java NIO原理及实例
    Thread类详解
  • 原文地址:https://www.cnblogs.com/zzrf/p/6117316.html
Copyright © 2011-2022 走看看