zoukankan      html  css  js  c++  java
  • 第五次作业

    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    char prog[80],token[8];
    char ch;
    int syn,p,m=0,n,row,sum=0;
    char *rwtab[6]={"begin","if","then","while","do","end"};

    void scaner()
    {

    for(n=0;n<8;n++) token[n]=NULL;
    ch=prog[p++];
    while(ch==' ')
    {
    ch=prog[p];
    p++;
    }
    if((ch>='a'&&ch<='z')||(ch>='A'&&ch<='Z'))
    {
    m=0;
    while((ch>='0'&&ch<='9')||(ch>='a'&&ch<='z')||(ch>='A'&&ch<='Z'))
    {
    token[m++]=ch;
    ch=prog[p++];
    }
    token[m++]='';
    p--;
    syn=10;
    for(n=0;n<6;n++)
    if(strcmp(token,rwtab[n])==0)
    {
    syn=n+1;
    break;
    }
    }
    else if((ch>='0'&&ch<='9'))
    {
    {
    sum=0;
    while((ch>='0'&&ch<='9'))
    {
    sum=sum*10+ch-'0';
    ch=prog[p++];
    }
    }
    p--;
    syn=11;
    if(sum>32767)
    syn=-1;
    }
    else switch(ch)
    {
    case'<':m=0;token[m++]=ch;
    ch=prog[p++];
    if(ch=='>')
    {
    syn=21;
    token[m++]=ch;
    }
    else if(ch=='=')
    {
    syn=22;
    token[m++]=ch;
    }
    else
    {
    syn=23;
    p--;
    }
    break;
    case'>':m=0;token[m++]=ch;
    ch=prog[p++];
    if(ch=='=')
    {
    syn=24;
    token[m++]=ch;
    }
    else
    {
    syn=20;
    p--;
    }
    break;
    case':':m=0;token[m++]=ch;
    ch=prog[p++];
    if(ch=='=')
    {
    syn=18;
    token[m++]=ch;
    }
    else
    {
    syn=17;
    p--;
    }
    break;
    case'*':syn=13;token[0]=ch;break;
    case'/':syn=14;token[0]=ch;break;
    case'+':syn=15;token[0]=ch;break;
    case'-':syn=16;token[0]=ch;break;
    case'=':syn=25;token[0]=ch;break;
    case';':syn=26;token[0]=ch;break;
    case'(':syn=27;token[0]=ch;break;
    case')':syn=28;token[0]=ch;break;
    case'#':syn=0;token[0]=ch;break;
    case' ':syn=-2;break;
    default: syn=-1;break;
    }
    }

    int main()
    {
    p=0;
    row=1;
    printf("请输入:");
    do
    {
    cin.get(ch);
    prog[p++]=ch;
    }
    while(ch!='#');
    p=0;
    do
    {
    scaner();
    switch(syn)
    {
    case 11: printf("(%d,%s),syn,sum");
    default: printf("(%d,%s) ",syn,token);
    }
    }
    while (syn!=0);
    }

  • 相关阅读:
    [windows]清除访问共享的用户和密码信息
    Java架构搜集
    jsp、freemarker、velocity对比
    Spring MVC 了解WebApplicationContext中特殊的bean类型
    Web.xml配置详解之context-param
    <context:annotation-config/> 的理解
    使用@Controller注解为什么要配置<mvc:annotation-driven />
    web.xml配置之<context-param>详解
    @WebServlet
    正向代理与反向代理
  • 原文地址:https://www.cnblogs.com/lychee2333/p/11656453.html
Copyright © 2011-2022 走看看