ilusha/Modules
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

tmp

Browse source
This commit is contained in:
IlyaShurupov 2023-10-31 22:43:37 +03:00 • committed by Ilya Shurupov
parent aecad978ec
commit 53b690dad9
2 changed files with 167 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Language/private/SimpleParser.cpp
View file

@ -1,4 +1,6 @@
#include "NewPlacement.hpp"
#include "SimpleParser.hpp"
using namespace tp;
@ -22,14 +24,13 @@ SimpleParser::SimpleParser() {
}
// Define Regular grammar
RegularGrammar regularGrammar;
RegularGrammar<uint1, int1> rg;
{
// this is basically ast from existing tokenizer
regularGrammar.addRule(regularGrammar.alternate(regularGrammar.repeat(regularGrammar.symbols("asd")), regularGrammar.symbol("a")));
regularGrammar.addRule(regularGrammar.alternate(regularGrammar.repeat(regularGrammar.symbols("asd")), regularGrammar.symbol("a")));
rg.addRule(rg.seq({ rg.val('a'), rg.val('b') }), 0);
}
mUnifiedGrammarParser.compileTables(contextFreeGrammar, regularGrammar);
mUnifiedGrammarParser.compileTables(contextFreeGrammar, rg);
}
void SimpleParser::compileTables(const Sentence& grammar) {
@ -38,7 +39,7 @@ void SimpleParser::compileTables(const Sentence& grammar) {
// compile each ast into RegularGrammar and ContextFree Grammar api instructions
ContextFreeGrammar userContextFreeGrammar;
RegularGrammar userRegularGrammar;
RegularGrammar<uint1, int1> userRegularGrammar;
// ...
// split ast into RE and CF part