12 2015 档案

递归下降分析法
摘要：#includechar curr;char YF[300];int N=-1;void T();void E();void F();void e();void t();void error();void scaner();void main(){ char ch; int i=0; ... 阅读全文
posted @ 2015-12-30 16:35 50黄柏堂 阅读(418) 评论(0) 推荐(1)
有（很）穷的自动机
摘要：#include //s为初态，z为终态int in(int s,int z){ if(s == z) { printf("3\nlook!the last status belongs to Z"); return 1; } else { ... 阅读全文
posted @ 2015-12-03 19:52 50黄柏堂 阅读(150) 评论(0) 推荐(0)