forked from Yufeng-shen/seshat
-
Notifications
You must be signed in to change notification settings - Fork 1
/
grammar.h
69 lines (55 loc) · 2.52 KB
/
grammar.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*Copyright 2014 Francisco Alvaro
This file is part of SESHAT.
SESHAT is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
SESHAT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with SESHAT. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _GRAMMAR_
#define _GRAMMAR_
class gParser;
#include <cstdio>
#include <string>
#include <map>
#include <list>
#include <unordered_set>
#include "production.h"
#include "gparser.h"
#include "symrec.h"
using namespace std;
struct Grammar
{
map<string, int> noTerminales;
list<int> initsyms;
bool *esInit;
SymRec *sym_rec;
unordered_set<string> operatorSet = {"-", "+", "\\pm", "\\times", "\\div", "\\cdot", "=", "\\neq", "\\leq", "\\lt", "\\gt", "\\geq",
"\\in", "\\rightarrow", "COMMA", "\\forall", "\\exists", "\\int", "\\sum", "\\log", "\\lim",
"\\sin", "\\cos", "\\tan", "\\lbrace", "\\lbracket", "\\lpar", "\\rbrace", "\\rbracket", "\\rpar",
"\\prime", "\\vee", "\\wedge", "\\equiv", "\\cup"};
list<ProductionB *> prodsH, prodsSup, prodsSub;
list<ProductionB *> prodsV, prodsVe, prodsIns, prodsMrt, prodsSSE;
list<ProductionT *> prodTerms;
Grammar(char *conf, SymRec *SR);
~Grammar();
const char *key2str(int k);
void addInitSym(char *str);
void addNoTerminal(char *str);
void addTerminal(float pr, char *S, char *T, char *tex);
void addRuleH(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleV(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleVe(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleSup(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleSub(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleSSE(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleIns(float pr, char *S, char *A, char *B, char *out, char *merge);
void addRuleMrt(float pr, char *S, char *A, char *B, char *out, char *merge);
bool isOperator(const char *str) const;
};
#endif