miloignis/kraken
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Removed LALR parser and an associated member from Symbol, which is used so much that actually got us down to ~3.42GB!

Browse Source
This commit is contained in:
Nathan Braswell
2015-03-23 15:28:03 -04:00
parent 2c4dbc60d1
commit 6fa06f2b7e
10 changed files with 11 additions and 133 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/Parser.cpp
View File

@@ -38,9 +38,11 @@ void Parser::loadGrammer(std::string grammerInputString) {
//First, if this starts with a '#', skip this
if (currToken.front() == '#') {
//If this line is more than one token long, eat it
std::cout << "Ate: " << currToken << std::endl;
if (currToken.back() != '\n')
std::cout << "Eating " << reader.line() << " b/c grammer comment" << std::endl;
//std::cout << "Ate: " << currToken << std::endl;
if (currToken.back() != '\n') {
std::string ate = reader.line();
//std::cout << "Eating " << ate << " b/c grammer comment" << std::endl;
}
currToken = reader.word(false);
continue;
}
@@ -375,17 +377,6 @@ std::string Parser::tableToString() {
//parseInput is now pure virtual
NodeTree<Symbol>* Parser::reduceTreeCombine(Symbol newSymbol, std::vector<Symbol> &symbols) {
NodeTree<Symbol>* newTree = new NodeTree<Symbol>(newSymbol.getName(), newSymbol);
for (std::vector<Symbol>::size_type i = 0; i < symbols.size(); i++) {
if (symbols[i].isTerminal())
newTree->addChild(new NodeTree<Symbol>(symbols[i].getName(), symbols[i]));
else
newTree->addChild(symbols[i].getSubTree());
}
return(newTree);
}
std::string Parser::grammerToString() {
//Iterate through the vector, adding string representation of each grammer rule
std::cout << "About to toString\n";