61 lines
1.6 KiB
C++
61 lines
1.6 KiB
C++
#ifndef PARSER_H
|
|
#define PARSER_H
|
|
|
|
#include "util.h"
|
|
#include "ParseRule.h"
|
|
#include "ParseAction.h"
|
|
#include "Symbol.h"
|
|
#include "State.h"
|
|
#include "StringReader.h"
|
|
#include "Lexer.h"
|
|
#include "NodeTree.h"
|
|
|
|
#include <map>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <stack>
|
|
#include <string>
|
|
#include <iostream>
|
|
|
|
class Parser {
|
|
public:
|
|
Parser();
|
|
~Parser();
|
|
|
|
void loadGrammer(std::string grammerInputString);
|
|
std::vector<Symbol*>* firstSet(Symbol* token);
|
|
void printFirstSets();
|
|
//std::vector<Symbol*>* followSet(int stateNum, Symbol* token);
|
|
std::vector<Symbol*>* gramFollowSet(State* state, Symbol* token);
|
|
std::vector<Symbol*>* gramFollowSetAvoid(State* state, Symbol* token, std::vector<Symbol*>* avoidList);
|
|
void createStateSet();
|
|
void closure(State* state);
|
|
void addStates(std::vector< State* >* stateSets, State* state);
|
|
std::string stateSetToString();
|
|
void addToTable(State* fromState, Symbol* tranSymbol, ParseAction* action);
|
|
ParseAction* getTable(int state, Symbol* token);
|
|
NodeTree* parseInput(Lexer* lexer);
|
|
|
|
std::string grammerToString();
|
|
std::string grammerToDOT();
|
|
|
|
std::string tableToString();
|
|
|
|
private:
|
|
StringReader reader;
|
|
std::map<std::string, Symbol*> symbols;
|
|
std::vector<ParseRule*> loadedGrammer;
|
|
|
|
std::vector< State* > stateSets;
|
|
|
|
std::vector< std::vector<ParseAction*>* > table;
|
|
std::vector<Symbol*> symbolIndexVec;
|
|
|
|
std::stack<int> stateStack;
|
|
std::stack<Symbol*> symbolStack;
|
|
|
|
Symbol* getOrAddSymbol(std::string symbolString, bool isTerminal);
|
|
NodeTree* reduceTreeCombine(Symbol* newSymbol, std::vector<Symbol*> &symbols);
|
|
};
|
|
|
|
#endif |