c语言编译器新建,一个简单的C语言编译器

最新推荐文章于 2024-04-26 18:31:16 发布
最新推荐文章于 2024-04-26 18:31:16 发布
阅读量262 收藏 1
点赞数
文章标签： c语言编译器新建

源代码:

//

//

#if _MSC_VER > 1000

#pragma once

#endif // _MSC_VER > 1000

#define WIN32_LEAN_AND_MEAN  // Exclude rarely-used stuff from Windows headers

#include

#include

#include

#include

#include

#include

using namespace std;

class Symbol

{

public:

int line;

string word;

char group;

Symbol();

Symbol(const Symbol &b);

virtual ~Symbol();

operator =(const Symbol &b);

string code;

};

class Label

{

public:

Label();

virtual ~Label();

string text;

private:

int n;

static int next();

static int _label;

};

class Action

{

public:

static int lookUp(char v,int s);

private:

Action();

~Action();

static int Table[54][19];

static string vs;

};

class Goto

{

public:

static int lookUp(char v,int s);

private:

Goto();

~Goto();

static int Table[54][9];

static string vs;

};

class Compiler

{

public:

optimize();

string code;

char nextChar();

preProcess();//预处理器

parser();//语法分析器

Symbol *lexer();//词法分析器

void emitter();//生成器

Compiler(string CmdLine);

virtual ~Compiler();

err(int no,int line);

int hasError;//错误发生状态

private:

int lookup(string m);

char currentChar;

string fileName;

int line;//行数状态

Compiler();

int hasFile;//源文件打开状态

int needOutSuppose;//输出支持状态

ifstream in;//输入CRR文件

ofstream log;//输出日志文件

ofstream out;//输出ASM文件

list symbolList;//符号表

};

Compiler::Compiler(string CmdLine)

{

line=1;

hasError=0;

needOutSuppose=0;

hasFile=0;

fileName=CmdLine;

log.open((fileName + "_Log.txt").c_str(),ios::out);

//char c; //测试nextChar()

//do{c=nextChar();log<

}

Compiler::Compiler()

{

}

Compiler::~Compiler()

{

log.close();

}

Symbol *Compiler::lexer()

{

char c;

int s=1;

Symbol *r;

r=new Symbol();

c=currentChar;

while(s){

switch(s){

case 1:

if(c=='/x0A')line++;

else if(isspace(c))

s=1;

else if(isalpha(c)||c=='_'){

s=2;

r->word=c;

}

else if(isdigit(c)){

s=3;

r->word=c;

}

else{

switch(c){

case '+':

case '-':

s=0;

r->word=c;

r->group='+';

r->line=line;

break;

case '*':

case '%':

s=0;

r->word=c;

r->group='*';

r->line=line;

break;

case '&':

case '|':

r->word=c;

s=4;

break;

case '>':

case '

r->word=c;

s=5;

break;

case '!':

r->word=c;

s=6;

break;

case '=':

r->word=c;

s=7;

break;

case ',':

case ';':

case '{':

case '}':

case '(':

case ')':

case '$':

s=0;

r->word=c;

r->group=c;

r->line=line;

break;

case '/':

r->word=c;

s=8;

break;

case '#':

s=11;

break;

default:

s=1;

err(1,line);

}

}

c=nextChar();

break;

case 2:

if(isalnum(c)||c=='_'){

s=2;

r->word+=c;

c=nextChar();

}

else{

s=0;

r->line=line;

if(r->word=="int")

r->group='z';

else if(r->word=="if")

r->group='i';

else if(r->word=="else")

r->group='e';

else if(r->word=="do")

r->group='d';

else if(r->word=="while")

r->group='w';

else if(r->word=="return")

r->group='r';

else

r->group='@';

}

break;

case 3:

if(isdigit(c)){

s=3;

r->word+=c;

c=nextChar();

}

else if(isalpha(c)||c=='_'){

s=2;

r->word+=c;

err(2,line);

c=nextChar();

}

else{

s=0;

r->line=line;

r->group='n';

}

break;

case 4:

if((r->word.c_str())[0]==c){

s=0;

r->word+=c;

r->group='&';

r->line=line;

c=nextChar();

}

else {

s=1;

err(3,line);

}

break;

case 5:

if(c=='='){

r->word+=c;

c=nextChar();

}

s=0;

r->line=line;

r->group='>';

break;

case 6:

if(c=='='){

r->word+=c;

r->group='>';

c=nextChar();

}

else{

r->group='!';

}

s=0;

r->line=line;

break;

case 7:

if(c=='='){

r->word+=c;

r->group='>';

c=nextChar();

}

else{

r->group='=';

}

s=0;

r->line=line;

break;

case 8:

if(c=='*'){

s=9;

r->word="";

c=nextChar();

}

else{

r->line=line;

r->group='*';

s=0;

}

break;

case 9:

if(c=='*')

s=10;

else

s=9;

c=nextChar();

break;

case 10:

if(c=='/')

s=1;

else if(c=='*')

s=10;

else

s=9;

c=nextChar();

break;

case 11:

if(c=='/n'){

s=1;

line++;

}

else

s=11;

c=nextChar();

break;

default:

s=1;

err(0,line);

c=nextChar();

}

}

currentChar=c;

log<word<

return r;

}

