xxq250
/
Nasal-Interpreter
mirror of https://github.com/ValKmjolnir/Nasal-Interpreter.git
1
0
Fork 0
Code Issues Actions 1 Packages Projects Releases Wiki Activity

Delete code_generator.h

This commit is contained in:
Valk Richard Li 2019-10-02 18:47:29 +08:00 committed by GitHub
parent dabd242214
commit 6b128fd779
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 0 additions and 107 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

107
version0.16/code_generator.h
View File

@ -1,107 +0,0 @@
#ifndef __CODE_GENERATOR_H__
#define __CODE_GENERATOR_H__
#include "abstract_syntax_tree.h"
class code_generator
{
private:
ast_node root;
std::stack<parse_unit> parse;
std::stack<ast_tree_node> node_stack;
public:
code_generator()
{
root.set_type(__root);
}
void number_generator()
{
number_node t;
t.set_line(parse.top().line);
t.set_number(parse.top().content);
if(node_stack.empty())
{
node_stack.push(t);
return;
}
int top_type=node_stack.top().return_type();
if((top_type==__add_operator || top_type==__sub_operator) && node_stack.top().child_num()<2)
node_stack.top().return_list().push_back(t);
else
node_stack.push(t);
return;
}
void operator_generator()
{
operator_expr t;
t.set_line(parse.top().line);
t.set_type(parse.top().type);
if(node_stack.empty())
{
node_stack.push(t);
return;
}
int top_type=node_stack.top().return_type();
if(top_type==__number || top_type==__add_operator || top_type==__sub_operator)
{
t.return_list().push_back(node_stack.top());
node_stack.pop();
node_stack.push(t);
}
return;
}
void input_stack(std::stack<parse_unit>& temp)
{
while(!node_stack.empty())
node_stack.pop();
while(!parse.empty())
parse.pop();
parse=temp;
return;
}
void print_gen_tree()
{
root.print_all_tree();
return;
}
void run_gen_tree()
{
root.run();
return;
}
bool gen_ast()
{
root.return_list().clear();
bool iserror=false;
while(!parse.empty())
{
switch(parse.top().type)
{
case __number:number_generator();break;
case __add_operator:operator_generator();break;
case __sub_operator:operator_generator();break;
default:std::cout<<">>[Error] line "<<parse.top().line<<" parse error.\n";iserror=true;break;
}
parse.pop();
}
std::stack<ast_tree_node> temp_ast;
while(!node_stack.empty())
{
temp_ast.push(node_stack.top());
node_stack.pop();
}
while(!temp_ast.empty())
{
root.return_list().push_back(temp_ast.top());
temp_ast.pop();
}
if(iserror)
return iserror;
std::cout<<">>[Parse] 0 error(s)."<<std::endl;
std::cout<<">>[Parse] Complete checking."<<std::endl;
return false;
}
};
#endif