代码拉取完成,页面将自动刷新
#ifndef TREE_H
#define TREE_H
typedef struct Tree{
char* content;
char* name;
int line;
int num;
int headline;
int nextline;
char* inner;
char* code;
struct Tree** leaves;
struct Tree* next;
struct Declator* declator;
}Tree;
Tree* initTree(int num);
Tree* createTree(char* name, int number, ...);
Tree* terminator(char* name, int yylineno);
Tree* binaryOpr(char* name, Tree* t1, Tree* t2, Tree* t3);
Tree* assignOpr(char* name, Tree* t1, Tree* t2, Tree* t3);
Tree* condictOpr(char* name, Tree* t1, Tree* t2, Tree* t3);
Tree* unaryOpr(char* name, Tree* t1, Tree* t2);
Tree* ifOpr(char* name,int headline,int nextline,Tree* op,Tree* stmt);
Tree* ifelseOpr(char* name, int headline, int next1, int next2, Tree* op, Tree* stmt1, Tree* stmt2);
Tree* whileOpr(char* name,int head1, int head2,int nextline,Tree* op,Tree* stmt);
Tree* forOpr(char* name,int head1, int head2, int nextline, Tree* op1, Tree* op2, Tree* op3, Tree* stmt);
Tree* retNull(char* name,Tree* ret);
Tree* retOpr(char* name,Tree* ret,Tree* op);
Tree* unaryFunc(char* name,Tree* func, Tree* op);
// 添加修饰符
Tree* addDeclator(char* name, Tree* t1, Tree* t2);
// name, num_args, init, cond, code
Tree* loop(char* name, int number, ...);
void printTree(Tree* tree);
void freeTree(Tree* tree);
#endif
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。