generic-library/ChaiScript
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Commented out code removal

Browse Source
This commit is contained in:
Jason Turner 2011-06-16 10:42:26 -06:00
parent 28e3d442e2
commit 5ff14a54db
1 changed files with 3 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
include/chaiscript/language/chaiscript_parser.hpp
View File

@ -126,13 +126,6 @@ namespace chaiscript
multiplication.push_back("%"); multiplication.push_back("%");
m_operator_matches.push_back(multiplication); m_operator_matches.push_back(multiplication);
/*
m_operators.push_back(AST_Node_Type::Dot_Access);
std::vector<std::string> dot_access;
dot_access.push_back(".");
m_operator_matches.push_back(dot_access);
*/
for ( int c = 0 ; c < detail::lengthof_alphabet ; ++c ) { for ( int c = 0 ; c < detail::lengthof_alphabet ; ++c ) {
for ( int a = 0 ; a < detail::max_alphabet ; a ++ ) { for ( int a = 0 ; a < detail::max_alphabet ; a ++ ) {
m_alphabet[a][c]=false; m_alphabet[a][c]=false;
@ -1481,7 +1474,7 @@ namespace chaiscript
} }
/** /**
* Reads an dot expression(member access), then proceeds to check if it's a function or array call * Reads a dot expression(member access), then proceeds to check if it's a function or array call
*/ */
bool Dot_Fun_Array() { bool Dot_Fun_Array() {
bool retval = false; bool retval = false;
@ -1700,9 +1693,7 @@ namespace chaiscript
* Parses any of a group of 'value' style ast_node groups from input * Parses any of a group of 'value' style ast_node groups from input
*/ */
bool Value() { bool Value() {
if (Var_Decl() || /*Lambda() ||*/ Dot_Fun_Array() || /*Num(true) ||*/ Prefix() /*|| if (Var_Decl() || Dot_Fun_Array() || Prefix()) {
Quoted_String(true) || Single_Quoted_String(true) ||
Paren_Expression() || Inline_Container()*/) {
return true; return true;
} }
else { else {
@ -1739,11 +1730,6 @@ namespace chaiscript
case(AST_Node_Type::Comparison) : case(AST_Node_Type::Comparison) :
build_match(AST_NodePtr(new eval::Comparison_AST_Node()), prev_stack_top); build_match(AST_NodePtr(new eval::Comparison_AST_Node()), prev_stack_top);
break; break;
/*
case(AST_Node_Type::Dot_Access) :
build_match(AST_NodePtr(new eval::Dot_Access_AST_Node()), prev_stack_top);
break;
*/
case(AST_Node_Type::Addition) : case(AST_Node_Type::Addition) :
oper = m_match_stack.at(m_match_stack.size()-2); oper = m_match_stack.at(m_match_stack.size()-2);
m_match_stack.erase(m_match_stack.begin() + m_match_stack.size() - 2, m_match_stack.erase(m_match_stack.begin() + m_match_stack.size() - 2,
@ -2000,7 +1986,7 @@ namespace chaiscript
while ((m_input_pos != m_input_end) && (!Eol())) { while ((m_input_pos != m_input_end) && (!Eol())) {
++m_input_pos; ++m_input_pos;
} }
// TODO: respect // -*- coding: utf-8 -*- on line 1 or 2 see: http://evanjones.ca/python-utf8.html) /// \todo respect // -*- coding: utf-8 -*- on line 1 or 2 see: http://evanjones.ca/python-utf8.html)
} }
if (Statements()) { if (Statements()) {