Compiler::parser()

{

log<

log<

log<

if(hasFile)

in.open((fileName+".crr").c_str(),ios::in);

currentChar=nextChar();//词法分析器初始化

// Symbol *s=NULL; //测试lexer()

// do{

//  if(s!=NULL)

//   delete s;

//  s=lexer();

//  log<word;

//  log<

//  log<group;

//  log<

//  log<line;

//  log<

// }while(s->group!='#');

// delete s;

int r,s=1,t=1;

Symbol *ip,*iq,*it=NULL;

Symbol *s1,*s2,*s3,*s4,*s5,*s6,*s7,*m;

Label *l1,*l2;

stack ss;

stack sos;

ss.push(s);

ip=lexer();

while(t){

s=ss.top();

t=Action::lookUp(ip->group,s);

if(t>0){

sos.push(ip);

ss.push(t);

if(it==NULL)

ip=lexer();

else

ip=it;

it=NULL;

}

else if(t<0)

{

switch(-t)

{

case 1://OK

//D->@()S

log<@()S"<

ss.pop();

ss.pop();

ss.pop();

ss.pop();

s4=sos.top();

sos.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='D';

m->line=s1->line;

sos.push(m);

//动作

if(s1->word!="main")

err(5,s1->line);

code=s4->code;

delete s1;

delete s2;

delete s3;

delete s4;

break;

case 2://OK

//S->@=E;

log<@=E;"<

ss.pop();

ss.pop();

ss.pop();

ss.pop();

s4=sos.top();

sos.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

if(lookup(s1->word))

m->code=s3->code+"/tpop ax/n/tmov "+s1->word+",ax/n";

else

err(10,s1->line);

delete s1;

delete s2;

delete s3;

delete s4;

break;

case 3://OK

//S->{W}

log<{W}"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

m->code=s2->code;

delete s1;

delete s2;

delete s3;

break;

case 4://OK

//S->i(G)S

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.pop();

s5=sos.top();

sos.pop();

s4=sos.top();

sos.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

if(s1->word=="if"){

l1=new Label;

m->code=s3->code+"/tpop ax/n/tcmp ax,1/n/tjne "+l1->text+"/n"+s5->code+l1->text+":/n";

delete l1;

log<i(G)S"<

}

if(s1->word=="while"){

l1=new Label;

l2=new Label;

m->code=l1->text+":/n"+s3->code+"/tpop ax/n/tcmp ax,1/n/tjne "+l2->text+"/n"+s5->code+"/tjmp "+l1->text+"/n"+l2->text+":/n";

delete l1;

delete l2;

log<w(G)S"<

}

delete s1;

delete s2;

delete s3;

delete s4;

delete s5;

break;

case 5://OK

//S->i(G)SeS

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.pop();

s7=sos.top();

sos.pop();

s6=sos.top();

sos.pop();

s5=sos.top();

sos.pop();

s4=sos.top();

sos.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

l1=new Label;

l2=new Label;

if(s1->word=="if"){

m->code=s3->code+"/tpop ax/n/tcmp ax,1/n/tjnz "+l1->text+"/n"+s5->code+"/tjmp "+l2->text+"/n"+l1->text+":/n"+s7->code+l2->text+":/n";

log<i(G)SeS"<

}

else

err(8,s6->line);

delete l1;

delete l2;

delete s1;

delete s2;

delete s3;

delete s4;

delete s5;

delete s6;

delete s7;

break;

case 6://ok

//S->w(G)S

log<w(G)S"<

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.pop();

s5=sos.top();

sos.pop();

s4=sos.top();

sos.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

delete s1;

delete s2;

delete s3;

delete s4;

delete s5;

break;

case 7://OK

//S->zL;

log<zL;"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

delete s1;

delete s2;

delete s3;

break;

case 8://OK

//S->@(E);

log<@(E);"<

ss.pop();

ss.pop();

ss.pop();

ss.pop();

ss.pop();

s5=sos.top();

sos.pop();

s4=sos.top();

sos.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='S';

m->line=s1->line;

sos.push(m);

//动作

if(s1->word=="out"&&needOutSuppose)

m->code=s3->code+"/tpop ax/n/tcall outint/n";

else

err(6,s1->line);

delete s1;

delete s2;

delete s3;

delete s4;

delete s5;

break;

case 9://OK

//W->WS

log<WS"<

ss.pop();

ss.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='W';

m->line=s1->line;

sos.push(m);

//动作

m->code=s1->code+s2->code;

delete s1;

delete s2;

break;

case 10://OK

//W->S

log<S"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='W';

m->line=s1->line;

sos.push(m);

//动作

m->code=s1->code;

delete s1;

break;

case 11://OK

//L->@

log<@"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='L';

m->line=s1->line;

sos.push(m);

//动作

if(!lookup(s1->word))

symbolList.insert(symbolList.end(),s1->word);

else

err(11,s1->line);

delete s1;

break;

case 12://OK

//L->L,@

log<L,@"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='L';

m->line=s1->line;

sos.push(m);

if(!lookup(s3->word))

symbolList.insert(symbolList.end(),s3->word);

else

err(11,s3->line);

delete s1;

delete s2;

delete s3;

break;

case 13://OK

//G->G&M

log<G&M"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='G';

m->line=s1->line;

sos.push(m);

//动作

if(s2->word=="&&")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tand ax,bx/n/tpush ax/n";

if(s2->word=="||")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tor ax,bx/n/tpush ax/n";

delete s1;

delete s2;

delete s3;

break;

case 14://OK

//G->M

log<M"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='G';

m->line=s1->line;

sos.push(m);

//动作

m->code=s1->code;

delete s1;

break;

case 15:

//M->E>E

log<E>E"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='M';

m->line=s1->line;

sos.push(m);

//动作

l1=new Label;

l2=new Label;

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tcmp ax,bx/n";

if(s2->word==">")

m->code+="/tjg "+l1->text+"/n";

if(s2->word=="

m->code+="/tjl "+l1->text+"/n";

if(s2->word=="==")

m->code+="/tje "+l1->text+"/n";

if(s2->word=="!=")

m->code+="/tjne "+l1->text+"/n";

if(s2->word==">=")

m->code+="/tjge "+l1->text+"/n";

if(s2->word=="<=")

m->code+="/tjle "+l1->text+"/n";

m->code+="/tmov ax,0/n/tjmp "+l2->text+"/n"+l1->text+":/tmov ax,1/n"+l2->text+":/tpush ax/n";

delete l1;

delete l2;

delete s1;

delete s2;

delete s3;

break;

case 16://OK

//M->!M

log<!M"<

ss.pop();

ss.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='M';

m->line=s1->line;

sos.push(m);

//动作

m->code="/tpop ax/n/txor ax,ax/n/tpush ax/n";

delete s1;

delete s2;

break;

case 17://OK

//M->(G)

log<(G)"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='M';

m->line=s1->line;

sos.push(m);

//动作

m->code=s2->code;

delete s1;

delete s2;

delete s3;

break;

case 18://OK

//E->E+T

log<E+T"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->line=s1->line;

m->group='E';

sos.push(m);

//动作

if(s2->word=="+")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tadd ax,bx/n/tpush ax/n";

if(s2->word=="-")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tsub ax,bx/n/tpush ax/n";

delete s1;

delete s2;

delete s3;

break;

case 19://OK

//E->T

log<T"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='E';

m->line=s1->line;

sos.push(m);

//动作

m->code=s1->code;

delete s1;

break;

case 20://OK

//T->T*F

log<T*F"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='T';

m->line=s1->line;

sos.push(m);

//动作

if(s2->word=="*")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tmov dx,0/n/tmul bx/n/tpush ax/n";

if(s2->word=="/")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tmov dx,0/n/tdiv bx/n/tpush ax/n";

if(s2->word=="%")

m->code=s3->code+s1->code+"/tpop ax/n/tpop bx/n/tmov dx,0/n/tdiv bx/n/tpush dx/n";

delete s1;

delete s2;

delete s3;

break;

case 21://OK

//T->F

log<F"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='T';

m->line=s1->line;

sos.push(m);

//动作

m->code=s1->code;

delete s1;

break;

case 22://OK

//F->(E)

log<(E)"<

ss.pop();

ss.pop();

ss.pop();

s3=sos.top();

sos.pop();

s2=sos.top();

sos.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='F';

m->line=s1->line;

sos.push(m);

//动作

m->code=s2->code;

delete s1;

delete s2;

delete s3;

break;

case 23://OK

//F->@

log<@"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='F';

m->line=s1->line;

sos.push(m);

//动作

if(lookup(s1->word))

m->code="/tmov ax,"+s1->word+"/n/tpush ax/n";

else

err(10,s1->line);

delete s1;

break;

case 24://OK

//F->n

log<n"<

ss.pop();

s1=sos.top();

sos.pop();

m=new Symbol;

m->group='F';

m->line=s1->line;

sos.push(m);

//动作

m->code="/tmov ax,"+s1->word+"/n/tpush ax/n";

delete s1;

break;

case 30:

//else

err(8,line);

ss.push(0);

ss.push(0);

ss.push(0);

ss.push(0);

ss.push(45);

s1=new Symbol;

s1->group='i';

s1->line=line;

sos.push(s1);

s1=new Symbol;

s1->group='(';

s1->line=line;

sos.push(s1);

s1=new Symbol;

s1->group='G';

s1->line=line;

sos.push(s1);

s1=new Symbol;

s1->group=')';

s1->line=line;

sos.push(s1);

s1=new Symbol;

s1->group='S';

s1->line=line;

sos.push(s1);

continue;

case 31:

err(7,line);

it=ip;

ip=new Symbol;

ip->group=';';

ip->line=line;

continue;

case 32:

err(9,line);

s1=new Symbol;

s1->line=line;

s1->group='S';

sos.push(s1);

break;

default:

err(4,ip->line);

goto label1;

}//switch

r=ss.top();

iq=sos.top();

r=Goto::lookUp(iq->group,r);

if(r)

ss.push(r);

else

err(4,iq->line);

}//else

else if(t==0&&!hasError){

log<

log<

}

}//while

label1:

in.close();

log<

log<

}

Compiler::preProcess()

{

string tmpstr;

ifstream ins((fileName+".crr").c_str(),ios::in);

log<

log<

if(ins.is_open()){

hasFile=1;

log<

}

else{

hasFile=0;

log<

}

while(getline(ins,tmpstr)){

if(tmpstr.substr(0,18)=="#import system.out"){

needOutSuppose=1;

break;

}

}

if(needOutSuppose)

log<

else

log<

log<

log<

ins.close();

}

char Compiler::nextChar()

{

char ch;

if(in.get(ch)){

currentChar=ch;

return ch;

}

else{

currentChar=ch;

return '$';

}

}

void Compiler::emitter()

{

if(hasError){

log<

log<

log<

log<

return;

}

log<

log<

log<

out.open((fileName + ".asm").c_str(),ios::out);

if(out.is_open()){

log<

out<

out<

out<

while(!symbolList.empty())

{

out<

symbolList.pop_front();

}

out<

out<

out<

if(needOutSuppose){

log<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

}

out<

out<

log<

optimize();

log<

out<

log<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out<

out.close();

log<

log<

log<

}

else

{

log<

log<

log<

}

// Label *q;//测试Label

// for(int i=0;i<10;i++){

//   q=new Label;

//   log<text.c_str()<

//  delete q;

// }

return;

}

Compiler::err(int no,int line)

{

string errText;

hasError=1;

switch(no){

case 1:

errText="出现无法识别的符号.";

break;

case 2:

errText="错误的标识符.";

break;

case 3:

errText="运算符/'&&/'(/'||/')写成/'&/'(/'|/')了.";

break;

case 4:

errText="语法错误,编译停止!";

break;

case 5:

errText="找不到main()函数.";

break;

case 6:

errText="所使用的函数未定义";

break;

case 7:

errText="语句后缺少/';/'.";

break;

case 8:

errText="else没有与之匹配的if.";

break;

case 9:

errText="缺少语句.";

break;

case 10:

errText="变量未定义.";

break;

case 11:

errText="变量以定义过,不能重新定义.";

break;

default:

errText="未知错误!";

}

log<

}

int Compiler::lookup(string m)

{

list::iterator i;

for (i =  symbolList.begin(); i != symbolList.end(); ++i)

if(*i==m)

return 1;

return 0;

}

Symbol::Symbol()

{

}

Symbol::Symbol(const Symbol &b)

{

group=b.group;

line=b.line;

word=b.word;

}

Symbol::~Symbol()

{

}

Symbol::operator =(const Symbol &b)

{

group=b.group;

line=b.line;

word=b.word;

}

Label::Label()

{

n=next();

char buffer[6];

text=_itoa(n,buffer,10);

text="L"+text;

}

Label::~Label()

{

}

int Label::next()

{

return ++_label;

}

int Label::_label=0;

Action::Action()

{

}

Action::~Action()

{

}

int Action::lookUp(char v,int s)

{

int n=vs.find_first_of(v,0);

return Table[s-1][n];

}

string Action::vs ="+*>&=!@n(){};,ziew$";

int Action::Table[54][19]={

-40,-40,-40,-40,-40,-40,3,-40,-40,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state1

-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-30,-40,0,//state2

-40,-40,-40,-40,-40,-40,-40,-40,4,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state3

-40,-40,-40,-40,-40,-40,-40,-40,-40,5,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state4

-40,-40,-40,-40,-40,-40,7,-40,-40,-40,8,-40,-40,-40,11,9,-30,10,-40,//state5

-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-30,-40,-1,//state6

-40,-40,-40,-40,12,-40,-40,-40,13,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state7

-40,-40,-40,-40,-40,-40,7,-40,-40,-40,8,-32,-32,-40,11,9,-30,10,-32,//state8

-40,-40,-40,-40,-40,-40,-40,-40,13,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state9

-40,-40,-40,-40,-40,-40,-40,-40,13,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state10

-40,-40,-40,-40,-40,-40,17,-40,-40,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state11

-40,-40,-40,-40,-40,-40,22,23,21,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state12

-40,-40,-40,-40,-40,27,22,23,28,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state13

-40,-40,-40,-40,-40,-40,7,-40,-40,-40,8,29,-40,-40,11,9,-30,10,-40,//state14

-40,-40,-40,-40,-40,-40,-10,-40,-40,-40,-10,-10,-40,-40,-10,-10,-30,-10,-40,//state15

-40,-40,-40,-40,-40,-40,-31,-40,-40,-40,-31,-31,31,32,-31,-31,-30,-31,-31,//state16

-40,-40,-40,-40,-40,-40,-31,-40,-40,-40,-31,-31,-11,-11,-31,-31,-30,-31,-31,//state17

35,-40,-40,-40,-40,-40,-31,-40,-40,34,-31,-31,33,-40,-31,-31,-30,-31,-31,//state18

-19,36,-19,-19,-40,-40,-31,-40,-40,-19,-31,-31,-19,-40,-31,-31,-30,-31,-31,//state19

-21,-21,-21,-21,-40,-40,-31,-40,-40,-21,-31,-31,-21,-40,-31,-31,-30,-31,-31,//state20

-40,-40,-40,-40,-40,-40,22,23,21,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state21

-23,-23,-23,-23,-40,-40,-31,-40,-40,-23,-31,-31,-23,-40,-31,-31,-30,-31,-31,//state22

-24,-24,-24,-24,-40,-40,-31,-40,-40,-24,-31,-31,-24,-40,-31,-31,-30,-31,-31,//state23

-40,-40,-40,38,-40,-40,-40,-40,-40,34,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state24

35,-40,39,-40,-40,-40,-31,-40,-40,34,-31,-31,33,-40,-31,-31,-30,-31,-31,//state25

-40,-40,-40,-14,-40,-40,-40,-40,-40,-14,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state26

-40,-40,-40,-40,-40,27,22,23,28,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state27

-40,-40,-40,-40,-40,27,22,23,28,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state28

-40,-40,-40,-40,-40,-40,-3,-40,-40,-40,-3,-3,-40,-40,-3,-3,-3,-3,-3,//state29

-40,-40,-40,-40,-40,-40,-9,-40,-40,-40,-9,-9,-40,-40,-9,-9,-9,-9,-40,//state30

-40,-40,-40,-40,-40,-40,-7,-40,-40,-40,-7,-7,-40,-40,-7,-7,-7,-7,-7,//state31

-40,-40,-40,-40,-40,-40,44,-40,-40,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state32

-40,-40,-40,-40,-40,-40,-2,-40,-40,-40,-2,-2,-40,-40,-2,-2,-2,-2,-2,//state33

-40,-40,-40,-40,-40,-40,7,-40,-40,-40,8,-32,46,-40,11,9,-30,10,-32,//state34

-40,-40,-40,-40,-40,-40,22,23,21,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state35

-40,-40,-40,-40,-40,-40,22,23,21,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state36

35,-40,-40,-40,-40,-40,-40,-40,-40,49,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state37

-40,-40,-40,-40,-40,27,22,23,28,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state38

-40,-40,-40,-40,-40,-40,22,23,21,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state39

-40,-40,-40,-16,-40,-40,-40,-40,-40,-16,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state40

35,-40,39,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state41

-40,-40,-40,38,-40,-40,-40,-40,-40,52,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state42

35,-40,39,-40,-40,-40,-31,-40,-40,49,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state43

-40,-40,-40,-40,-40,-40,-31,-40,-40,-40,-31,-31,-12,-12,-31,-31,-30,-31,-31,//state44

-40,-40,-40,-40,-40,-40,-4,-40,-40,-40,-4,-4,-40,-40,-4,-4,53,-4,-4,//state45

-40,-40,-40,-40,-40,-40,-8,-40,-40,-40,-8,-8,-40,-40,-8,-8,-30,-8,-8,//state46

-18,36,-18,-18,-40,-40,-31,-40,-40,-18,-31,-31,-18,-40,-31,-31,-30,-31,-31,//state47

-20,-20,-20,-20,-40,-40,-31,-40,-40,-20,-31,-31,-20,-40,-31,-31,-30,-31,-31,//state48

-22,-22,-22,-22,-40,-40,-31,-40,-40,-22,-31,-31,-22,-40,-31,-31,-30,-31,-31,//state49

-40,-40,-40,-13,-40,-40,-40,-40,-40,-13,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state50

35,-40,-40,-15,-40,-40,-40,-40,-40,-15,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state51

-40,-40,-40,-17,-40,-40,-40,-40,-40,-17,-40,-40,-40,-40,-40,-40,-30,-40,-40,//state52

-40,-40,-40,-40,-40,-40,7,-40,-40,-40,8,-32,-32,-40,11,9,-30,10,-32,//state53

-40,-40,-40,-40,-40,-40,-5,-40,-40,-40,-5,-5,-40,-40,-5,-5,-30,-5,-5};//state54

Goto::Goto()

{

}

Goto::~Goto()

{

}

int Goto::lookUp(char v,int s)

{

int n=vs.find_first_of(v,0);

return Table[s-1][n];

}

string Goto::vs="DSWLGMETF";

int Goto::Table[54][9]={

2,0,0,0,0,0,0,0,0,//state1

0,0,0,0,0,0,0,0,0,//state2

0,0,0,0,0,0,0,0,0,//state3

0,0,0,0,0,0,0,0,0,//state4

0,6,0,0,0,0,0,0,0,//state5

0,0,0,0,0,0,0,0,0,//state6

0,0,0,0,0,0,0,0,0,//state7

0,15,14,0,0,0,0,0,0,//state8

0,0,0,0,0,0,0,0,0,//state9

0,0,0,0,0,0,0,0,0,//state10

0,0,0,16,0,0,0,0,0,//state11

0,0,0,0,0,0,18,19,20,//state12

0,0,0,0,24,26,25,19,20,//state13

0,30,0,0,0,0,0,0,0,//state14

0,0,0,0,0,0,0,0,0,//state15

0,0,0,0,0,0,0,0,0,//state16

0,0,0,0,0,0,0,0,0,//state17

0,0,0,0,0,0,0,0,0,//state18

0,0,0,0,0,0,0,0,0,//state19

0,0,0,0,0,0,0,0,0,//state20

0,0,0,0,0,0,37,19,20,//state21

0,0,0,0,0,0,0,0,0,//state22

0,0,0,0,0,0,0,0,0,//state23

0,0,0,0,0,0,0,0,0,//state24

0,0,0,0,0,0,0,0,0,//state25

0,0,0,0,0,0,0,0,0,//state26

0,0,0,0,0,40,41,19,20,//state27

0,0,0,0,42,26,43,19,20,//state28

0,0,0,0,0,0,0,0,0,//state29

0,0,0,0,0,0,0,0,0,//state30

0,0,0,0,0,0,0,0,0,//state31

0,0,0,0,0,0,0,0,0,//state32

0,0,0,0,0,0,0,0,0,//state33

0,45,0,0,0,0,0,0,0,//state34

0,0,0,0,0,0,0,47,20,//state35

0,0,0,0,0,0,0,0,48,//state36

0,0,0,0,0,0,0,0,0,//state37

0,0,0,0,0,50,41,19,20,//state38

0,0,0,0,0,0,51,19,20,//state39

0,0,0,0,0,0,0,0,0,//state40

0,0,0,0,0,0,0,0,0,//state41

0,0,0,0,0,0,0,0,0,//state42

0,0,0,0,0,0,0,0,0,//state43

0,0,0,0,0,0,0,0,0,//state44

0,0,0,0,0,0,0,0,0,//state45

0,0,0,0,0,0,0,0,0,//state46

0,0,0,0,0,0,0,0,0,//state47

0,0,0,0,0,0,0,0,0,//state48

0,0,0,0,0,0,0,0,0,//state49

0,0,0,0,0,0,0,0,0,//state50

0,0,0,0,0,0,0,0,0,//state51

0,0,0,0,0,0,0,0,0,//state52

0,54,0,0,0,0,0,0,0,//state53

0,0,0,0,0,0,0,0,0//state54

};

Compiler::optimize()

{

int i,j,f;

string t="/tpush ax/n/tpop ax/n";

do{

f=0;

j=code.length()-17;

for(i=0;i

if(code.substr(i,17)==t){

f=1;

code.replace(i,17,"");

break;

}

}

}while(f);

}

int APIENTRY WinMain(HINSTANCE hInstance,

HINSTANCE hPrevInstance,

LPSTR     lpCmdLine,

int       nCmdShow)

{

string file(lpCmdLine);

file=file.substr(0,file.find_last_of('.'));

if(!file.empty()){

Compiler cc(file);

cc.preProcess();

cc.parser();

cc.emitter();

ofstream bat;

bat.open((file+".bat").c_str(),ios::out);

bat<

bat<

bat.close();

}

return 0;

}

文法:

1: D->@()S.  程序->主函数

2: S->@=E;. 赋值语句

3: S->{W}.  组合语句

4: S->i(G)S. if语句

5: S->i(G)SeS. if-else语句

6: S->w(G)S. while语句

7: S->zL;.  变量定义

8: S->@(E);. 函数调用

9: W->WS.  多条语句列表

10: W->S.  语句列表

11: L->@.  变量名列表

12: L->L,@.  多个变量名列表

13: G->G&M.  逻辑表达式

14: G->M.

15: M->E>E.  关系表达式

16: M->!M.  逻辑非表达式

17: M->(G).  带括号的逻辑表达式

18: E->E+T.  加法表达式

19: E->T.

20: T->T*F.  乘法表达式

21: T->F.

22: F->(E).  带括号的算术表达式

23: F->@.  变量表达式

24: F->n.   数字表达式

示例代码

#import system.out

main()

{

int i;

int s1,s2,s3;

i=100;

while(i<1000){

s1=i/100;

s2=i/10%10;

s3=i%10;

if(s1s3)

out(i);

i=i+1;

}

}

atone2003
关注
编译原理课程设计--C语言编译器
Cathy___Sun的博客
01-22 6780
编译原理课程设计--C语言编译器 代码可输出 action-goto表 源程序 四元式 优化后的四元式 语法分析结果 词法分析结果 块的信息等
c语言编译器tcc 源码,TCC研究(1): Tiny C Compiler最小的C语言编译器，自己编译自己...
weixin_39583655的博客
05-18 2109
Tiny C Compiler(简称TCC, 或Tiny CC)是世界上最小的C语言编译器.第一课： 安装，试用， 用TCC编译自己最近，在学习编译器技术， 研究了一下TCC， 记录一下。Tiny C Compiler(简称TCC, 或Tiny CC)是世界上最小的C语言编译器，而且是开源的， 小到只有约100K. (VC, GCC动不动几十M几百M的, 汗)别看它小, 功能还是很强. 可以编译所...
一个简单的C语言编译器
08-27
一个简单的C语言编译器，适合于学习制作编译器的人。
简单的c编译器(c语言实现),简单的C编译器(c语言实现)
weixin_42512798的博客
05-18 882
一个用C语言实现的小型C编译器,完整代码!实现功能有：case语句;for语句;continue,exit,break语句;do…while语句;repeat…until语句等#include#include#include#include#include#include using namespace std;#define NORW 16/*关键字个数为16*/#define TXMAX 10...
简单的C编译器实现
01-13
一个简单的c编译器实现，编译原理课的大作业，写的一般，还可以优化，但基本功能都已实现。仅供参考。
简单c语言子集的一个编译器实现（编译原理课程项目）
02-28
编译原理期末课程设计， 一个基于AT&T x86汇编的小型编译器。
自己动手写C语言编译器（4）
daojin505的专栏
07-30 308
Statement由Expression构成，Expression由Token构成，Token由char构成。 从上到下呈现树形结构。 程序是由statement组成的，其实我们要的就是一种判断Staement开始和结束的方式： 如果能判断开始和结束，以及Expression开始和结束。也许应该这样设计语言 ,   BEGIN:IFSTATEMENT BEGIN:EXPRESSION ...
VS2013做C语言编译器的使用说明
07-07
在本文中，我们将深入探讨如何使用Visual Studio 2013（VS2013）作为C语言编译器，以便高效地学习和编写C语言程序。VS2013是一个功能强大的集成开发环境（IDE），它支持多种编程语言，包括C和C++。 首先，了解C语言...
非常好用的c语言编译器
11-08
标题中的“非常好用的c语言编译器”指的是一个高效的C语言编程环境，它为开发者提供了方便的编译和调试功能。在这个特定的场景中，它被描述为适用于Windows 7操作系统，并且体积小巧，这使得它成为在便携设备如平板...
GCC编译器简明教程（Linux下C语言开发环境的搭建）_如何在linux中创建c语言编译器
最新发布
2401_83621095的博客
04-26 371
输入完成后的效果如下图所示：Ctrl+S保存文件，就完成了源代码的编辑工作。此时需要关闭Gedit的窗口，$ gedit main.c命令才算执行结束，才能在控制台继续输入其它命令。
compiler:一个小型的c语言编译器
05-13
compiler 一个小型的c语言编译器 目前实现的功能 可以定义多个变量，并且能初始化。 可以支持基本的加减乘除运算。 可以支持带括号的多个变量的四则混合运算。 可以支持单行注释和多行注释。 可以输出%c格式的字符和%d格式的整数。 可以定义int 类型和 char类型。 可以输出字符串 可以输出2位整数 可以支持简单的if{}else{}语句。（大于和小于比较条件） 以上支持的语法可以混合在同一个源程序中。 部分错误语法可以报错。 环境 编辑器：记事本、VC++6.0 汇编环境：dosbox、emu8086 汇编器、链接器：MASM、LINK 汇编语言：8086汇编 源代码：C++，用VC++6.0 / gcc编译 编译方法 目录中的a.out文件是在Linux下编译完成的可执行文件，可以直接运行。 该程序源代码中并未使用 C++11 标准，所以无论是在windows下还是在Linux
succ：succ是（将要成为）一个用C编写的小型C编译器，用于学习
02-09
succ是（将成为）一个用C语言编写的小型C编译器，用于学习。 根据
自制c语言编译器
05-27
编译原理课程设计学完之后，自己做了一个编译器，里面有文档 ，可以翻译成汇编语言
让你用C语言实现简单的编译器，从头开始写
qq_42167135的博客
05-08 2万+
在当下的时代，'脚本语言/编程语言'数不胜数，很多人都认为自己学习编译原理是闭门造车，不应该去浪费时间学这个，却不知学习编译原理可以更好的理解编译器的运行过程。 就比如f1比赛，其实现在所有的车队可选的轮胎都是一样的，但不同车队根据自己车的情况和战术等做出的选择就会截然不同。如果你对轮胎的理解只是它可以转，那么你根本无法把它的能力发挥到极限。 下面这段我是在知乎找到的： ...
用C语言实现一个C语言的编译器
热门推荐
acsuperman的博客
07-17 3万+
用C语言实现一个C语言的编译器 目标：基于C0+文法的编译器，生成语法树，四元式，符号表，最后生成X86汇编（386） 接下来介绍一下整个的设计和实现思路（C0+ 文法是指 以C0为基础，另外增加了一些C0没有的文法 ）和在实现过程中遇到的问题，以及怎样解决。 本工程实现了以C0+文法为输入语言的采用C语言设计的编译器，采用递归子程序的方法来设计分析，可以生成intel386汇编（16位）...
简单C-语言编译器
dsaaf21的博客
01-27 2056
目录实验环境参考书籍和工具文件结构简单cminus词法语法规则编译流程图关键数据结构词法分析数据结构语法分析数据结构语义分析数据结构中间代码生成数据结构代码生成主函数 实验环境 整个代码我是在64位windows下的vscode中编写完成的，使用的是GBK编码格式，能够编译运行。但是编译器基于X86架构，使用的是IA-32指令集，所以生成的汇编代码只能在32位的操作系统下进行汇编和链接成可执行代码...
实现一个编译器 c语言实现,手把手教你实现一个简单的编译器
weixin_39907850的博客
05-18 2778
手把手教你实现一个简单的编译器1、 概述今天我们将学习开发一个编译器，但是呢，这个编译器并不是说什么都能都编译，它只是一个超级小的编译器，主要用于说明编译器的一些基本的原理。我们这个编译器可以将类似于lisp语言的函数调用编译成类似于C语言的函数调用。如果你对lisp语言和C语言这两者都不熟悉，没关系，什么语言其实无所谓，但接下来还是会给你一个快速的介绍。如果我们有两个函数分别是add和subtr...
简单的c编译器(c语言实现),实现简易的C语言编译器（part 3）
weixin_34991792的博客
05-18 764
在前几部分中，我们重点分析了前处理和词法分析过程，已经将源代码拆解成一个个的token了。接下来，我们将分析这些token的逻辑结构是否严格按照C语言定义的语法规则来排布，这就是将要介绍的内容：语法分析。还是从代码入手分析，这样更加生动形象。给定下面这段C代码：int a;int main(){int b;b = 1;return (a + 2) - b;}数学家对物理学家说：“只要你能将物理问...
重庆理工大学编译原理课程设计 简易类c语言的编译器
qq_45860422的博客
06-14 3836
c语言、编译原理课程设计
CodeVisionAVR C语言编译器简易教程
本篇文档是关于"CVAVR简易使用说明"的详细指南，主要针对Atmel AVR系列单片机的C语言编程，利用CodeVisionAVRCCompiler这款编译器在Windows操作系统（如95、98、NT4.0、2000）中的应用。以下是文档中介绍的主要知识...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值