小弟想做个C\C++编译器，请大虾们给点意见~
小弟想做个编译器，不知各位大虾有什么好的建议？谢谢~
[解决办法]
ANSI C grammar, Lex specification
In 1985, Jeff Lee published this Lex specification together with a Yacc grammar for the April 30, 1985 ANSI C draft. Tom Stockfisch reposted both to net.sources in 1987; that original, as mentioned in the answer to question 17.25 of the comp.lang.c FAQ, can be ftp 'ed from ftp.uu.net, file usenet/net.sources/ansi.c.grammar.Z.
I intend to keep this version as close to the current C Standard grammar as possible; please let me know if you discover discrepancies.
Jutta Degener, 1995
--------------------------------------------
D[0-9]
L[a-zA-Z_]
H[a-fA-F0-9]
E[Ee][+-]?{D}+
FS(f|F|l|L)
IS(u|U|l|L)*
%{
#include <stdio.h>
#include "y.tab.h "
void count();
%}
%%
"/* "{ comment(); }
"auto "{ count(); return(AUTO); }
"break "{ count(); return(BREAK); }
"case "{ count(); return(CASE); }
"char "{ count(); return(CHAR); }
"const "{ count(); return(CONST); }
"continue "{ count(); return(CONTINUE); }
"default "{ count(); return(DEFAULT); }
"do "{ count(); return(DO); }
"double "{ count(); return(DOUBLE); }
"else "{ count(); return(ELSE); }
"enum "{ count(); return(ENUM); }
"extern "{ count(); return(EXTERN); }
"float "{ count(); return(FLOAT); }
"for "{ count(); return(FOR); }
"goto "{ count(); return(GOTO); }
"if "{ count(); return(IF); }
"int "{ count(); return(INT); }
"long "{ count(); return(LONG); }
"register "{ count(); return(REGISTER); }
"return "{ count(); return(RETURN); }
"short "{ count(); return(SHORT); }
"signed "{ count(); return(SIGNED); }
"sizeof "{ count(); return(SIZEOF); }
"static "{ count(); return(STATIC); }
"struct "{ count(); return(STRUCT); }
"switch "{ count(); return(SWITCH); }
"typedef "{ count(); return(TYPEDEF); }
"union "{ count(); return(UNION); }
"unsigned "{ count(); return(UNSIGNED); }
"void "{ count(); return(VOID); }
"volatile "{ count(); return(VOLATILE); }
"while "{ count(); return(WHILE); }
{L}({L}|{D})*{ count(); return(check_type()); }
0[xX]{H}+{IS}?{ count(); return(CONSTANT); }
0{D}+{IS}?{ count(); return(CONSTANT); }
{D}+{IS}?{ count(); return(CONSTANT); }
'(\\.|[^\\ '])+ '{ count(); return(CONSTANT); }
{D}+{E}{FS}?{ count(); return(CONSTANT); }
{D}* ". "{D}+({E})?{FS}?{ count(); return(CONSTANT); }
{D}+ ". "{D}*({E})?{FS}?{ count(); return(CONSTANT); }
\ "(\\.|[^\\ "])*\ "{ count(); return(STRING_LITERAL); }
"... "{ count(); return(ELLIPSIS); }
"> > = "{ count(); return(RIGHT_ASSIGN); }
" < <= "{ count(); return(LEFT_ASSIGN); }
"+= "{ count(); return(ADD_ASSIGN); }
"-= "{ count(); return(SUB_ASSIGN); }
"*= "{ count(); return(MUL_ASSIGN); }
"/= "{ count(); return(DIV_ASSIGN); }
"%= "{ count(); return(MOD_ASSIGN); }
"&= "{ count(); return(AND_ASSIGN); }
"^= "{ count(); return(XOR_ASSIGN); }
"|= "{ count(); return(OR_ASSIGN); }
"> > "{ count(); return(RIGHT_OP); }
" < < "{ count(); return(LEFT_OP); }
"++ "{ count(); return(INC_OP); }
"-- "{ count(); return(DEC_OP); }
"-> "{ count(); return(PTR_OP); }
"&& "{ count(); return(AND_OP); }
"|| "{ count(); return(OR_OP); }
" <= "{ count(); return(LE_OP); }
"> = "{ count(); return(GE_OP); }
"== "{ count(); return(EQ_OP); }
"!= "{ count(); return(NE_OP); }
"; "{ count(); return( '; '); }
"{ "{ count(); return( '{ '); }
"} "{ count(); return( '} '); }
", "{ count(); return( ', '); }
": "{ count(); return( ': '); }
"= "{ count(); return( '= '); }
"( "{ count(); return( '( '); }
") "{ count(); return( ') '); }
"[ "{ count(); return( '[ '); }
"] "{ count(); return( '] '); }
". "{ count(); return( '. '); }
"& "{ count(); return( '& '); }
"! "{ count(); return( '! '); }
"~ "{ count(); return( '~ '); }
"- "{ count(); return( '- '); }
"+ "{ count(); return( '+ '); }
"* "{ count(); return( '* '); }
"/ "{ count(); return( '/ '); }
"% "{ count(); return( '% '); }
" < "{ count(); return( ' < '); }
"> "{ count(); return( '> '); }
"^ "{ count(); return( '^ '); }
"| "{ count(); return( '| '); }
"? "{ count(); return( '? '); }
[ \t\v\n\f]{ count(); }
.{ /* ignore bad characters */ }
%%
yywrap()
{
return(1);
}
comment()
{
char c, c1;
loop:
while ((c = input()) != '* ' && c != 0)
putchar(c);
if ((c1 = input()) != '/ ' && c != 0)
{
unput(c1);
goto loop;
}
if (c != 0)
putchar(c1);
}
int column = 0;
void count()
{
int i;
for (i = 0; yytext[i] != '\0 '; i++)
if (yytext[i] == '\n ')
column = 0;
else if (yytext[i] == '\t ')
column += 8 - (column % 8);
else
column++;
ECHO;
}
int check_type()
{
/*
* pseudo code --- this is what it should check
*
*if (yytext == type_name)
*return(TYPE_NAME);
*
*return(IDENTIFIER);
*/
/*
*it actually will only return IDENTIFIER
*/
return(IDENTIFIER);
}
[解决办法]
看编译器原理和实践那本书
书后面还有一些简单的编译器源码，相当不错
先练习那些简单的编译器，或者自己定义的那种编译器
做出来之后再去实现C或者C＋＋的
当你做出来自己的简单编译器，就知道实践C＋＋的编译器是相当不容易了
[解决办法]
不知道楼主的基础咋样，有没有把龙书看完。
其实我也早就有这方面的想法了，只是不局限于C++。
我最初的想法是：只要给我语法范式，就能解析这族语法上的所有程序，
不过这里只做到编译的前端，能生成中间码，程序要易用，易扩展，开源，跨平台。
虽然这个和Lex Yacc有点像，但是总感觉这两个工具不太容易用，而且只在Linux平台。
但是现实中，根本没有这么多时间来干这件事，除非你已经真正温饱了。
如果非要做的话，那就爬到巨人肩上：ANTLR,spark,Lex等
其实写编译器不算难，难的是写出完美实用的语法范式。